Inference of Polynomial Invariants for Imperative Programs: A Farewell to Gröbner Bases

DOI10.1007/978-3-642-33125-1_7zbMath1401.68036OpenAlexW2963835510MaRDI QIDQ4649805

No author found.

Publication date: 14 November 2012

Published in: Static Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-33125-1_7

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (3)

Algebra, Coalgebra, and Minimization in Polynomial Differential Equations ⋮ Algebra-based synthesis of loops and their invariants (invited paper) ⋮ Automatic proving or disproving equality loop invariants based on finite difference techniques

This page was built for publication: Inference of Polynomial Invariants for Imperative Programs: A Farewell to Gröbner Bases