PV3 ⊧ VVT: Vienna Verification Toolencodes an LLVM program into a transition relation and checks properties on it
Application domain/field
- Infinite-state systems
- Counterexample-guided abstraction refinement (CEGAR)
- Predicate abstraction
- Model checking
- Bounded model checking
Expected input
ProgramFormat:
C/C++ and SMTLib2Internals
VVT primarily targets the verification of infinite parallel programs. VVT consists of several toolsvvt-enc
to translate instrumented bitcode into an SMTLIB-based formatvvt-opt
to deploy several optimization techniquesvvt-verify
to verify the programvvt-bmc
to rapidly find counterexamples