Code Analysis with Zero False Positives in Java
summary
The talk explains how dynamic symbolic execution can find deep bugs in Java with zero false positives, covering code-analysis categories and modern techniques. It describes implementing symbolic execution in Java so you can build your own analyzer, and shows using an SMT solver (Microsoft Z3) from Java to encode and solve NP-complete problems like Sudoku.
AI-written summary · about
chapters (10)
- 0:00Introduction
- 3:10Code analysis types
- 9:50Program analysis techniques
- 14:27Program approximation
- 21:07Symbolic execution theory
- 27:53SMT solvers and role
- 33:52Symbolic execution problems
- 39:07Solving tasks with SMT
- 45:54Practical applications
- 50:07Product and research
related talks
51mCode Analysis: A Symbolic Virtual Machine
38mStatic Code Analysis - A Behind-the-scenes Look
14mStatic Analysis for Zero-Knowledge Programming Languages
18mSymbolic Execution Explained: Finding Bugs in Complex Code Paths
47mHow Code Analyzers Find Bugs and Security Defects
42mContemporary Automatic Program Analysis
39mOnce Upon a Bytecode: Analysis Tools
30mLet's Build a Symbolic Analyser And Automatically Find Bugs
