Sciweavers

97 search results - page 9 / 20
» The Higher-Order Recursive Path Ordering
Sort
View
CADE
2006
Springer
14 years 11 months ago
Automation of Recursive Path Ordering for Infinite Labelled Rewrite Systems
Abstract. Semantic labelling is a transformational technique for proving termination of Term Rewriting Systems (TRSs). Only its variant with finite sets of labels was used so far i...
Adam Koprowski, Hans Zantema
BIRTHDAY
2006
Springer
14 years 2 months ago
Iterative Lexicographic Path Orders
Abstract. We relate Kamin and L
Jan Willem Klop, Vincent van Oostrom, Roel C. de V...
FROCOS
2007
Springer
14 years 5 months ago
Proving Termination Using Recursive Path Orders and SAT Solving
We introduce a propositional encoding of the recursive path order with status (RPO). RPO is a combination of a multiset path order and a lexicographic path order which considers pe...
Peter Schneider-Kamp, René Thiemann, Elena ...
JACM
2007
84views more  JACM 2007»
13 years 10 months ago
Polymorphic higher-order recursive path orderings
This paper extends the termination proof techniques based on reduction orderings to a higher-order setting, by defining a family of recursive path orderings for terms of a typed ...
Jean-Pierre Jouannaud, Albert Rubio
CORR
2008
Springer
104views Education» more  CORR 2008»
13 years 11 months ago
De Bruijn Graph Homomorphisms and Recursive De Bruijn Sequences
This paper presents a method to find new De Bruijn cycles based on ones of lesser order. This is done by mapping a De Bruijn cycle to several vertex disjoint cycles in a De Bruijn ...
Abbas Alhakim, Mufutau Akinwande