Automatic generation of polynomial invariants of bounded degree using abstract interpretation
From MaRDI portal
(Redirected from Publication:859956)
Recommendations
Cited in
(23)- Polynomial invariants generation of programs
- Algebra-based synthesis of loops and their invariants (invited paper)
- Proving correctness of imperative programs by linearizing constrained Horn clauses
- On invariant checking
- Static Analysis
- Elimination Techniques for Program Analysis
- Static Analysis
- When is a formula a loop invariant?
- Affine Loop Invariant Generation via Matrix Algebra
- Generating invariants for non-linear loops by linear algebraic methods
- Polynomial invariants for linear loops
- Automatic proving or disproving equality loop invariants based on finite difference techniques
- Reusable contracts for safe integration of reinforcement learning in hybrid systems
- Generating all polynomial invariants in simple loops
- Endomorphisms for Non-trivial Non-linear Loop Invariant Generation
- Mechanical inference of invariants for FOR-loops
- Degree and dimension estimates for invariant ideals of \(P\)-solvable recurrences
- Analysing All Polynomial Equations in ${\mathbb Z_{2^w}}$
- MDPs as distribution transformers: affine invariant synthesis for safety objectives
- An iterative method for generating loop invariants
- Automatic Generation of Invariants for Circular Derivations in SUP(LA)
- scientific article; zbMATH DE number 7559488 (Why is no real title available?)
- The structure of polynomial invariants of linear loops
This page was built for publication: Automatic generation of polynomial invariants of bounded degree using abstract interpretation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q859956)