Sciweavers

Share
ERSHOV
2009
Springer

A Complete Invariant Generation Approach for P-solvable Loops

12 years 5 days ago
A Complete Invariant Generation Approach for P-solvable Loops
Abstract. We present an algorithm for generating all polynomial invariants of Psolvable loops with assignments and nested conditionals. We prove termination of our algorithm. The proof relies on showing that the dimensions of the prime ideals from the minimal decomposition of the ideals generated at an iteration of our algorithm either remain the same or decrease at the next iteration of the algorithm. Our experimental results report that our method takes less iterations and/or time than other polynomial invariant generation techniques.
Laura Kovács
Added 26 May 2010
Updated 26 May 2010
Type Conference
Year 2009
Where ERSHOV
Authors Laura Kovács
Comments (0)
books