<?xml version="1.0" encoding="UTF-8"?>
<feed xmlns="http://www.w3.org/2005/Atom">
    <title>function-call-graph</title>
    <link rel="self" type="application/atom+xml" href="https://links.biapy.com/guest/tags/1120/feed"/>
    <updated>2026-05-15T09:34:16+00:00</updated>
    <id>https://links.biapy.com/guest/tags/1120/feed</id>
            <entry>
            <id>https://links.biapy.com/links/12696</id>
            <title type="text"><![CDATA[Understand Anything]]></title>
            <link rel="alternate" href="https://understand-anything.com/" />
            <link rel="via" type="application/atom+xml" href="https://links.biapy.com/links/12696"/>
            <author>
                <name><![CDATA[Biapy]]></name>
            </author>
            <summary type="text">
                <![CDATA[Other tools show you a hairball. We teach you the codebase. 
Graphs that teach the codebase.

 Graphs that teach &amp;gt; graphs that impress. Turn any code, or knowledge base (Karpathy LLM wiki), into an interactive knowledge graph you can explore, search, and ask questions about. Works with Claude Code, Codex, Cursor, Copilot, Gemini CLI, and more. 

- [Understand Anything  @ GitHub](https://github.com/Lum1104/Understand-Anything).]]>
            </summary>
            <updated>2026-05-14T09:51:37+00:00</updated>
        </entry>
            <entry>
            <id>https://links.biapy.com/links/12660</id>
            <title type="text"><![CDATA[Trailmark]]></title>
            <link rel="alternate" href="https://github.com/trailofbits/trailmark" />
            <link rel="via" type="application/atom+xml" href="https://links.biapy.com/links/12660"/>
            <author>
                <name><![CDATA[Biapy]]></name>
            </author>
            <summary type="text">
                <![CDATA[Build and query a graph database representation of source code.

Parse source code into queryable graphs of functions, classes, calls, and semantic annotations for security analysis.

Trailmark uses tree-sitter for language-agnostic AST parsing and rustworkx for high-performance graph traversal. The long-term vision is to combine this graph with mutation testing and coverage-guided fuzzing to identify gaps between assumptions and test coverage that are reachable from user input.]]>
            </summary>
            <updated>2026-04-30T11:24:45+00:00</updated>
        </entry>
            <entry>
            <id>https://links.biapy.com/links/1296</id>
            <title type="text"><![CDATA[Nuanced]]></title>
            <link rel="alternate" href="https://www.nuanced.dev/" />
            <link rel="via" type="application/atom+xml" href="https://links.biapy.com/links/1296"/>
            <author>
                <name><![CDATA[Biapy]]></name>
            </author>
            <summary type="text">
                <![CDATA[Nuanced is an open-source library that generates enriched call graphs with static analysis annotations, providing AI coding tools with deeper understanding of code behavior.

- [Nuanced @ GitHub](https://github.com/nuanced-dev/nuanced).]]>
            </summary>
            <updated>2025-08-28T19:32:05+00:00</updated>
        </entry>
    </feed>
