Compiler optimization correctness by temporal logic

Higher-Order and Symbolic Computation

Volumn 17, Issue 3, 2004, Pages 173-206

  Lacey, David ^a   Jones, Neil D ^b   Van Wyk, Eric ^c   Frederiksen, Carl Christian ^d  

^a UNIVERSITY OF WARWICK   (United Kingdom)

^b UNIVERSITY OF COPENHAGEN   (Denmark)

^c UNIVERSITY OF MINNESOTA   (United States)

^d UNIVERSITY OF TOKYO   (Japan)

Author keywords

Compiler verification; Model checking; Optimizing compilers; Temporal logic

Indexed keywords

COMPILERS VERIFICATION; MODEL CHECKING; OPTIMIZING COMPILERS; TEMPORAL LOGIC;

COMPUTER PROGRAMMING LANGUAGES; DATA HANDLING; LOGIC PROGRAMMING; MATHEMATICAL MODELS; SEMANTICS; SET THEORY; THEOREM PROVING;

PROGRAM COMPILERS;

EID: 3042803134     PISSN: 13883690     EISSN: None     Source Type: Journal    
DOI: 10.1023/B:LISP.0000029444.99264.c0     Document Type: Article

References (47)

1. Abramsky, S. and Hankin, C. Abstract Interpretation of Declarative Languages. Ellis-Horwood, 1987.
2. Aho, A.V., Sethi, R., and Ullman, J.D. Compilers: Principles, Techniques, and Tools. Addison Wesley, 1986.
3. Assmann, U. How to uniformly specify program analysis and transformation. In Proc. 6th International Conference on Compiler Construction (CC'96), vol. 1060 of Lecture Notes in Computer Science, Springer-Verlag, 1996, pp. 121-135.
4. Clarke, E.M., Emerson, E.A., and Sistla, A.P. Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM Transactions on Programming Languages and Systems (TOPLAS), 8(2) (1986) 244-263.
5. Cleaveland, R. and Jackson, D. In Proceedings of First ACM SIGPLAN Workshop on Automated Analysis of Software. Paris, France, Jan. 1997.
6. Cousot, P. Semantic foundations of program analysis. In Program Flow Analysis: Theory and Applications, S.S. Muchnick and N.D. Jones (Eds.), Englewood Cliffs, NJ, Prentice Hall, 1981, chap. 10, pp. 303-342.
7. Cousot, P. and Cousot, R. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fix-points. In Fourth ACM Symposium on Principles of Programming Languages, Los Angeles, California, January 1977, New York, ACM, 1977, pp. 238-252.
8. Cousot, P. and Cousot, R. Systematic design of program transformations by abstract interpretation. In Proc. of 29th ACM Symposium on Principles of Programming Languages, ACM, 2000, pp. 178-190.
9. Cousot, P. and Cousot, R. Systematic design of program transformation frameworks by abstract interpretation. In Proc. of the 29th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Portland, Oregon, ACM Press, 2002, pp. 178-190.
10. Frederiksen, C.C. Correctness of classical compiler optimizations using CTL. Unpublished TOPPS report, University of Copenhagen, 2001. www.diku.dk/research-groups/topps/bibliography/2001.htm#D-443.
11. Frederiksen, C.C. Correctness of classical compiler optimizations using CTL logic. In Compiler Optimization meets Compiler Verification (COCV), Satellite workshop at ETAPS 2002.
12. Hafer, Th. and Thomas, W. Computation tree logic CTL* and path quantifiers in the monadic theory of the binary tree. In Automata, Languages and Programming Proceedings, ICALP'87, vol. 267 of Lecture Notes in Computer Science, Springer-Verlag, 1987, pp. 267-279.
13. Havelund, K. Stepwise Development of a Denotational Stack Semantics. M.Sc. thesis, University of Copenhagen, 1984.
14. Hecht, M. Flow Analysis of Computer Programs. North-Holland, 1977.
15. Jones, N.D. (Ed.), Semantics-Directed Compiler Generation; vol. 94 of Lecture Notes in Computer Science, Springer-Verlag, 1980.
16. Jones, N.D. Semantique: Semantic-based program manipulation techniques. In Bulletin European Association for Theoretical Computer Science, 39 (1989) 74-83.
17. Jones, N.D. and Nielson, F. Abstract interpretation: A semantics-based tool for program analysis. In Handbook of Logic in Computer Science, S. Abramsky, D. Gabbay, and T. Maibaum (Eds.), Oxford University Press, 1994, pp. 527-629.
18. Knoop, J., Rüthing, O., and Steffen, B. Optimal code motion: Theory and practice. ACM Transactions on Programming Languages and Systems (TOPLAS), 16(4) (1994) 1117-1155.
19. Kozen, D. and Patron, M. Certification of compiler optimizations using Kleene algebra with tests. In Proceedings of the 1st International Conference on Computational Logic (CL2000), J. Lloyd, V. Dahl, U. Furbach, M. Kerber, K.-K. Lau, C. Palamidessi, L.M. Pereira, Y. Sagiv, and P.J. Stuckey (Eds.), Lecture Notes in Artificial Intelligence, vol. 1861, Springer-Verlag, London, 2000, pp. 568-582.
20. Kripke, S. Semantical analysis of modal logic i: Normal modal propositional calculi. Zeitschrift f. Math. Logik und Grundlagen d. Math., 9 (1963).
21. Kupferman, O. and Pnueli, A. Once and for all. In Proc. 10th IEEE Symposium on Logic in Computer Science, San Diego, 1995, pp. 25-35.
22. Lacey, D. Program transformation using temporal logic specification. DPhil Thesis (forthcoming). Oxford University Computing Laboratory, 2003.
23. Lacey, D. and de Moor, O. Imperative program transformation by rewriting. In Proc. 10th International Conf. on Compiler Construction, vol. 1113 of Lecture Notes in Computer Science, Springer-Verlag, 2001, pp. 52-68.
24. Lacey, D., Jones, N.D., Van Wyk, E. and Frederiksen, C.C. Proving correctness of compiler optimizations by temporal logic. In 29th ACM SIOPLAN-SIGACT Symposium on Principles of Programming Languages, 2002, pp. 283-294.
25. Lerner, S., Grove, D., and Chambers, C. Composing dataflow analyses and transformations. In 29th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2002, pp. 283-294.
26. Lerner, S., Millstein, T., and Chambers, C. Automatically proving correctness of compiler optimizations. Technical Report UW-CSE-02-11-02, University of Washington, 2002.
27. Milne, R. and Strachey, C. A Theory of Programming Language Semantics. Chapman and Hall, 1976.
28. Muchnick, S.S. Advanced Compiler Design and Implementation. Morgan Kaufmann, 1997.
29. Muchnick, S.S. and Jones, N.D. (Eds.), Program Flow Analysis: Theory and Applications. Englewood Cliffs, NJ, Prentice Hall, 1981.
30. Nielson, F. Semantic Foundations of Data Flow Analysis. M.Sc. thesis, Aarhus University, DAIMI PB-131, 1981
31. Nielson, F. A denotational framework for data flow analysis. Acta Informatica, 18 (1982) 265-287.
32. Nielson, F., Nielson, H.R., and Hankin, C. Principles of Program Analysis. Springer-Verlag, 1999.
33. Pinter, S.S. and Wolper, P. A temporal logic for reasoning about partially ordered computations. In Proc. 3rd ACM Symposium on Principles of Distributed Computing, 1984, pp. 28-37.
34. Podelski, A., Steffen, B., and Vardi, M. Schloss Ringberg Seminar: Model Checking and Program Analysis. Workshop, Feb. 2000, Bavaria.
35. Rus, T. and Van Wyk, E. Using model checking in a parallelizing compiler. Parallel Processing Letters, 8(4) (1998) 459-471.
36. Schmidt, D.A. Data-flow analysis is model checking of abstract interpretations. In Proc. of 25th ACM Symposium on Principles of Programming Languages, ACM, 1998.
37. Schmidt, D.A. and Steffen, B. Program analysis as model checking of abstract interpretations. In Proc. of 5th Static Analysis Symposium, G. Levi (Ed.), Pisa, vol. 1503 of Lecture Notes in Computer Science, Springer-Verlag, 1998.
38. SRI International. The PVS specification and verification system http://pvs.csl.sri.com/
39. Steckler, P.A. and Wand, M. Lightweight closure conversion. ACM Transactions on Programming Languages and Systems, ACM, 19(1) (1997) 48-86.
40. Steffen, B. Data flow analysis as model checking. In Proc. of 1st International Conference on Theoretical Aspects of Computer Software (TACS'91), Heidelberg, vol. 526 of Lecture Notes in Computer Science, Springer-Verlag, 1991, pp. 346-364.
41. Steffen, B. Generating data flow analysis algorithms from modal specifications. In Science of Computer Programming, 1993, vol. 21, pp. 115-139.
42. Steffen, B., Claßen, A., Klein, M., Knoop, J., and Margaria, T. The fixpoint analysis machine. In Proc. of the 6th International Conference on Concurrency Theory (CONCUR'95), I Lee and S. Smolka (Eds.), Philadelphia, Pennsylvania (USA), vol. 962 of Lecture Notes in Computer Science, Springer-Verlag, 1995, pp. 72-87.
43. Visser, E., Benaissa, Z., and Tolmach, A. Building program optimizers with rewriting strategies. In Proc. of ACM SIGPLAN International Conference on Functional Programming (ICFP'98), ACM, 1998, pp. 13-26.
44. Whitfield, D. and Soffa, M.L. Automatic generation of global optimisers. In Proc. of ACM SIGPLAN on Program Language Design and Implementation (PLDI'91), ACM, 1991, pp. 120-129.
45. Whitfield, D. and Soffa, M.L. An approach for exploring code-improving transformations. In ACM Transactions on Programming Languages and Systems, ACM, 1997, vol. 19, no. 6, pp. 1053-1084.
46. Winskel, G. The Formal Semantics of Programming Languages. Boston, MA, the MIT Press, 1993.
47. Wolper, P. On the relation of programs and computations to models of temporal logic. In Proc. Temporal Logic in Specification, vol. 398 of Lecture Notes in Computer Science, Springer-Verlag, 1987, pp. 75-123.