217 search results - page 8 / 44 » Automatic Termination |
ENTCS
2007
13 years 8 months ago
2007
Context-sensitive rewriting (CSR) is a restriction of rewriting which forbids reductions on selected arguments of functions. Proving termination of CSR is an interesting problem w...
APLAS
2010
ACM
13 years 6 months ago
2010
ACM
We present a framework for defining abstract interpreters for liveness properties, in particular program termination. The framework makes use of the theory of metric spaces to defi...
BIRTHDAY
2007
Springer
14 years 2 months ago
2007
Springer
In contrast to the current general way of developing tools for proving termination automatically, this paper intends to show an alternative program based on using on the one hand t...
CADE
2007
Springer
14 years 9 months ago
2007
Springer
Abstract. Hoare logic is widely used for software specification and verification. Frequently we need to prove the total correctness of a program: to prove that the program not only...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Streams are infinite sequences over a given data type. A stream specification is a set of equations intended to define a stream. We propose a transformation from such a stream spec...