Analyzing Programs with Z3
Compose Conference · 2 HN recommendations
Video Q&A
Ask AI to explain this scene or summarize the whole video. When an answer includes timestamps, select one to jump to that moment.
Try asking: What is the speaker explaining here?
Google sign-in is required. Review the maximum credit cost before confirming.
Tikhon Jelvis's Compose Conference talk on using the Z3 SMT solver to analyze and verify programs, including checking invariants with bounded loops. He demonstrates verifying programs in a small language by compiling them to Z3.
Why HN recommends it: HN lists it among the practical entry points for learning Z3 and formal verification.
“the best one I've found as an entry point was the approach they use in Cryptol” Read on HN ↗