Polynomial Invariants for Affine Programs

DOI10.1145/3209108.3209142zbMath1497.68113arXiv1802.01810OpenAlexW2963164018MaRDI QIDQ5145329

Ehud Hrushovski, Amaury Pouly, Joël Ouaknine, James Worrell

Publication date: 20 January 2021

Published in: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1802.01810

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Computational aspects of higher-dimensional varieties (14Q15) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (14)

Porous invariants ⋮ Selectively-amortized resource bounding ⋮ Termination of linear loops under commutative updates ⋮ Lonely points in simplices ⋮ From Polynomial Invariants to Linear Loops ⋮ Solving invariant generation for unsolvable loops ⋮ What else is undecidable about loops? ⋮ Symbolic computation in automated program reasoning ⋮ Algebra-based synthesis of loops and their invariants (invited paper) ⋮ Toric varieties from cyclic matrix semigroups ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On Reachability Problems for Low-Dimensional Matrix Semigroups ⋮ Intensional Kleene and Rice theorems for abstract program semantics

This page was built for publication: Polynomial Invariants for Affine Programs