3 search results - page 1 / 1 » Finding Lexicographic Orders for Termination Proofs in Isabe... |
TPHOL
2007
IEEE
13 years 11 months ago
2007
IEEE
We present a simple method to formally prove termination of recursive functions by searching for lexicographic combinations of size measures. Despite its simplicity, the method tur...
CADE
2006
Springer
14 years 5 months ago
2006
Springer
Abstract. Based on inductive definitions, we develop an automated tool for defining partial recursive functions in Higher-Order Logic and providing appropriate reasoning tools for ...
SOFSEM
2010
Springer
14 years 1 months ago
2010
Springer
Abstract. The first part of this paper presents a new approach for automatically proving nontermination of string rewrite systems. We encode rewrite sequences as propositional for...