288 search results - page 22 / 58 » Interactive Termination Proofs Using Termination Cores |
CONCUR
2006
Springer
15 years 1 months ago
2006
Springer
Abstract We study the use of the elaboration preorder (due to ArunKumar and Natarajan) in the framework of up-to techniques for weak bisimulation. We show that elaboration yields a...
61
Voted
TPHOL
2003
IEEE
15 years 2 months ago
2003
IEEE
Coverage checking is the problem of deciding whether any closed term of a given type is an instance of at least one of a given set of patterns. It can be used to verify if a functi...
LPAR
1999
Springer
15 years 1 months ago
1999
Springer
Abstract. Walther’s estimation calculus was designed to prove the termination of functional programs, and can also be used to solve the similar problem of proving the well-founde...
93
Voted
BIRTHDAY
2007
Springer
15 years 3 months ago
2007
Springer
Showing termination of the Battle of Hercules and Hydra is a challenge. We present the battle both as a rewrite system and as an arithmetic while program, provide proofs of their t...
ITP
2010
15 years 1 months ago
2010
Abstract. Rippling is a heuristic used to guide rewriting and is typically used for inductive theorem proving. We introduce a method to support case-analysis within rippling. Like ...