Algebraic tools for computing polynomial loop invariants
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 52945 (Why is no real title available?)
- scientific article; zbMATH DE number 1201576 (Why is no real title available?)
- scientific article; zbMATH DE number 527343 (Why is no real title available?)
- scientific article; zbMATH DE number 621806 (Why is no real title available?)
- A survey on signature-based algorithms for computing Gröbner bases
- Affine relationships among variables of a program
- Algebra-Based Loop Analysis
- Algorithms in real algebraic geometry
- Ascending chains of ideals in the polynomial ring
- Automata, Languages and Programming
- Automatic Generation of Polynomial Loop Invariants
- Automatic generation of polynomial invariants of bounded degree using abstract interpretation
- Computing polynomial program invariants
- Computing the algebraic relations of \(C\)-finite sequences and multisequences
- Generating all polynomial invariants in simple loops
- Length of Polynomial Ascending Chains and Primitive Recursiveness.
- Modern computer algebra
- On strongest algebraic program invariants
- Polynomial Invariants for Affine Programs
- Polynomial invariants by linear algebra
- Reasoning Algebraically About P-Solvable Loops
- Solving invariant generation for unsolvable loops
- Synthesizing invariants by solving solvable loops
- TRACE MAPS, INVARIANTS, AND SOME OF THEIR APPLICATIONS
- The complexity of the word problems for commutative semigroups and polynomial ideals
- Trace maps as 3D reversible dynamical systems with an invariant
- msolve. A library for solving polynomial systems
This page was built for publication: Algebraic tools for computing polynomial loop invariants
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7033521)
