Theory Refinement for Program Verification
SAT, pp. 347-363, 2017.
Recent progress in automated formal verification is to a large degree due to the development of constraint languages that are sufficiently light-weight for reasoning but still expressive enough to prove properties of programs. Satisfiability modulo theories (SMT) solvers implement efficient decision procedures, but offer little direct sup...More
Full Text (Upload PDF)
PPT (Upload PPT)