Paper Info
Title
Jumping and escaping: Modular termination and the abstract path ordering
Abstract
Combinatorial commutation properties for reordering a sequence consisting of two kinds of steps, and for separating the well-foundedness of their combination into well-foundedness of each, are investigated. A weak commutation property, called ''jumping'', along with a weakened version of the lifting property, called ''escaping'' and requiring only an eventual lifting, are used for proving well-foundedness of a generic, abstract version of the recursive path orderings.
Year
DOI
Venue
2012
10.1016/j.tcs.2012.09.013
Theor. Comput. Sci.
Keywords
DocType
Volume
abstract path,recursive path ordering,Combinatorial commutation property,lifting property,eventual lifting,weakened version,modular termination,abstract version,weak commutation property
Journal
464,
ISSN
Citations 
PageRank 
0304-3975
2
0.36
References 
Authors
17
1
Name
Order
Citations
PageRank
Nachum Dershowitz12818473.00