Compiling functional types to relational specifications for low level imperative code

Proceedings of the 2009 ACM SIGPLAN Workshop on Types in Language Design and Implementation, TLDI'09

Volumn , Issue , 2009, Pages 3-14

  Benton, Nick ^a   Tabareau, Nicolas ^b  

^a MICROSOFT RESEARCH   (United Kingdom)

^b UNIVERSITÉ PARIS DESCARTES   (France)

Author keywords

Compiler verification, type soundness, relational parametricity,separation logic, proof assistants

Indexed keywords

ASSEMBLY LANGUAGE; BINARY RELATION; COMPILER VERIFICATION, TYPE SOUNDNESS, RELATIONAL PARAMETRICITY,SEPARATION LOGIC, PROOF ASSISTANTS; FUNCTIONAL LANGUAGES; FUNCTIONAL TYPES; LOW LEVEL; PROOF ASSISTANT; RELATIONAL SPECIFICATION; SEMANTIC TYPES;

LINGUISTICS; SEPARATION;

PROGRAM COMPILERS;

EID: 67650093763     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1481861.1481864     Document Type: Conference Paper

References (25)

1. A. Ahmed. Semantics of types for mutable state. PhD thesis, Princeton University, Princeton, NJ, USA, 2004.
2. A. Ahmed and M. Blume. Typed closure conversion preserves observational equivalence. In Proc. 13th ACM International Conference on Functional Programming (ICFP '08). ACM, 2008.
3. A. Ahmed, D. Dreyer, and A. Rossberg. State-dependent representation independence. In Proc. 36th ACM Symposium on Principles of Programming Languages (POPL '09), 2009.
4. A. Appel. Foundational proof-carrying code. In Proc. 16th IEEE Symposium on Logic in Computer Science (LICS), 2001.
5. 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. (Pubitemid 33609124)
6. A.W. Appel, P.-A. Melliès, C.D. Richards, and J. Vouillon. A very modal model of a modern, major, general type system. Proc. 34th ACM Symposium on Principles of Programming Languages (POPL '07), pages 109-122, 2007
7. N. Benton. Abstracting allocation: The new new thing. In CSL '06, volume 4207 of LNCS. Springer-Verlag, September 2006. (Pubitemid 44617557)
8. 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. (Pubitemid 41312710)
9. N. Benton and U. Zarfaty. Formalizing and verifying semantic type soundness of a simple compiler. In Proc. 9th ACM International Conference on Principles and Practice of Declarative Programming (PPDP '07), pages 1-12, New York, NY, USA, 2007. ACM. ISBN 978-1-59593-769-8. doi: *http://doi.acm. org/10.1145/1273920.1273922. (Pubitemid 47291456)
10. A. Chlipala. A certified type-preserving compiler from lambda calculus to assembly language. In Proc. 2007 ACM Conference on Programming Language Design and Implementation (PLDI '07), 2007. (Pubitemid 47630675)
11. M. Dave. Compiler verification: a bibliography. ACM SIGSOFT Software Engineering Notes, 28(6), 2003.
12. M. Dave. Compiler verification: a bibliography. ACM SIGSOFT Software Engineering Notes, 28(6), 2003. R. Davies and F. Pfenning. Intersection types and computational effects. In Proc. 5th ACM International Conference on Functional Programming (ICFP '00), 2000. (Pubitemid 32024722)
13. N. Glew. Object closure conversion. In 3rd International Workshop on Higher Order Operational Techniques in Semantics, 1999.
14. X. Leroy. Formal certification of a compiler back-end, or: programming a compiler with a proof assistant. In Proc. 33rd ACM Symposium on Principles of Programming Languages (POPL '06), 2006. (Pubitemid 43906957)
15. J. McCarthy and J. Painter. Correctness of a Compiler for Arithmetic Expressions. Proceedings Symposium in Applied Mathematics, 19:33-41, 1967.
16. Y. Minamide, G. Morrisett, and R. Harper. Typed closure conversion. In Proc. 23rd ACM Symposium on Principles of Programming Languages (POPL '96), pages 271-283, New York, NY, USA, 1996. ACM. ISBN 0-89791-769-3. doi: *http://doi.acm.org/10.1145/237721.237791.
17. J. C. Mitchell and G. D. Plotkin. Abstract types have existential type. ACM Trans. Program. Lang. Syst., 10(3), 1988.
18. Z. Ni and Z. Shao. Certified assembly programming with embedded code pointers. In Proc. 33rd ACM Symposium on Principles of Programming Languages (POPL), 2006. (Pubitemid 43906981)
19. Z. Ni and Z. Shao. Certified assembly programming with embedded code pointers. In Proc. 33rd ACM Symposium on Principles of Programming Languages (POPL), 2006. A. M. Pitts and I. D. B. Stark. Operational reasoning for functions with local state. In Higher Order Operational Techniques in Semantics. CUP, 1998.
20. J.C. Reynolds. Separation logic: A logic for shared mutable data structures. 17th Annual IEEE Symposium on Logic in Computer Science (LICS'02), pages 55-74, 2002. (Pubitemid 34911797)
21. N. Tabareau. Modalités de Ressource et Contrôle en Logique Tensorielle. PhD thesis, Université Paris Diderot (Paris 7), 2008.
22. 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 '04), 2004.
23. J. Vouillon and P.-A. Melliès. Semantic types: A fresh look at the ideal model for types. In Proc. 31st ACM Symposium on Principles of Programming Languages (POPL), 2004.
24. H. Yang. Relational separation logic. Theoretical Computer Science, 375 (1-3), 2007. (Pubitemid 46528654)
25. D. Yu, N. A. Hamid, and Z. Shao. Building certified libraries for PCC: Dynamic storage allocation. Science of Computer Programming, 50, 2004.