Computing polynomial program invariants
From MaRDI portal
Publication:2390319
Recommendations
- Polynomial approximations of the relational semantics of imperative programs
- Polynomial invariants generation of programs
- Inference of polynomial invariants for imperative programs: a farewell to Gröbner bases
- Polynomial invariants by linear algebra
- Discovery of invariant equalities in programs over data fields
Cites work
- Affine relationships among variables of a program
- Automata, Languages and Programming
- Automatic generation of invariants and intermediate assertions
- Countable nondeterminism and random assignment
- scientific article; zbMATH DE number 1692940 (Why is no real title available?)
- scientific article; zbMATH DE number 3592938 (Why is no real title available?)
- scientific article; zbMATH DE number 1231565 (Why is no real title available?)
- scientific article; zbMATH DE number 1948385 (Why is no real title available?)
- Non-linear loop invariant generation using Gröbner bases
- Precise interprocedural analysis through linear algebra
Cited in
(35)- Self-correcting polynomial programs
- First-order orbit queries
- Algebra-based synthesis of loops and their invariants (invited paper)
- A method of proving the invariance of linear inequalities for linear loops
- Discovering non-terminating inputs for multi-path polynomial programs
- Polynomial invariants for linear loops
- Generating all polynomial invariants in simple loops
- Polynomial interrupt timed automata: verification and expressiveness
- Degree and dimension estimates for invariant ideals of P-solvable recurrences
- Analysis of linear definite iterative loops
- An iterative method for generating loop invariants
- On the computational complexity of dynamic slicing problems for program schemas
- Analysing All Polynomial Equations in ${\mathbb Z_{2^w}}$
- Invariant inequalities in programs interpreted over an ordered field
- Acceleration of the abstract fixpoint computation in numerical program analysis
- Inference of polynomial invariants for imperative programs: a farewell to Gröbner bases
- Tight polynomial bounds for loop programs in polynomial space
- scientific article; zbMATH DE number 7559115 (Why is no real title available?)
- Tight polynomial worst-case bounds for loop programs
- Polynomial Invariants for Affine Programs
- Interprocedurally Analyzing Polynomial Identities
- Automata, Languages and Programming
- Static Analysis
- Mechanical inference of invariants for FOR-loops
- Solving invariant generation for unsolvable loops
- What else is undecidable about loops?
- Certified verification for algebraic abstraction
- Slice closures of indexed languages and word equations with counting constraints
- (Un)solvable loop analysis
- On strongest algebraic program invariants
- Algebraic tools for computing polynomial loop invariants
- Algebraic and algorithmic methods for computing polynomial loop invariants
- On termination of polynomial programs with equality conditions
- Polynomial approximations of the relational semantics of imperative programs
- The structure of polynomial invariants of linear loops
This page was built for publication: Computing polynomial program invariants
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2390319)
