InvGen
From MaRDI portal
Software:21759
swMATH9780MaRDI QIDQ21759FDOQ21759
Author name not available (Why is that?)
Cited In (14)
- A learning-based approach to synthesizing invariants for incomplete verification engines
- Reasoning About Loops Using Vampire in KeY
- Deriving invariants by algorithmic learning, decision procedures, and predicate abstraction
- Generalizing the Template Polyhedral Domain
- Computing Minimal Separating DFAs and Regular Invariants Using SAT and SMT Solvers
- Lingva: Generating and Proving Program Properties Using Symbol Elimination
- An iterative approach to precondition inference using constrained Horn clauses
- Discovering invariants via simple component analysis
- Backward symbolic execution with loop folding
- Loop Analysis by Quantification over Iterations
- Infinite-state invariant checking with IC3 and predicate abstraction
- Aligators for Arrays (Tool Paper)
- A Data Driven Approach for Algebraic Loop Invariants
- Horn clause verification with convex polyhedral abstraction and tree automata-based refinement
This page was built for software: InvGen
