Code Analysis: A Symbolic Virtual Machine
summary
The talk explains symbolic execution implemented via a symbolic virtual machine for code analysis: it describes treating inputs as symbols to explore all possible program states and reason about code properties. It focuses on the symbolic execution approach as a technique for finding behaviors and errors across all input combinations.
AI-written summary · about
chapters (12)
- 0:00Introduction
- 1:09Vulnerability issues
- 3:40Static code analysis
- 6:51Symbolic analysis
- 9:19Symbolic VM
- 13:38VM data types
- 14:42Branching and merging
- 20:24If-else handling
- 24:41VM main instructions
- 28:14Example translation
- 32:51Summary and opportunities
- 34:18Q&A
related talks
55mCode Analysis with Zero False Positives in Java
39mOnce Upon a Bytecode: Analysis Tools
01h 06mVerifying a compiler through equational means
29mPartially Evaluating Symbolic Interpreters for All
22mCategorical Semantics of Probabilistic Symbolic Execution
16mCompiling Symbolic Execution with Staging and Algebraic Effects
46mMechanizing Abstract Interpretation
53mFrom Within: Compiler Testing and Validation via Compilers