Formalizing and verifying semantic type soundness of a simple compiler

PPDP'07: Proceedings of the 9th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming

Volumn , Issue , 2007, Pages 1-12

  Benton, Nick ^a   Zarfaty, Uri ^b  

^a MICROSOFT RESEARCH   (United Kingdom)

^b IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

Compiler verification; Proof assistants; Relational para metricity; Separation logic; Type soundness

Indexed keywords

BINARY SEQUENCES; CODES (SYMBOLS); HIGH LEVEL LANGUAGES; SEMANTICS; VERIFICATION;

COMPILER VERIFICATION; PROOF ASSISTANTS; RELATIONAL PARA-METRICITY; SEPARATION LOGIC; TYPE SOUNDNESS;

PROGRAM COMPILERS;

EID: 34548084066     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1273920.1273922     Document Type: Conference Paper

References (33)

1. M. Abadi, L. Cardelli, and P.-L. Curien. Formal parametric polymorphism. Theoretical Computer Science, 121, 1993.
2. M. Abadi and G. D. Plotkin. A PER model of polymorphism and recursive types. In Proc. 5th IEEE Symposium on Logic in Computer Science (LICS), 1990.
3. A. Ahmed. Semantics of Types for Mutable State. PhD thesis, Princeton University, 2004.
4. R. M. Amadio. Recursion over realizability structures. Information and Computation, 91(1), 1991.
5. A. Appel. Foundational proof-carrying code. In Proc. 16th IEEE Symposium on Logic in Computer Science (LICS), 2001.
6. A. Appel and A. Felty. A semantic model of types and machine instructions for proof-carrying code. In Proc. 27th ACM Symposium on Principles of Programming Languages (POPL), 2000.
7. A. Appel and D. McAllester. An indexed model of recursive types for foundational proof-carrying code. ACM Transactions on Programming Languages and Systems (TOPLAS), 23(5), 2001.
8. N. Benton. Simple relational correctness proofs for static analyses and program, transformations. In Proc. 31st ACM Symposium on Principles of Programming Languages (POPL), 2004. Revised version, available from http://research.microsoft.com/~nick/publications.htm.
9. N. Benton. A typed, compositional logic for a stack-based abstract machine. In Proc. 3rd Asian Symposium on Programming Languages and Systems (APLAS), volume 3780 of Lecture Notes in Computer Science, 2005.
10. N. Benton. Abstracting allocation: The new new thing. In Proc. Computer Science Logic (CSL), volume 4207 of Lecture Notes in Computer Science, 2006.
11. N. Benton, A. Kennedy, M. Hofmann, and L. Beringer. Reading, writing and relations: Towards extensional semantics for effect analyses. In Proc. 4th Asian Symposium on Programming Languages and Systems (APLAS), number 4279 in Lecture Notes in Computer Science, 2006.
12. N. Benton and B. Leperchey. Relational reasoning in a nominal semantics for storage. In Proc. 7th International Conference on Typed Lambda Calculi and Applications (TLCA), volume 3461 of Lecture Notes in Computer Science, 2005.
13. N. Benton and U. Zarfaty. Formalizing and verifying semantic type soundness for a simple compiler (preliminary report). Technical Report MSR-TR-2007-31, Microsoft Research, March 2007.
14. B. Biering, L. Birkedal, and N. Torp-Smith. BI-hyperdoctines and higher-order separation logic. In Proc. 14th European Symposium on Programming (ESOP), volume 3444 of Lecture Notes in Computer Science, 2005.
15. L. Birkedal, N. Torp-Smith, and H. Yang. Semantics of separation logic typing and higher-order frame rules. In Proc. 20th IEEE Symposium on Logic in Computer Science (LICS), 2005.
16. L. Birkedal and H. Yang. Relational parametricity and separation logic. In. Proc. 10th Conference on Foundations of Software Science and Computation Structures (FOSSACS), volume 4423 of Lecture Notes in Computer Science, 2007.
17. L. Cardelli and G. Longo. A semantic basis for Quest. In Proc. ACM Conference on LISP and Functional Programming (LFP), 1990.
18. F. Cardone. Relational semantics for recursive types and bounded quantification. In Proc. International Colloquium on Automata, Languages and Programming (ICALP), volume 372 of Lecture Notes in Computer Science, 1989.
19. X. Leroy. Formal certification of a compiler back-end, or: programming a compiler with a proof assistant. In Proc. 33rd Symposium on Principles of Programming Languages (POPL), 2006.
20. J. McCarthy and J. Painter. Correctness of a compiler for arithmetic expressions. In Mathematical Aspect of Computer Science, volume 19 of Proceedings of Symposia in Applied Mathematics. AMS, 1967.
21. G. Morrisett, D. Walker, K. Crary, and N. Glew. From. System F to typed assembly language. ACM Transactions on Programming Languages and Systems (TOPLAS), 21(3), 1999.
22. A. Nanevski, A. Ahmed, G. Morrisett, and L. Birkedal. Abstract predicates and mutable ADTs in Hoare type theory. In Proc. 16th European Symposium on Programming (ESOP), volume 4421 of Lecture Notes in Computer Science, 2007.
23. G. Necula. Roof-carrying code. In Proc. 24th ACM Symposium on Principles of Programming Languages (POPL), 1997.
24. P. W. O'Hearn, J. C. Reynolds, and H. Yang. Local reasoning about programs that alter data structures. In Proc. 10th Annual Conference of the European Association for Computer Science Logic (CSL), volume 2142 of Lecture Notes in Computer Science, 2001.
25. A. M. Pitts and I. D. B. Stark. Operational reasoning for functions with local state. In Higher Order Operational Techniques in Semantics. CUP, 1998.
26. G. D. Plotkin. Lambda definability and logical relations. Technical report, Department of AI, University of Edinburgh, 1973.
27. U. S. Reddy and H. Yang. Correctness of data representations involving heap data structures. Science of Computer Programming, 50(1-3), 2004.
28. J. C. Reynolds. Types, abstraction and parametric polymorphism. Information Processing '83, 1983.
29. J. C. Reynolds. Separation logic: A logic for shared mutable data structures. In Proc. 17th IEEE Symposium on Logic in Computer Science (LICS), 2002.
30. G. Tan, A. Appel, K. Swadi, and D. Wu. Construction of a semantic model for a typed assembly language. In Proc. 5th Conference on Verification, Model Checking, and Abstract Interpretation (VMCAI), 2004.
31. A. K. Wright and M. Felleisen. A syntactic approach to type soundness. Information and Computation, 115(1):38-94, 15 November 1994.
32. H. Yang. Relational separation logic. Theoretical Computer Science, 2004. Submitted.
33. W. D. Young. A mechanically verified code generator. J. Autom. Reason., 5(4), 1989.