@inbook{6a3e08fc57b84c41acce86eb8293beb5,
title = "Termination by abstraction",
abstract = "Abstraction can be used very effectively to decompose and simplify termination arguments. If a symbolic computation is nonterminating, then there is an infinite computation with a top redex, such that all redexes are immortal, but all children of redexes are mortal. This suggests applying weakly-monotonic well-founded relations in abstraction-based termination methods, expressed here within an abstract framework for term-based proofs. Lexicographic combinations of orderings may be used to match up with multiple levels of abstraction.",
author = "Nachum Dershowitz",
year = "2004",
doi = "10.1007/978-3-540-27775-0_1",
language = "אנגלית",
isbn = "3540226710",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "1--18",
editor = "Bart Demoen and Vladimir Lifschitz",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
address = "גרמניה",
}