Reasoning Algebraically About P-Solvable Loops

@inproceedings{Kovcs2008ReasoningAA,
  title={Reasoning Algebraically About P-Solvable Loops},
  author={Laura Kov{\'a}cs},
  booktitle={TACAS},
  year={2008}
}
We present a method for generating polynomial invariants for a subfamily of imperative loops operating on numbers, called the P-solvable loops. The method uses algorithmic combinatorics and algebraic techniques. The approach is shown to be complete for some special cases. By completeness we mean that it generates a set of polynomial invariants from which, under additional assumptions, any polynomial invariant can be derived. These techniques are implemented in a new software package Aligator… CONTINUE READING
Highly Cited
This paper has 50 citations. REVIEW CITATIONS

Topics

Statistics

051020082009201020112012201320142015201620172018
Citations per Year

51 Citations

Semantic Scholar estimates that this publication has 51 citations based on the available data.

See our FAQ for additional information.