Programming Constraint Services with Z3 (Nikolaj Bjørner, ISPRASOPEN-2019)
Материал из 0x1.tv
- Nikolaj Bjørner
Many program verification, analysis, testing and synthesis queries reduce to solving satisfiability of logical formulas. Yet, there are many applications where satisfiability, and optionally a model or a proof, is insufficient. Examples of useful additional information include interpolants, models that satisfy optimality criteria, generating strategies for solving quantified formulas, enumerating and counting solutions. The tutorial describes, in an interactive way using jupyter notebooks, logical services from the point of view of the Satisfiability Modulo Theories solver Z3.