1716 search results - page 42 / 344 » Proving Conditional Termination |
CADE
2001
Springer
14 years 1 months ago
2001
Springer
The dependency pair method of Arts and Giesl is the most powerful technique for proving termination of term rewrite systems automatically. We show that the method can be improved b...
LICS
1991
IEEE
14 years 6 days ago
1991
IEEE
Abstract. We extend the termination proof methods based on reduction orderings to higher-order rewriting systems `a la Nipkow using higher-order pattern matching for firing rules,...
TPHOL
1994
IEEE
14 years 24 days ago
1994
IEEE
Verification Condition Generator (VCG) tools have been effective in simplifying the task of proving programs correct. However, in the past these VCG tools have in general not thems...
ESOP
2010
Springer
14 years 6 months ago
2010
Springer
Type-based amortised resource analysis following Hofmann and Jost--where resources are associated with individual elements of data structures and doled out to the programmer under ...
ECAI
2010
Springer
13 years 9 months ago
2010
Springer
Non-standard reasoning in Description Logics (DLs) comprises computing a Least Common Subsumer (LCS), a Concept Difference, a Concept Unifier, or an Interpolant Concept, to name a ...