161 search results - page 1 / 33 » A Complete Method for the Synthesis of Linear Ranking Functi... |
VMCAI
2004
Springer
13 years 11 months ago
2004
Springer
TACAS
2010
Springer
14 years 14 days ago
2010
Springer
Ranking function synthesis is a key aspect to the success of modern termination provers for imperative programs. While it is wellknown how to generate linear ranking functions for ...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
The classical technique for proving termination of a generic sequential computer program involves the synthesis of a ranking function for each loop of the program. Linear ranking ...
ICALP
2005
Springer
13 years 11 months ago
2005
Springer
Although every terminating loop has a ranking function, not every loop has a ranking function of a restricted form, such as a lexicographic tuple of polynomials over program variab...
CAV
2005
Springer
13 years 11 months ago
2005
Springer
We present a complete method for synthesizing lexicographic linear ranking functions supported by inductive linear invariants for loops with linear guards and transitions. Proving ...