Loading...
conference paper
Invariant generation for P-solvable loops with assignments
Kovacs, Laura
2008
Computer Science - Theory And Applications
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.
Type
conference paper
Web of Science ID
WOS:000256351100035
Authors
Kovacs, Laura
Publication date
2008
Published in
Computer Science - Theory And Applications
ISBN of the book
978-3-540-79708-1
Series title/Series vol.
Lecture Notes In Computer Science; 5010
Start page
349
End page
359
Subjects
Peer reviewed
REVIEWED
EPFL units
Event name | Event place | Event date |
Moscow, RUSSIA | Jun 07-12, 2008 | |
Available on Infoscience
November 30, 2010
Use this identifier to reference this record