4 ms·
For the curious, solvers like z3 are used in programming languages to verify logic and constraints. Basically it can help find logic issues and bugs during comp
by potato-peeler 9mo ago
For the curious, solvers like z3 are used in programming languages to verify logic and constraints. Basically it can help find logic issues and bugs during compile time itself, instead of waiting for it to show up in runtime.
https://en.wikipedia.org/wiki/Satisfiability_modulo_theories#Verification https://en.wikipedia.org/wiki/Satisfiability_modulo_theories...
- bjornsing 9mo agoThe concept is called static analysis.
- ukuina 9mo agoSeems adjacent, with some overlap.
- mathisfun123 9mo agoin theory that's what a compiler is - a thin wrapper over a SAT solver. in practice most compilers just use heuristics <shrug>.
- lkuty 9mo agoLike in the Dafny pogramming language. Cfr. https://www.youtube.com/watch?v=oLS_y842fMc https://www.youtube.com/watch?v=oLS_y842fMc