THE VIDEO SHELF · smt solvers and program verification
Analyzing Programs with Z3
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 readers recommended it
HN lists it among the practical entry points for learning Z3 and formal verification.
This is a summary from the source dataset, not an endorsement by Hacker News or the video creator.
Video & recommendation details
- Creator / channel
- Compose Conference
- Topic
- smt solvers and program verification
- Format
- talk
- Level
- intermediate
- HN recommenders in dataset
- 2
- HN mentions in dataset
- 3
- Recommendation years in dataset
- 2016–2021
These counts and years describe the included Hacker News records; they are not YouTube views or the video’s publication date.
From the original HN conversations
Excerpts from the recorded comments. Follow each source for the full comment and surrounding discussion.
If you want a fun example of using Z3, I gave a talk recently that walks you through verifying programs in a tiny little imperative language by compiling them to Z3 formulas. It's easier than it sounds! It was recorded [1] and I have example …
tikhonj on Hacker News · 2016-08
In Z3 SMT solver interactive tutorial### FV Resources These are few and far between. My paper on it is soup to nuts for how we do it in Pact which, while technical, should be somewhat approachable for most devs to grasp (I tried at least -- representing a program as …
buckie on Hacker News · 2017-07
In Show HN: Dharma – Programmable Peer-To-Peer Loans Using Ethereum Smart Contracts
Summaries, classifications and recommendation records are from the HackerTube source dataset. Read about this library and its limitations.