48 search results - page 7 / 10 » Automatic Termination Proofs in the Dependency Pair Framewor... |
APLAS
2010
ACM
13 years 4 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...
FROCOS
2007
Springer
14 years 1 months ago
2007
Springer
We introduce a propositional encoding of the recursive path order with status (RPO). RPO is a combination of a multiset path order and a lexicographic path order which considers pe...
SOFSEM
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. The dependency pair method is a powerful method for automatically proving termination of rewrite systems. When used with traditional simplification orders like LPO and K...
TACAS
2000
Springer
13 years 11 months ago
2000
Springer
Salsa is an invariant checker for speci cations in SAL the SCR Abstract Language. To establish a formula as an invariant without any user guidance Salsa carries out an induction pr...
ICLP
1999
Springer
13 years 11 months ago
1999
Springer
We introduce the notion of bounded nondeterminism for logic programs and queries. A program and a query have bounded nondeterminism if there are finitely many refutations for the...