203 search results - page 6 / 41 » Datatype-Generic Termination Proofs |
92
Voted
CORR
2000
Springer
14 years 11 months ago
2000
Springer
For logic programs with arithmetic predicates, showing termination is not easy, since the usual order for the integers is not well-founded. A new method, easily incorporated in th...
101
click to vote
RTA
2004
Springer
15 years 5 months ago
2004
Springer
We describe the system AProVE, an automated prover to verify (innermost) termination of term rewrite systems (TRSs). For this system, we have developed and implemented efficient al...
120
click to vote
JAR
2010
14 years 6 months ago
2010
Based on inductive definitions, we develop a tool that automates the definition of partial recursive functions in higher-order logic (HOL) and provides appropriate proof rules for ...
107
click to vote
ENTCS
2008
14 years 11 months ago
2008
Yi and Sakai [9] showed that the termination problem is a decidable property for the class of semi-constructor term rewriting systems, which is a superclass of the class of right ...
CADE
2007
Springer
16 years 2 hour ago
2007
Springer
We develop a formalization of the Size-Change Principle in Isabelle/HOL and use it to construct formally certified termination proofs for recursive functions automatically.