142 search results - page 1 / 29 » Proving Termination by Invariance Relations |
ICLP
2009
Springer
13 years 2 months ago
2009
Springer
CAV
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. Modern termination provers rely on a safety checker to construct disjunctively well-founded transition invariants. This safety check is known to be the bottleneck of the ...
VMCAI
2005
Springer
13 years 10 months ago
2005
Springer
DAC
2006
ACM
14 years 5 months ago
2006
ACM
In this paper, we present a method that helps improve the performance of Bounded Model Checking by automatically strengthening invariants so that the termination proof may be obta...
LOPSTR
2009
Springer
13 years 11 months ago
2009
Springer
In this work, we first consider a goal-oriented extension of the dependency pair framework for proving termination w.r.t. a given set of initial terms. Then, we introduce a new re...