Abstract
<p>The main purpose of the thesis is to develop a model enabling one to reason about various techniques for program optimization, in particular wrt.\ speedup and correctness. Moreover, several methods to increase the amount of sharing are discussed, and a new one (to be termed ''ultimate sharing'') is treated in detail.</p><p> </p><p>Concerning speedup, a main point is to factor out the reasons why a program transformation may yield more than a constant speedup.</p><p> </p><p>Concerning correctness, the interesting part is preservation of termination properties. This issue is mainly addressed for a logic language, where previous results from the literature are generalized -- but also for a functional language some (more limited) results are presented.</p>
Publisher
Det Kgl. Bibliotek/Royal Danish Library
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The Next 700 Program Transformers;Logic-Based Program Synthesis and Transformation;2022
2. Complete Laziness: a Natural Semantics;Electronic Notes in Theoretical Computer Science;2008-04
3. On obtaining the Boyer–Moore string-matching algorithm by partial evaluation;Information Processing Letters;2006-08
4. Fast partial evaluation of pattern matching in strings;ACM Transactions on Programming Languages and Systems;2006-07
5. The Abstraction and Instantiation of String-Matching Programs;Lecture Notes in Computer Science;2002