3 search results - page 1 / 1 » Invariant Generation for P-Solvable Loops with Assignments |
CSR
2008
Springer
13 years 6 months ago
2008
Springer
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...
ISSAC
2004
Springer
13 years 9 months ago
2004
Springer
In [17], an abstract framework for automatically generating loop invariants of imperative programs was proposed. This framework was then instantiated for the language of conjuncti...
ERSHOV
2009
Springer
13 years 11 months ago
2009
Springer
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 p...