D. Lacey, N. D. Jones, E. V. Wyk, and C. C. Frederiksen. Proving correctness of compiler optimizations by temporal logic. In Proc. 29th ACM Symposium on Principles of Programming Languages, pages 283--294. Association of Computing Machinery, 2002.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....and (ii) the application of properties to transformation of the corresponding concrete Kripke structure. Topic (i) can be best understood as validating temporal logic properties by model checking [34 37] Topic (ii) is surprisingly underdeveloped, although Lacey, Jones, Van Wyk, and Frederiksen [18] and Cousot and Cousot [11] give recent proposals. Acknowledgements: I thank Neil Jones for many years of inspiring work. The current paper evolved from research presented at the Workshop on Re nement and Abstraction, Amagasaaki, Japan, in 1999. I thank Yoshiki Kinoshita and the other workshop ....

D. Lacey, N.D. Jones, E. Van Wyk, and C. Frederiksen. Proving correctness of compiler optimizations by temporal logic. In Proc. 29th ACM Symp. on Principles of Prog. Languages. ACM Press, 2002.

....real programs. 5 Related Work Many researches have been devoted to the declarative approaches to program analyses. Steffen and Schmidt [31, 30] showed that temporal logic is well suited to describe data dependencies and other properties exploited in classical compiler optimization. Lacey, et.al. [21] formalized program optimization as rewriting systems with temporal logic side conditions (described in CTL FV) and shows that CTL FV plays a crucial role in the proofs of correctness of classical optimizations. Instead of temporal logic, de Moor, et.al. 12] proposed another functional approach ....

David Lacey, Neil D. Jones, Eric Van Wyk, and Carl Christian Frederiksen. Proving correctness of compiler optimizations by temporal logic. In Proc. 29th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 283--294. ACM Press, 2002.

....have a substantial impact on the time to run an optimization. The best solution would be to prove the compiler sound, meaning that for any input program, the compiler always produces an equivalent output program. Optimizations, and sometimes even complete compilers, have been proven sound by hand [1, 2, 15, 13, 8, 23, 3, 11]. However, manually proving large parts of a compiler sound requires a lot of e#ort and theoretical skill on the part of the compiler writer. In addition, these proofs are usually done for optimizations as written on paper, and bugs may still arise when the algorithms are implemented from the ....

....approach would be to use this counterexample context to synthesize a small intermediate language program that illustrates a potential unsoundness of the given optimization. 8 Related Work Temporal logic has previously been used to express dataflow analyses and reason about them by hand [31, 32, 28, 29, 11]. Our language is inspired by recent work in this direction by Lacey et al. 11] Lacey describes a language for writing optimizations as guarded rewrite rules evaluated over a labeled CFG, and our transformation patterns are modeled on this language. Lacey s intermediate language lacks several ....

[Article contains additional citation context not shown here]

David Lacey, Neil D. Jones, Eric Van Wyk, and Carl Christian Frederiksen. Proving correctness of compiler optimizations by temporal logic. In Conference Record of the 29th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Portland OR, January 2002.

....[34, 33] showed that temporal logic is well suited to describe data dependencies and other properties exploited in classical compiler optimization. Lacey and de Moor [25] added temporal logic side conditions to express complex restriction when transforming imperative programs, and it is shown in [26] that temporal logic plays a crucial role in the proofs of correctness of optimizing transformation. For practical application, an attempt has been made in [13] to extend an existing declarative language (Prolog) for code program analysis and program transformation. Our work can be thought of as ....

David Lacey, Neil D. Jones, Eric Van Wyk, and Carl Christian Frederiksen. Proving correctness of compiler optimizations by temporal logic. In Symposium on Principles of Programming Languages (POPL 2002), pages 283--294. ACM Press, 2002.

....in Compiling The research which comes closer to our preoccupation of relating o#cial and actual semantics is in the field of compiling research. For example, work on correct compiling uses the notion of respecting the inputoutput behaviour of a program while changing its execution mode, see, e.g. [13]. But the focus is on optimisations, and the aim of these optimisations is left mainly implicit. By constrast, we want to explicitate this aim (for the wished for semantics) while the optimisation techniques are not the preoccupation of the norm. Also relevant is the automatic parallelization ....

David Lacey, Neil D. Jones, Eric Van Wyk, and Carl Christian Frederiksen. Proving correctness of compiler optimizations by temporal logic. In Symposium on Principles of Programming Languages, pages 283--294, 2002.

....which comes closer to our preocupation is in the eld of compiling research. For example, work on correct compiling uses the notion of respecting the inputoutput behaviour of a program while changing its execution mode; but it focuses on adequacy for proving the correctness of a change, e.g. [23]. Also relevant is the automatic parallelization eld, which provides an algebraic formulation of execution change through the notion of a space time mapping [10] But it is strongly tied to ane dependances, and too technical (it s integer programming) for being adequately used in a reference ....

David Lacey, Neil D. Jones, Eric Van Wyk, and Carl Christian Frederiksen. Proving correctness of compiler optimizations by temporal logic. In Symposium on Principles of Programming Languages, pages 283-294, 2002.

....to be seen how the algorithm presented here compares in practice with our use of a model checker. Two of us (Van Wyk and Lacey) have been working on a method of proving the correctness of program transformations whose side conditions are stated in temporal logic, in collaboration with Neil Jones [42]. It was a draft of their paper that prompted the exploration of a simpli ed formalism for the side conditions. It appears that the proof methods for the temporal formalism carry over without much modi cation to regular expressions. There are multiple ways in which the present algorithm could ....

D. Lacey, N. Jones, E. Van Wyk, and C. C. Frederiksen. Proving correctness of compiler optimizations by temporal logic. In Proc. of ACM 29th Symp. on Principles of Programming Languages, Portland, OR, January 2002. Association of Computing Machinery.

....to ground queries, can be found in [28] Due to space limitations, we shall not address the range of transformations expressible in this framework. However, the reader is directed to [15] which contains many more examples of transformations, in particular in the area of code obfuscation, and [23] shows how the transformations can be proven correct. The forthcoming thesis of David Lacey contains a systematic exploration of most common compiler optimisations using the temporal logic notation. Our style of speci cation is also much inspired by that of Whit eld and So a [41] The above ....

D. Lacey, N. D. Jones, E. Van Wyk, and C. C. Frederiksen. Proving correctness of compiler optimizations by temporal logic. In Proc. 29th ACM Symposium on Principles of Programming Languages, pages 283-294. ACM Press, 2002.

....rule I ) I can be applied to the program without changing the semantics of the program. Once a rewrite rule has been proven correct, it can be directly and automatically utilized in an optimizing compiler. The framework is based on joint work with David Lacey, Neil Jones and Eric Van Wyk [6]. The present paper presents a slightly simpli ed version of the framework, with emphasis on the CTL variants relation to CTL, along with a correctness proof of a transformation eliminating recomputations of available expressions. 1 Introduction Reasoning about the correctness of ....

....reasoning about such data dependencies. In particular by using temporal logics to support proofs of universal correctness of program transformations used in optimizing compilers, the proofs have become more tractable and have 1 Based on joint work with David Lacey, Neil D. Jones and Eric Van Wyk [6]. Email: xeno diku.dk, Fax: 45) 35 32 14 01. c 2002 Published by Elsevier Science B. V. lead to stronger optimization algorithms [4] Other works have investigated temporal logic as a means to express program analyses and to derive analysis algorithms [12,13] However declarative methods ....

[Article contains additional citation context not shown here]

Lacey, D., N.D. Jones, E. Van Wyk and C.C. Frederiksen, Proving Correctness of Compiler Optimizations by Temporal Logic, To appear in POPL2002.

No context found.

D. Lacey, N. D. Jones, E. V. Wyk, and C. C. Frederiksen. Proving correctness of compiler optimizations by temporal logic. In Proc. 29th ACM Symposium on Principles of Programming Languages, pages 283--294. Association of Computing Machinery, 2002.

No context found.

D. Lacey, N. D. Jones, E. Van Wyk, and C. C. Frederiksen. Proving correctness of compiler optimizations by temporal logic. In Proceedings of the 29Th Annual ACM Symposium On Principles of Programming Languages (POPL02), pages 283--294. ACM Press, 2002.

No context found.

David Lacey, Neil D. Jones, Eric Van Wyk, and Carl Christian Frederiksen. Proving correctness of compiler optimizations by temporal logic. In Conference Record of the 29th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Portland OR, January 2002.

No context found.

D. Lacey, N. D. Jones, E. Van Wyk, and C. C. Frederiksen. Proving correctness of compiler optimizations by temporal logic. In Proceedings of the 29th Annual ACM SIGPLAN - SIGACT Symposium on Principles of Programming Languages, Portland, January 2002.

No context found.

D. Lacey, N. D. Jones, E. Van Wyk, and C. C. Frederiksen. Proving correctness of compiler optimizations by temporal logic. In ACM Symposium on Principles of Programming Languages, pages 283--294, 2002.

No context found.

D. Lacey, N. D. Jones, E. Van Wyk, and C. C. Frederiksen. Proving correctness of compiler optimizations by temporal logic. In Proceedings of the 29th Annual ACM SIGPLAN - SIGACT Symposium on Principles of Programming Languages, Portland, January 2002.

No context found.

D. Lacey, N. D. Jones, t. Van Wyk, and C. C. Frederiksen. Proving correctness of compiler optimizations by temporal logic. In Conyerence Record oy POPL 2002.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC