142 search results - page 3 / 29 » Proving Termination by Invariance Relations |
LOPSTR
2004
Springer
14 years 23 days ago
2004
Springer
This paper describes a method for proving termination of to logic programs based on abstract interpretation. The method ry-mapping pairs to abstract the relation between calls in t...
CONCUR
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. We present a new method for proving liveness and termination properties for fair concurrent programs, which does not rely on finding a ranking function or on computing th...
FROCOS
2005
Springer
14 years 28 days ago
2005
Springer
Abstract. In this paper we combine rewriting techniques with verification issues. More precisely, we show how techniques for proving relative termination of term rewrite systems (...
CAV
2012
Springer
11 years 9 months ago
2012
Springer
An algorithmic-learning-based termination analysis technique is presented. The new technique combines transition predicate abstraction, algorithmic learning, and decision procedure...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
The safety of infinite state systems can be checked by a backward reachability procedure. For certain classes of systems, it is possible to prove the termination of the procedure ...