When is a formula a loop invariant?
From MaRDI portal
Recommendations
Cites work
- A quantifier-elimination based heuristic for automatically generating inductive assertions for programs
- A refutational approach to geometry theorem proving
- Automatic generation of polynomial invariants of bounded degree using abstract interpretation
- Generalized property directed reachability
- Generating all polynomial invariants in simple loops
- scientific article; zbMATH DE number 3941661 (Why is no real title available?)
- Ideals, Varieties, and Algorithms
- Linear ranking for linear lasso programs
- Model Checking Software
- On invariant checking
- Programming Languages and Systems
- Property directed polyhedral abstraction
- Property-directed incremental invariant generation
- SAT-Based Model Checking without Unrolling
- Synthesis of circular compositional program proofs via abduction
- Understanding IC3
- Verification Constraint Problems with Strengthening
Cited in
(5)
This page was built for publication: When is a formula a loop invariant?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2945711)