Program verification using automatic generation of invariants.
From MaRDI portal
Recommendations
Cited in
(25)- Mathematics for reasoning about loop functions
- Generating algebraic laws from imperative programs
- Discovery of invariant equalities in programs over data fields
- Algebra-based synthesis of loops and their invariants (invited paper)
- On the decidability of the existence of polyhedral invariants in transition systems
- Proving total correctness and generating preconditions for loop programs via symbolic-numeric computation methods
- Generating all polynomial invariants in simple loops
- Automatic proving or disproving equality loop invariants based on finite difference techniques
- An iterative method for generating loop invariants
- Automated generation of loop invariants by recurrence solving in \texttt{Theorema}
- Recent advances in program verification through computer algebra
- Generating Polynomial Invariants with DISCOVERER and QEPCAD
- scientific article; zbMATH DE number 5728684 (Why is no real title available?)
- On invariant checking
- Automatic Generation of Polynomial Loop Invariants
- Synthesizing invariants by solving solvable loops
- Loop invariants: analysis, classification, and examples
- A data driven approach for algebraic loop invariants
- Verification by Parallelization of Parametric Code
- Valigator: A Verification Tool with Bound and Invariant Generation
- Computer Aided Verification
- Reflexive transitive invariant relations: A basis for computing loop functions
- First order Büchi automata and their application to verification of LTL specifications
- Deaccumulation techniques for improving provability
- A quantifier-elimination based heuristic for automatically generating inductive assertions for programs
This page was built for publication: Program verification using automatic generation of invariants.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5709984)