Advertisement

Certification of Compiler Optimizations Using Kleene Algebra with Tests

  • Dexter Kozen
  • Maria-Cristina Patron
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1861)

Abstract

We use Kleene algebra with tests to verify a wide assortment of common compiler optimizations, including dead code elimination, common subexpression elimination, copy propagation, loop hoisting, induction variable elimination, instruction scheduling, algebraic simplification, loop unrolling, elimination of redundant instructions, array bounds check elimination, and introduction of sentinels. In each of these cases, we give a formal equational proof of the correctness of the optimizing transformation.

Keywords

Code Transformation Compiler Optimization Propositional Dynamic Logic Program Fragment Loop Unroll 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Ernie Cohen. Hypotheses in Kleene algebra. Available as ftp://ftp.bellcore.com/pub/ernie/research/homepage.html, April 1994.
  2. 2.
    Ernie Cohen. Lazy caching. Available as ftp://ftp.bellcore.com/pub/ernie/research/homepage.html, 1994.
  3. 3.
    Ernie Cohen. Using Kleene algebra to reason about concurrency control. Available as ftp://ftp.bellcore.com/pub/ernie/research/homepage.html, 1994.
  4. 4.
    John Horton Conway. Regular Algebra and Finite Machines. Chapman and Hall, London, 1971.zbMATHGoogle Scholar
  5. 5.
    Michael J. Fischer and Richard E. Ladner. Propositional dynamic logic of regular programs. J. Comput. Syst. Sci., 18(2):194–211, 1979.zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Stephen C. Kleene. Representation of events in nerve nets and finite automata. In C. E. Shannon and J. McCarthy, editors, Automata Studies, pages 3–41. Princeton University Press, Princeton, N.J., 1956.Google Scholar
  7. 7.
    Dexter Kozen. A completeness theorem for Kleene algebras and the algebra of regular events. Infor. and Comput., 110(2):366–390, May 1994.Google Scholar
  8. 8.
    Dexter Kozen. Kleene algebra with tests. Transactions on Programming Languages and Systems, 19(3):427–443, May 1997.Google Scholar
  9. 9.
    Dexter Kozen. Efficient code certification. Technical Report 98-1661, Computer Science Department, Cornell University, January 1998.Google Scholar
  10. 10.
    Dexter Kozen. On Hoare logic and Kleene algebra with tests. Trans. Computational Logic, 1(1), July 2000. To appear.Google Scholar
  11. 11.
    Dexter Kozen and Frederick Smith. Kleene algebra with tests: Completeness and decidability. In D. van Dalen and M. Bezem, editors, Proc. 10th Int. Workshop Computer Science Logic (CSL’6), volume 1258 of Lecture Notes in Computer Science, pages 244–259, Utrecht, The Netherlands, September 1996. Springer-Verlag.Google Scholar
  12. 12.
    Greg Morrisett, David Walker, Karl Crary, and Neal Glew. From System F to typed assembly language. In 25th ACM SIGPLAN/SIGSIGACT Symposium on Principles of Programming Languages, pages 85–97, San Diego California, USA, January 1998.Google Scholar
  13. 13.
    George C. Necula. Proof-carrying code. In Proc. 24th Symp. Principles of Programming Languages, pages 106–119. ACM SIGPLAN/SIGACT, January 1997.Google Scholar
  14. 14.
    George C. Necula and Peter Lee. The design and implementation of a certifying compiler. In Proc. Conf. Programming Language Design and Implementation, pages 333–344. ACM SIGPLAN, 1998.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Dexter Kozen
    • 1
  • Maria-Cristina Patron
    • 2
  1. 1.Computer Science DepartmentCornell UniversityIthacaUSA
  2. 2.Center for Applied MathematicsCornell UniversityIthacaUSA

Personalised recommendations