Homeomorphic embedding for online termination of symbolic methods (2002)
| Venue: | In The essence of computation, volume 2566 of LNCS |
| Citations: | 25 - 5 self |
BibTeX
@INPROCEEDINGS{Leuschel02homeomorphicembedding,
author = {Michael Leuschel},
title = {Homeomorphic embedding for online termination of symbolic methods},
booktitle = {In The essence of computation, volume 2566 of LNCS},
year = {2002},
pages = {379--403},
publisher = {Springer}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. Well-quasi orders in general, and homeomorphic embedding in particular, have gained popularity to ensure the termination of techniques for program analysis, specialisation, transformation, and verification. In this paper we survey and discuss this use of homeomorphic embedding and clarify the advantages of such an approach over one using well-founded orders. We also discuss various extensions of the homeomorphic embedding relation. We conclude with a study of homeomorphic embedding in the context of metaprogramming, presenting some new (positive and negative) results and open problems.
