We discuss interesting properties of a general technique for inferring polynomial invariants for a subfamily of imperative loops, called the P-solvable loops, with assignments only. The approach combines algorithmic combinatorics, polynomial algebra and computational logic, and it is implemented in a new software package called Aligator. We present a collection of examples illustrating the power of the framework. © 2008 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Kovács, L. (2008). Invariant generation for p-solvable loops with assignments. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5010 LNCS, pp. 349–359). https://doi.org/10.1007/978-3-540-79709-8_35
Mendeley helps you to discover research relevant for your work.