Simple relational correctness proofs for static analyses and program transformations

Conference Record of the Annual ACM Symposium on Principles of Programming Languages

Volumn 31, Issue , 2004, Pages 14-25

  Benton, Nick ^a  

^a MICROSOFT RESEARCH   (United Kingdom)

Author keywords

Denotational semantics; Dependency; Hoare logic; Information flow; Optimizing compilation; Partial equivalence relations; Program analysis; Security; Types

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; INFORMATION ANALYSIS; MATHEMATICAL TRANSFORMATIONS; OPTIMIZATION; PROGRAM COMPILERS; SEMANTICS;

DEAD CODE ELIMINATION; HOARE LOGIC; INFORMATION FLOW; PROGRAM TRANSFORMATIONS;

COMPUTER PROGRAMMING LANGUAGES;

EID: 2442575906     PISSN: 07308566     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/964001.964003     Document Type: Conference Paper

References (38)

1. M. Abadi, A. Banerjee, N. Heintze, and J. G. Riecke. A core calculus of dependency. In Conference Record of the 26th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL), pages 147-160. ACM Press, January 1999.
2. M. Abadi, L. Cardelli, and P.-L. Curien. Formal parametric polymorphism. Theoretical Computer Science, 121, 1993.
3. M. Abadi and G. D. Plotkin. A PER model of polymorphism and recursive types. In Proceedings of the 5th Annual IEEE Symposium on Logic in Computer Science (LICS), pages 355-365. IEEE Computer Society Press, June 1990.
4. A. V. Aho, R. Sethi, and J. D. Ullman. Compilers: Principles, Techniques and Tools. Addison Wesley, 1986.
5. T. Amtoft. Minimal thunkification. In P. Cousot, M. Falaschi, G. Filè, and A. Rauzy, editors, Proceedings of the 3rd International Workshop on Static Analysis, Padova, Italy, volume 724 of Lecture Notes in Computer Science, pages 218-229. Springer-Verlag, September 1993.
6. D. Aspinall. Subtyping with singleton types. In L. Pacholski and J. Tiuryn, editors, Computer Science Logic, 8th International Workshop (CSL'94), number 933 in Lecture Notes in Computer Science. Springer-Verlag, 1995.
7. A. Banerjee and D. Naumann. Secure information flow and pointer confinement in a Java-like language. In Proceedings of the 15th IEEE Computer Security Foundations Workshop (CSFW), pages 253-267. IEEE Computer Society Press, June 2002.
8. N. Benton and A. Kennedy. Monads, effects and transformations. In Third International Workshop on Higher Order Operational Techniques in Semantics (HOOTS), Paris, volume 26 of Electronic Notes in Theoretical Computer Science. Elsevier, September 1999.
9. P. N. Benton. Strictness Analysis of Lazy Functional Programs. PhD thesis, Computer Laboratory, University of Cambridge, December 1992.
10. P. Damiani. Useless-code Detection and Elimination for PCF with Algebraic Datatypes. In 4th International Conference on Typed Lambda Calculi and Applications (TLCA), volume 1581 of Lecture Notes in Computer Science, pages 83-97. Springer-Verlag, 1999.
11. F. Damiani and P. Giannini. Automatic useless-code detection and elimination for hot functional programs. Journal of Functional Programming, pages 509-559, 2000.
12. M S. Hecht. Flow Analysis of Computer Programs. Elsevier North-Holland, 1977.
13. C. A. R. Hoare. An axiomatic basis for computer programming. Communications of the ACM, 12(10):576-585, October 1969.
14. J. Hughes. Type specialization for the lambda calculus. In Proceedings of the Dagstuhl Seminar on Partial Evaluation, 1996.
15. S. Hunt and D. Sands. Binding time analysis: A new PERspective. In Proceedings ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation (PEPM), June 1991.
16. G. A. Kildall. A unified approach to global program optimization. In Proceedings of the 1st ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages (POPL), pages 194-206. ACM Press, 1973.
17. N. Kobayashi. Type-based useless variable elimination. In Proceeedings of the ACM Symposium on Partial Evaluation and Semantics-Based Program Manipulation, 2000.
18. D. Kozen and M. Patron. Certification of compiler optimizations using Kleene algebra with tests. In Proceedings of the 1st International Conference in Computational Logic, volume 1861 of Lecture Notes in Artificial Intelligence. Springer-Verlag, 2000.
19. 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.
20. S. Lerner, T. Millstein, and C. Chambers. Automatically proving the correctness of compiler optimizations. In Proceedings of the ACM SIGPLAN 2003 Conference on Programming Language Design and Implementation (PLDI), June 2003.
21. G. C. Necula. Translation validation for an optimizing compiler. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), pages 83-95, 2000.
22. F. Nielson. Program transformations in a denotational setting. ACM Transactions on Programming Languages and Systems (TOPLAS), 7(3):359-379, July 1985.
23. A.M. Pitts. Relational properties of domains. Information and Computation, 127, 1996.
24. M. Rinard. Credible compilation. Technical Report MIT-LCS-TR-776, Massachusets Institute of Technology, March 1999.
25. M. Rinard and D. Marinov. Credible compilation with pointers. In Proceedings of the FLoC Workshop on Run-Time Result Verification, July 1999.
26. A. Sabelfeld and D. Sands. A PER model of secure information flow in sequential programs. Higher-Order and Symbolic Computation, 14(1):59-91, March 2001.
27. G. Smith and D. Volpano. Secure information flow in a multithreaded imperative language. In Conference Record of the 25th ACM Symposium on Principles of Porgramming Languages (POPL), January 1998.
28. P. A. Steckler and M. Wand. Lightweight closure conversion. ACM Transactions on Programming Languages and Systems (TOPLAS), pages 48-86, January 1997. Original version appeared in Proceedings 21st ACM Symposium on Principles of Programming Languages, 1994.
29. P. A. Steckler and M. Wand. Lightweight closure conversion. ACM Transactions on Programming Languages and Systems (TOPLAS), pages 48-86, January 1997. Original version appeared in Proceedings 21st ACM Symposium on Principles of Programming Languages, 1994.
30. D. Volpano, G. Smith, and C. Irvine. A sound type system for secure flow analysis. Journal of Computer Security, 4:167-187, December 1996.
31. M. Wand. Specifying the correctness of binding-time analysis. In Conference Record of the 20th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL), pages 137-143. ACM, January 1993.
32. M. Wand and W. D. Clinger. Set constraints for destructive array update optimization. Journal of Functional Programming, 11 (3):319-346, May 2001. Preliminary version appeared in International Conference on Computer Languages, 1998.
33. M. Wand and W. D. Clinger. Set constraints for destructive array update optimization. Journal of Functional Programming, 11 (3):319-346, May 2001. Preliminary version appeared in International Conference on Computer Languages, 1998.
34. M. Wand and I. Siveroni. Constraint systems for useless variable elimination. In Proceedings 26th ACM Symposium on Principles of Programming Languages, pages 291-302, 1999.
35. M. Weiser. Program slicing. IEEE Transactions on Software Engineering, 10(4):352-357, July 1984.
36. G. Winskel. The Formal Semantics of Programming Languages. MIT Press, 1993.
37. H. Yang. Verification of the Schorr-Waite graph marking algorithm by refinement. Slides from talk at Dagstuhl Seminar 03101, March 2003.
38. L. Zuck, A. Pnueli, Y. Fang, and B. Goldberg. VOC: A methodology for the translation validation for optimizing compilers. Journal of Universal Computer Science, 9(3):223-247, 2003.