Extensible proof-producing compilation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5501 LNCS, Issue , 2009, Pages 2-16

  Myreen, Magnus O ^a   Slind, Konrad ^b   Gordon, Michael J C ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

^b Department of Electrical and Computer Engineering   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INPUT FUNCTIONS; MACHINE CODES; MACHINE LANGUAGES; SOURCE FUNCTIONS; TERMINATION PROOF; THEOREM PROVERS;

COMPUTER SOFTWARE; LINGUISTICS; LISP (PROGRAMMING LANGUAGE); PROGRAM COMPILERS; QUERY LANGUAGES;

THEOREM PROVING;

EID: 70350623391     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-00722-4_2     Document Type: Conference Paper

References (22)

1. The Netwide Assembler, http://www.nasm.us/
2. The GNU Project. GCC, the GNU Compiler Collection, http://gcc.gnu.org/
3. Benton, N., Zarfaty, U.: Formalizing and verifying semantic type soundness of a simple compiler. In: Leuschel, M., Podelski, A. (eds.) Principles and Practice of Declarative Programming (PPDP), pp. 1-12. ACM, New York (2007)
4. Cheney, C.J.: A non-recursive list compacting algorithm. Commun. ACM 13(11),677-678 (1970)
5. Chlipala, A.J.: A certified type-preserving compiler from lambda calculus to assembly language. In: Programming Language Design and Implementation (PLDI),pp. 54-65. ACM, New York (2007)
6. Crary, K., Sarkar, S.: Foundational certified code in a metalogical framework. Technical Report CMU-CS-03-108, Carnegie Mellon University (2003)
7. Fox, A.: Formal specification and verification of ARM6. In: Basin, D., Wolff, B. (eds.) TPHOLs 2003. LNCS, vol. 2758, pp. 25-40. Springer, Heidelberg (2003)
8. Gordon, M., Iyoda, J., Owens, S., Slind, K.: Automatic formal synthesis of hardware from higher order logic. Electr. Notes Theor. Comput. Sci. 145, 27-43 (2006)
9. Guttman, J., Ramsdell, J.,Wand,M.: VLISP: A verified implementation of scheme. Lisp and Symbolic Computation 8(1/2), 5-32 (1995)
10. Klein, G., Nipkow, T.: A machine-checked model for a Java-like language, virtual machine, and compiler. ACM Trans. Program. Lang. Syst. 28(4), 619-695 (2006)
11. Leroy, X.: Formal certification of a compiler back-end, or: programming a compiler with a proof assistant. In: Principles of Programming Languages (POPL), pp. 42-54. ACM Press, New York (2006)
12. Li, G.-D., Owens, S., Slind, K.: Structure of a proof-producing compiler for a subset of higher order logic. In: De Nicola, R. (ed.) ESOP 2007. LNCS, vol. 4421,pp. 205-219. Springer, Heidelberg (2007)
13. Li, G.-D., Slind, K.: Compilation as rewriting in higher order logic. In: Pfenning, F. (ed.) CADE 2007. LNCS, vol. 4603, pp. 19-34. Springer, Heidelberg (2007)
14. Li, G., Slind, K.: Trusted source translation of a total function language. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 471-485.Springer, Heidelberg (2008)
15. Meyer, T., Wolff, B.: Tactic-based optimized compilation of functional programs.In: Filliatre, J.-C., Paulin-Mohring, C., Werner, B. (eds.) TYPES 2004. LNCS,vol. 3839, pp. 201-214. Springer, Heidelberg (2006)
16. Myreen, M.O., Fox, A.C.J., Gordon, M.J.C.: A Hoare logic for ARM machine code. In: Arbab, F., Sirjani, M. (eds.) FSEN 2007. LNCS, vol. 4767, pp. 272-286.Springer, Heidelberg (2007)
17. Myreen, M.O., Gordon, M.J.C.: A Hoare logic for realistically modelled machine code. In: Grumberg, O., Huth, M. (eds.) TACAS 2007. LNCS, vol. 4424, pp. 568-582. Springer, Heidelberg (2007)
18. Myreen, M.O., Slind, K., Gordon, M.J.C.: Machine-code verification for multiple architectures - An application of decompilation into logic. In: Formal Methods in Computer Aided Design (FMCAD). IEEE, Los Alamitos (2008)
19. Necula, G.C.: Translation validation for an optimizing compiler. In: Programming Language Design and Implementation (PLDI), pp. 83-94. ACM, New York (2000)
20. Pnueli, A., Siegel, M., Singerman, E.: Translation validation. In: Steffen, B. (ed.) TACAS 1998. LNCS, vol. 1384, pp. 151-166. Springer, Heidelberg (1998)
21. Rinard, M.C.: Credible compilation. In: Jähnichen, S. (ed.) CC 1999. LNCS, vol. 1575. Springer, Heidelberg (1999)
22. Tristan, J.-B., Leroy, X.: Formal verification of translation validators: a case study on instruction scheduling optimizations. In: Principles of Programming Languages (POPL), pp. 17-27. ACM, New York (2008)