Static Analysis
From MaRDI portal
Recommendations
- Automatic generation of polynomial invariants of bounded degree using abstract interpretation
- Automatic Generation of Polynomial Loop Invariants
- Polynomial invariants generation of programs
- Computing polynomial program invariants
- A rewriting technique for universal polynomial invariants
- Generating Polynomial Invariants with DISCOVERER and QEPCAD
- Invariant generation for multi-path loops with polynomial assignments
- Inference of polynomial invariants for imperative programs: a farewell to Gröbner bases
- Counterexample-guided polynomial loop invariant generation by Lagrange interpolation
Cited in
(12)- Generating all polynomial invariants in simple loops
- Constructing invariants for hybrid systems
- Automatic Generation of Invariants for Circular Derivations in SUP(LA)
- An iterative method for generating loop invariants
- Recent advances in program verification through computer algebra
- Analysing All Polynomial Equations in ${\mathbb Z_{2^w}}$
- Program verification: state of the art, problems, and results. I
- Elimination Techniques for Program Analysis
- Polynomial invariants generation of programs
- Automatic generation of polynomial invariants of bounded degree using abstract interpretation
- A quantifier-elimination based heuristic for automatically generating inductive assertions for programs
- Change-of-bases abstractions for non-linear hybrid systems
This page was built for publication: Static Analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5466567)
