STG for ABI monitoring
summary
STG models ABIs as labeled graphs and claims a linear-time graph comparison that matches nodes by local equivalence, follows labeled edges, and stops on connectivity to produce diffs for graphs of hundreds of thousands of nodes. It already ingests BTF and libabigail XML input and emits readable diffs, but lacks graph deduplication, a VCS-friendly textual format, and full ELF/DWARF transformations; unresolved cases include anonymous/forward-declared types, typedefs and qualifiers, and void* casts that need compiler dataflow to fix.
AI-written summary · about
chapters (6)
- 0:00Introduction and motivation
- 0:41ABI as graph representation
- 3:31Why graphs matter for ABIs
- 5:18Graph algorithms for ABI monitoring
- 7:04Open challenges and next steps
- 10:14Q&A and feedback
related talks
19mPick Your Call Graphs Well: On Scaling IFDS-Based Data-Flow Analyses
21mAbstract Debuggers: Exploring Program Behaviors Using Static Analysis Results
45mUsing AI, statistics, and set theory to know what to test
01h 00mContinuous Regression Testing for Safer and Faster Refactoring in C++
17mDifferential Network Analysis
14mDebugging debuggers!!!
34mCan your diff(1) do this?! Improving software review and QA with diffoscope
35mBisection: It's Not Just for Git