Homeomorphic Embedding for Online Termination of Symbolic Methods
Homeomorphic Embedding for Online Termination of Symbolic Methods
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.
Termination, Well-quasi orders, Program Analysis, Specialisation and Transformation, Logic Programming, Functional and Logic Programming, Metaprogramming, Infinite Model Checking
3-540-00326-6
379-403
Leuschel, Michael
c2c18572-66cf-4f84-ade4-218ce3afe78b
2002
Leuschel, Michael
c2c18572-66cf-4f84-ade4-218ce3afe78b
Leuschel, Michael
(2002)
Homeomorphic Embedding for Online Termination of Symbolic Methods.
In,
Mogensen, Torben, Schmidt, David and Sudborough, I. H.
(eds.)
The Essence of Computation - Essays dedicated to Neil Jones.
Springer, .
Record type:
Book Section
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.
Text
state-of-the-art.final.pdf
- Other
More information
Published date: 2002
Keywords:
Termination, Well-quasi orders, Program Analysis, Specialisation and Transformation, Logic Programming, Functional and Logic Programming, Metaprogramming, Infinite Model Checking
Organisations:
Electronics & Computer Science
Identifiers
Local EPrints ID: 257252
URI: http://eprints.soton.ac.uk/id/eprint/257252
ISBN: 3-540-00326-6
PURE UUID: c3ae9a79-93b6-4584-bff2-398cb425ac68
Catalogue record
Date deposited: 05 Mar 2003
Last modified: 14 Mar 2024 05:55
Export record
Contributors
Author:
Michael Leuschel
Editor:
Torben Mogensen
Editor:
David Schmidt
Editor:
I. H. Sudborough
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics