A Comparison of Well-Quasi Orders on Trees
Well-quasi orders such as homeomorphic embedding are commonly used to ensure termination of program analysis and program transformation, in particular supercompilation. We compare eight well-quasi orders on how discriminative they are and their computational complexity. The studied well-quasi orders...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Open Publishing Association
2013-09-01
|
| Series: | Electronic Proceedings in Theoretical Computer Science |
| Online Access: | http://arxiv.org/pdf/1309.5130v1 |
| id |
doaj-9a7a8fb296ef479f952701d1af37ad34 |
|---|---|
| record_format |
Article |
| spelling |
doaj-9a7a8fb296ef479f952701d1af37ad342020-11-24T22:27:56ZengOpen Publishing AssociationElectronic Proceedings in Theoretical Computer Science2075-21802013-09-01129Festschrift for Dave Schmidt304010.4204/EPTCS.129.3A Comparison of Well-Quasi Orders on TreesTorben Æ. MogensenWell-quasi orders such as homeomorphic embedding are commonly used to ensure termination of program analysis and program transformation, in particular supercompilation. We compare eight well-quasi orders on how discriminative they are and their computational complexity. The studied well-quasi orders comprise two very simple examples, two examples from literature on supercompilation and four new proposed by the author. We also discuss combining several well-quasi orders to get well-quasi orders of higher discriminative power. This adds 19 more well-quasi orders to the list.http://arxiv.org/pdf/1309.5130v1 |
| collection |
DOAJ |
| language |
English |
| format |
Article |
| sources |
DOAJ |
| author |
Torben Æ. Mogensen |
| spellingShingle |
Torben Æ. Mogensen A Comparison of Well-Quasi Orders on Trees Electronic Proceedings in Theoretical Computer Science |
| author_facet |
Torben Æ. Mogensen |
| author_sort |
Torben Æ. Mogensen |
| title |
A Comparison of Well-Quasi Orders on Trees |
| title_short |
A Comparison of Well-Quasi Orders on Trees |
| title_full |
A Comparison of Well-Quasi Orders on Trees |
| title_fullStr |
A Comparison of Well-Quasi Orders on Trees |
| title_full_unstemmed |
A Comparison of Well-Quasi Orders on Trees |
| title_sort |
comparison of well-quasi orders on trees |
| publisher |
Open Publishing Association |
| series |
Electronic Proceedings in Theoretical Computer Science |
| issn |
2075-2180 |
| publishDate |
2013-09-01 |
| description |
Well-quasi orders such as homeomorphic embedding are commonly used to ensure termination of program analysis and program transformation, in particular supercompilation. We compare eight well-quasi orders on how discriminative they are and their computational complexity. The studied well-quasi orders comprise two very simple examples, two examples from literature on supercompilation and four new proposed by the author. We also discuss combining several well-quasi orders to get well-quasi orders of higher discriminative power. This adds 19 more well-quasi orders to the list. |
| url |
http://arxiv.org/pdf/1309.5130v1 |
| work_keys_str_mv |
AT torbenæmogensen acomparisonofwellquasiordersontrees AT torbenæmogensen comparisonofwellquasiordersontrees |
| _version_ |
1725748393934848000 |