Theory Refinement for Program Verification

SAT, pp. 347-363, 2017.

Cited by: 5|Bibtex|Views20|Links
EI

Abstract:

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

Code:

Data:

Your rating :
0

 

Tags
Comments