Loading...
conference paper
A Complete Invariant Generation Approach for P-solvable Loops
Kovacs, Laura
2010
Perspectives Of Systems Informatics
We present an algorithm for generating all polynomial invariants of P-solvable 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.
Use this identifier to reference this record
Type
conference paper
Web of Science ID
WOS:000279247200020
Authors
Kovacs, Laura
Publication date
2010
Published in
Perspectives Of Systems Informatics
ISBN of the book
978-3-642-11485-4
Series title/Series vol.
Lecture Notes in Computer Science; 5947
Start page
242
End page
256
Subjects
EPFL units
Event name | Event place | Event date |
Novosibirsk, RUSSIA | Jun 15-19, 2009 | |
Available on Infoscience
December 16, 2011