Termination

Nachum Dershowitz

doi:10.1007/3-540-15976-2_9

Termination

Nachum Dershowitz^*

^*Corresponding author for this work

University of Illinois

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

41 Scopus citations

Abstract

This survey describes methods for proving that systems of rewrite rules terminate. Illustrations of the use of path orderings and other simplification orderings in termination proofs are given. The effect of restrictions, such as linearity, on the form of rules is considered. In general, though, termination is an undecidable property of rewrite systems.

Original language	English
Title of host publication	Rewriting Techniques and Applications
Editors	Jean-Pierre Jouannaud
Publisher	Springer Verlag
Pages	180-224
Number of pages	45
ISBN (Print)	9783540159766
DOIs	https://doi.org/10.1007/3-540-15976-2_9
State	Published - 1985
Externally published	Yes
Event	1st International Conference on Rewriting Techniques and Applications, RTA 1985 - Dijon, France Duration: 20 May 1985 → 22 May 1985

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	202 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	1st International Conference on Rewriting Techniques and Applications, RTA 1985
Country/Territory	France
City	Dijon
Period	20/05/85 → 22/05/85

Funding

Funders	Funder number
National Science Foundation	MCS 83-07755

Access to Document

10.1007/3-540-15976-2_9

Cite this

@inproceedings{b2a02c2d847a41a5ab0f684e032caca2,

title = "Termination",

abstract = "This survey describes methods for proving that systems of rewrite rules terminate. Illustrations of the use of path orderings and other simplification orderings in termination proofs are given. The effect of restrictions, such as linearity, on the form of rules is considered. In general, though, termination is an undecidable property of rewrite systems.",

author = "Nachum Dershowitz",

note = "Publisher Copyright: {\textcopyright} 1985, Springer-Verlag.; 1st International Conference on Rewriting Techniques and Applications, RTA 1985 ; Conference date: 20-05-1985 Through 22-05-1985",

year = "1985",

doi = "10.1007/3-540-15976-2_9",

language = "אנגלית",

isbn = "9783540159766",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "180--224",

editor = "Jean-Pierre Jouannaud",

booktitle = "Rewriting Techniques and Applications",

address = "גרמניה",

}

Dershowitz, N 1985, Termination. in J-P Jouannaud (ed.), Rewriting Techniques and Applications. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 202 LNCS, Springer Verlag, pp. 180-224, 1st International Conference on Rewriting Techniques and Applications, RTA 1985, Dijon, France, 20/05/85. https://doi.org/10.1007/3-540-15976-2_9

Termination. / Dershowitz, Nachum.
Rewriting Techniques and Applications. ed. / Jean-Pierre Jouannaud. Springer Verlag, 1985. p. 180-224 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 202 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Termination

AU - Dershowitz, Nachum

PY - 1985

Y1 - 1985

N2 - This survey describes methods for proving that systems of rewrite rules terminate. Illustrations of the use of path orderings and other simplification orderings in termination proofs are given. The effect of restrictions, such as linearity, on the form of rules is considered. In general, though, termination is an undecidable property of rewrite systems.

AB - This survey describes methods for proving that systems of rewrite rules terminate. Illustrations of the use of path orderings and other simplification orderings in termination proofs are given. The effect of restrictions, such as linearity, on the form of rules is considered. In general, though, termination is an undecidable property of rewrite systems.

UR - http://www.scopus.com/inward/record.url?scp=85035005837&partnerID=8YFLogxK

U2 - 10.1007/3-540-15976-2_9

DO - 10.1007/3-540-15976-2_9

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85035005837

SN - 9783540159766

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 180

EP - 224

BT - Rewriting Techniques and Applications

A2 - Jouannaud, Jean-Pierre

PB - Springer Verlag

T2 - 1st International Conference on Rewriting Techniques and Applications, RTA 1985

Y2 - 20 May 1985 through 22 May 1985

ER -

Termination

Abstract

Publication series

Conference

Funding

Access to Document

Other files and links

Fingerprint

Cite this