Reasoning algebraically about P-solvable loops
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 written in Mathematica and successfully tried on many programs implementing interesting algorithms working on numbers.
WOS:000254735100018
2008
978-3-540-78799-0
Lecture Notes In Computer Science; 4963
249
264
REVIEWED
Event name | Event place | Event date |
Budapest, HUNGARY | Mar 29-Apr 06, 2008 | |