VS3: SMT Solvers for Program Verification (2009)
Cached
Download Links
| Citations: | 8 - 5 self |
BibTeX
@MISC{Srivastava09vs3:smt,
author = {Saurabh Srivastava and Sumit Gulwani and Jeffrey S. Foster},
title = {VS3: SMT Solvers for Program Verification},
year = {2009}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. We present VS 3, a tool that automatically verifies complex properties of programs and infers maximally weak preconditions and maximally strong postconditions by leveraging the power of SMT solvers. VS 3 discovers program invariants with arbitrary, but prespecified, quantification and logical structure. The user supplies VS 3 with a set of predicates and invariant templates. VS 3 automatically finds instantiations of the unknowns in the templates as subsets of the predicate set. We have used VS 3 to automatically verify ∀ ∃ properties of programs and to infer worst case upper bounds and preconditions for functional correctness. 1
Citations
| 244 | Z3: An efficient SMT solver - Moura, Bjørner - 2008 |
| 28 | Efficient E-matching for SMT solvers - Moura, Bjørner - 2007 |
| 16 | R.: Program analysis as constraint solving - Gulwani, Srivastava, et al. - 2008 |
| 11 | Finding loop invariants for programs over arrays using a theorem prover - Kovács, Voronkov - 2009 |
| 3 | L.D.: IIV: An invisible invariant verifier - Balaban, Fang, et al. |
| 1 | S.: Program verication using templates over predicate abstraction - Srivastava, Gulwani |
| 1 | R.: Constraint based invariant inference over predicate abstraction. In: VMCAI - Gulwani, Srivastava, et al. - 2009 |
