High-level separation logic for low-level code

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

Volumn , Issue , 2013, Pages 301-313

  Jensen, Jonas B ^a   Benton, Nick ^b   Kennedy, Andrew ^b  

^a IT UNIVERSITY OF COPENHAGEN   (Denmark)

^b MICROSOFT RESEARCH   (United Kingdom)

Author keywords

machine code; proof assistants; separation logic

Indexed keywords

ASSEMBLY-LANGUAGE; COMPUTATIONAL REFLECTION; CONTINUATION-PASSING STYLE; COQ PROOF ASSISTANT; HIGHER-ORDER; IMPERATIVE PROGRAMS; ITS APPLICATIONS; MACHINE CODES; ON-MACHINES; PROOF ASSISTANT; PROOF RULES; SEPARATION LOGIC; SPECIFICATION LOGIC; WHILE LOOPS;

COMPUTER PROGRAMMING LANGUAGES; STRUCTURED PROGRAMMING;

FORMAL LOGIC;

EID: 84874141408     PISSN: 07308566     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2429069.2429105     Document Type: Conference Paper

References (41)

1. R. Affeldt, D. Nowak, and K. Yamada. Certifying assembly with formal security proofs: the case of BBS. Sci. Comput. Prog., 77(10-11), 2012.
2. A. W. Appel and D. McAllester. An indexed model of recursive types for foundational proof-carrying code. ACM Trans. Program. Lang. Syst., 2001.
3. A. W. Appel, P.-A. Melliès, C. D. Richards, and J. Vouillon. A very modal model of a modern, major, general type system. In Proceedings of POPL, 2007.
4. J. Bengtson, J. B. Jensen, and L. Birkedal. Charge! - a framework for higher-order separation logic in Coq. In Proc. of ITP, 2012.
5. N. Benton. A typed, compositional logic for a stack-based abstract machine. In APLAS, volume 3780 of LNCS, 2005.
6. N. Benton. Abstracting allocation: The new new thing. In Computer Science Logic (CSL 2006), volume 4207 of LNCS, 2006.
7. N. Benton and N. Tabareau. Compiling functional types to relational specifications for low level imperative code. In TLDI, 2009.
8. L. Birkedal, N. Torp-Smith, and H. Yang. Semantics of separation-logic typing and higher-order frame rules. In Proc. of LICS, 2005.
9. L. Birkedal, N. Torp-Smith, and H. Yang. Semantics of separation-logic typing and higher-order frame rules for Algol-like languages. Logical Methods in Computer Science, 2006.
10. L. Birkedal and H. Yang. Relational parametricity and separation logic. Logical Methods in Computer Science, 2008.
11. F. Blanqui, C. Helmstetter, V. Joloboff, J.-F. Monin, and X. Shi. Designing a CPU model: from a pseudo-formal document to fast code. In 3rd Workshop on Rapid Simulation and Performance Evaluation: Methods and Tools (RAPIDO 2011), 2011.
12. R. Bornat, C. Calcagno, P. W. O'Hearn, and M. J. Parkinson. Permission accounting in separation logic. In Proceedings of POPL, 2005.
13. R. M. Burstall. Some techniques for proving correctness of programs which alter data structures. Machine Intelligence, 7, 1972.
14. H. Cai, Z. Shao, and A. Vaynberg. Certified self-modifying code. In Proc. of PLDI, 2007.
15. C. Calcagno, P. W. O'Hearn, and H. Yang. Local action and abstract separation logic. In Proc. of LICS, 2007.
16. A. Chlipala. Mostly-automated verification of low-level programs in computational separation logic. In Proc. of PLDI, 2011.
17. A. Chlipala. Certified Programming with Dependent Types. MIT Press, to appear.
18. R. W. Floyd. Assigning meanings to programs. In J. T. Schwartz, editor, Mathematical Aspects of Computer Science, volume 19 of Proc. of Symposia in Applied Mathematics, Providence, Rhode Island, 1967. AMS.
19. A. C. J. Fox and M. O. Myreen. A trustworthy monadic formalization of the ARMv7 instruction set architecture. In 1st International Conference on Interactive Theorem Proving (ITP 2010), volume 6172 of LNCS, 2010.
20. G. Gonthier, A. Mahboubi, and E. Tassi. A small scale reflection extension for the Coq system. Technical Report 6455, INRIA, 2011.
21. C. Hawblitzel and E. Petrank. Automated verification of practical garbage collectors. In POPL, 2009.
22. J. B. Jensen and L. Birkedal. Fictional separation logic. In Proc. of ESOP, volume 7211 of LNCS. Springer, 2012.
23. N. R. Krishnaswami. Verifying Higher-Order Imperative Programs with Higher-Order Separation Logic. PhD thesis, Carnegie Mellon University, 2012.
24. J. McCarthy and J. Painter. Correctness of a compiler for arithmetic expressions. In Mathematical Aspects of Computer Science, volume 19 of Proc. of Symposia in Applied Mathematics. AMS, 1967.
25. J. Strother Moore. A mechanically verified language implementation. Journal of Automated Reasoning, 5, 1989.
26. G. Morrisett, G. Tan, J. Tassarotti, J.B. Tristan, and E. Gan. Rocksalt: Better, faster, stronger SFI for the x86. In 33rd ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI 2012). ACM, 2012.
27. G. Morrisett, D. Walker, K. Crary, and N. Glew. From System F to typed assembly language. ACM Transactions on Programming Languages and Systems, 21(3), 1999.
28. M. O. Myreen. Verified just-in-time compiler on x86. In Proc. of POPL, 2010.
29. M. O. Myreen and M. J. C. Gordon. Hoare logic for realistically modelled machine code. In Proc. of TACAS, 2007.
30. H. Nakano. A modality for recursion. In Proc. of LICS, 2000.
31. Z. Ni and Z. Shao. Certified assembly programming with embedded code pointers. In Proc. of POPL, 2006.
32. P. W. O'Hearn, H. Yang, and J. C. Reynolds. Separation and information hiding. In Proc. of POPL, 2004.
33. F. Pottier. Hiding local state in direct style: a higher-order anti-frame rule. In Proc. of LICS, 2008.
34. J. C. Reynolds. An introduction to specification logic. In Logics of Programs, 1983.
35. J. C. Reynolds. Separation logic: A logic for shared mutable data structures. In Proc. of LICS, 2002.
36. A. Saabas and T. Uustalu. A compositional natural semantics and Hoare logic for low-level languages. Theor. Comput. Sci., 373(3), 2007.
37. M. Sozeau and N. Oury. First-class type classes. In Proc. of TPHOLs, 2008.
38. G. Tan and A. W. Appel. A compositional logic for control flow. In 7th International Conference on Verification, Model Checking, and Abstract Interpretation (VMCAI 2006), 2006.
39. A. M. Turing. Checking a large routine. In Report of a Conference on High Speed Automatic Calculating Machines, 1949.
40. X. JiangW.Wang, Z. Shao and Y. Guo. A simple model for certifying assembly programs with first-class function pointers. In Proc. of TASE, 2011.
41. W. D. Young. A mechanically verified code generator. Journal of Automated Reasoning, 5, 1989.