论文信息 - VS3: SMT Solvers for Program Verification

VS3: SMT Solvers for Program Verification

We present VS3, 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. VS3 discovers program invariants with arbitrary, but prespecified, quantification and logical structure. The user supplies VS3 with a set of predicates and invariant templates. VS3 automatically finds instantiations of the unknowns in the templates as subsets of the predicate set. We have used VS3 to automatically verify *** *** properties of programs and to infer worst case upper bounds and preconditions for functional correctness.

[1] Amir Pnueli,et al. IIV: An Invisible Invariant Verifier , 2005, CAV.

[2] Rajeev Alur,et al. A Temporal Logic of Nested Calls and Returns , 2004, TACAS.

[3] Nikolaj Bjørner,et al. Efficient E-Matching for SMT Solvers , 2007, CADE.

[4] Sumit Gulwani,et al. Constraint-Based Invariant Inference over Predicate Abstraction , 2008, VMCAI.

[5] Andrei Voronkov,et al. Finding Loop Invariants for Programs over Arrays Using a Theorem Prover , 2009, FASE.

[6] Sumit Gulwani,et al. Program analysis as constraint solving , 2008, PLDI '08.

[7] Nikolaj Bjørner,et al. Z3: An Efficient SMT Solver , 2008, TACAS.

[8] Andrei Voronkov,et al. Finding Loop Invariants for Programs over Arrays Using a Theorem Prover , 2009, 2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing.

[9] Sumit Gulwani,et al. Program verification using templates over predicate abstraction , 2009, PLDI '09.