3221 search results - page 9 / 645 » Termination of Linear Programs |
RTA
2011
Springer
12 years 10 months ago
2011
Springer
In [5, 15] we presented an approach to prove termination of non-recursive Java Bytecode (JBC) programs automatically. Here, JBC programs are first transformed to finite terminat...
CAV
2005
Springer
14 years 1 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 ...
CAV
2006
Springer
13 years 11 months ago
2006
Springer
We describe a new program termination analysis designed to handle imperative programs whose termination depends on the mutation rogram's heap. We first describe how an abstrac...
PPDP
2001
Springer
14 years 6 days ago
2001
Springer
IANDC
2008
13 years 7 months ago
2008
The main goal of this paper is to apply rewriting termination technology --enjoying a quite mature set of termination results and tools-- to the problem of proving automatically t...