203 search results - page 15 / 41 » Datatype-Generic Termination Proofs |
112
click to vote
IANDC
2007
15 years 1 months ago
2007
The Tyrolean Termination Tool (TTT for short) is a powerful tool for automatically proving termination of rewrite systems. It incorporates several new refinements of the dependen...
112
click to vote
LATA
2009
Springer
15 years 8 months ago
2009
Springer
Introducing priorities on rules in rewriting increases their expressive power and helps to limit computations. Priority rewriting is used in rule-based programming as well as in f...
185
click to vote
SCP
2011
14 years 8 months ago
2011
A definitional extension LNGMIt of the Calculus of Inductive Constructions (CIC), that underlies the proof assistant Coq, is presented that allows also to program with nested dat...
119
click to vote
DAC
2006
ACM
16 years 2 months ago
2006
ACM
In this paper, we present a method that helps improve the performance of Bounded Model Checking by automatically strengthening invariants so that the termination proof may be obta...
106
Voted
CADE
2001
Springer
16 years 2 months ago
2001
Springer
In this paper, we present a syntax-directed termination and reduction checker for higher-order logic programs. The reduction checker verifies parametric higher-order subterm orderi...