Sciweavers

39 search results - page 1 / 8
» A Complete Invariant Generation Approach for P-solvable Loop...
Sort
View
ERSHOV
2009
Springer
13 years 11 months 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 p...
Laura Kovács
ISSAC
2004
Springer
185views Mathematics» more  ISSAC 2004»
13 years 10 months ago
Automatic generation of polynomial loop
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...
Enric Rodríguez-Carbonell, Deepak Kapur
CADE
2008
Springer
13 years 6 months ago
Aligator: A Mathematica Package for Invariant Generation (System Description)
We describe the new software package Aligator for automatically inferring polynomial loop invariants. The package combines algorithms from symbolic summation and polynomial algebra...
Laura Kovács
CSR
2008
Springer
13 years 6 months ago
Invariant Generation for P-Solvable Loops with Assignments
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...
Laura Kovács
CAV
2005
Springer
135views Hardware» more  CAV 2005»
13 years 10 months ago
Linear Ranking with Reachability
We present a complete method for synthesizing lexicographic linear ranking functions supported by inductive linear invariants for loops with linear guards and transitions. Proving ...
Aaron R. Bradley, Zohar Manna, Henny B. Sipma