Jumping and escaping: Modular termination and the abstract path ordering

Nachum Dershowitz

doi:10.1016/j.tcs.2012.09.013

Jumping and escaping: Modular termination and the abstract path ordering

Nachum Dershowitz^*

^*Corresponding author for this work

School of Computer Science and AI

Research output: Contribution to journal › Article › peer-review

5 Scopus citations

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.

Original language	English
Pages (from-to)	35-47
Number of pages	13
Journal	Theoretical Computer Science
Volume	464
DOIs	https://doi.org/10.1016/j.tcs.2012.09.013
State	Published - 14 Dec 2012

Keywords

Commutation
Path orderings
Termination
Well-founded orderings

Access to Document

10.1016/j.tcs.2012.09.013

Cite this

@article{6060a7cd771740b0b498e3e1d12e7216,

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.",

keywords = "Commutation, Path orderings, Termination, Well-founded orderings",

author = "Nachum Dershowitz",

year = "2012",

month = dec,

day = "14",

doi = "10.1016/j.tcs.2012.09.013",

language = "אנגלית",

volume = "464",

pages = "35--47",

journal = "Theoretical Computer Science",

issn = "0304-3975",

publisher = "Elsevier B.V.",

}

TY - JOUR

T1 - Jumping and escaping

T2 - Modular termination and the abstract path ordering

AU - Dershowitz, Nachum

PY - 2012/12/14

Y1 - 2012/12/14

N2 - 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.

AB - 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.

KW - Commutation

KW - Path orderings

KW - Termination

KW - Well-founded orderings

UR - https://www.scopus.com/pages/publications/84868586322

U2 - 10.1016/j.tcs.2012.09.013

DO - 10.1016/j.tcs.2012.09.013

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:84868586322

SN - 0304-3975

VL - 464

SP - 35

EP - 47

JO - Theoretical Computer Science

JF - Theoretical Computer Science

ER -

Jumping and escaping: Modular termination and the abstract path ordering

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this