Jumping and escaping: Modular termination and the abstract path ordering

Nachum Dershowitz*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

5 Scopus citations


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.

Original languageEnglish
Pages (from-to)35-47
Number of pages13
JournalTheoretical Computer Science
StatePublished - 14 Dec 2012


  • Commutation
  • Path orderings
  • Termination
  • Well-founded orderings


Dive into the research topics of 'Jumping and escaping: Modular termination and the abstract path ordering'. Together they form a unique fingerprint.

Cite this