Foundational certified code in a metalogical framework

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

Volumn 2741, Issue , 2003, Pages 106-120

  Crary, Karl ^a   Sarkar, Susmit ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATION; COMPUTER PROGRAMMING LANGUAGES; COMPUTER SCIENCE; FORMAL LOGIC; PUBLIC POLICY; SYSTEMS ANALYSIS;

ALTERNATIVE STRUCTURE; CERTIFIED CODES; MACHINE ARCHITECTURES; META-LOGIC; SAFETY POLICIES; TYPED ASSEMBLY LANGUAGE; EXTENSIBILITY; METALOGICAL FRAMEWORKS; UNTRUSTED PROGRAMS;

THEOREM PROVING; CODES (SYMBOLS);

EID: 7044252861     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45085-6_9     Document Type: Conference Paper

References (28)

1. Andrew W. Appel and Amy P. Felty. A semantic model of types and machine instructions for proof-carrying code. In Twenty-Seventh ACM Symposium on Principles of Programming Languages, pages 243-253, Boston, January 2000.
2. Andrew W. Appel, Neophytos Michael, Aaron Stump, and Roberto Virga. A trustworthy proof checker. Technical Report TR-647-02, Department of Computer Science, Princeton University, April 2002.
3. Andrew Bernard and Peter Lee. Temporal logic for proof-carrying code. In Eighteenth International Conference on Automated Deduction, volume 2392 of Lecture Notes in Artificial Intelligence, pages 31-46, Copenhagen, Denmark, July 2002. Springer-Verlag.
4. Hans-J. Boehm and Mark Weiser. Garbage collection in an uncooperative environment. Software Practice and Experience, 18(9):807-820, September 1988.
5. Rajkumar Buyya and Mark Baker, editors. First International Workshop on Grid Computing, volume 1971 of Lecture Notes in Computer Science, Bangalore, India, December 2000. Springer-Verlag.
6. Bor-Yuh Evan Chang, Karl Crary, Margaret De Lap, Robert Harper, Jason Liszka, Tom Murphy VII, and Frank Pfenning. Trustless grid computing in ConCert. In Third International Workshop on Grid Computing, volume 2536 of Lecture Notes in Computer Science, pages 112-125, Baltimore, Maryland, November 2002.
7. Christopher Colby, Peter Lee, George Necula, and Fred Blau. A certifying compiler for Java. In 2000 SIGPLAN Conference on Programming Language Design and Implementation, pages 95-107, Vancouver, British Columbia, June 2000.
8. Karl Crary. Toward a foundational typed assembly language. In Thirtieth ACM Symposium on Principles of Programming Languages, pages 198-212, New Orleans, Louisiana, January 2003.
9. Karl Crary and Susmit Sarkar. Foundational certified code in a metalogical framework. Technical Report CMU-CS-03-108, Carnegie Mellon University, School of Computer Science, 2003.
10. Nadeem Hamid, Zhong Shao, Valery Trifonov, Stefan Monnier, and Zhaozhong Ni. A syntactic approach to foundational proof-carrying code. In Seventeenth IEEE Symposium on Logic in Computer Science, pages 89-100, Copenhagen, Denmark, July 2002.
11. Robert Harper. A simplified account of polymorphic references. Information Processing Letters, 51(4):201-206, 1994. Follow-up note in Information Processing Letters, 57(1), 1996.
12. Robert Harper, Furio Honsell, and Gordon Plotkin. A framework for defining logics. Journal of the ACM, 40(1):143-184, January 1993.
13. Intel Corporation. IA-32 Intel Architecture Software Developer’s Manual, 2001. Order numbers 245470-245472.
14. Craig Lee, editor. Second International Workshop on Grid Computing, volume 2242 of Lecture Notes in Computer Science, Denver, Colorado, November 2001. Springer-Verlag.
15. Tim Lindholm and Frank Yellin. The Java Virtual Machine Specification. Addison-Wesley, 1996.
16. Greg Morrisett, Karl Crary, Neal Glew, Dan Grossman, Richard Samuels, Frederick Smith, David Walker, Stephanie Weirich, and Steve Zdancewic. TALx86: A realistic typed assembly language. In Second Workshop on Compiler Support for System Software, Atlanta, May 1999.
17. Greg Morrisett, Karl Crary, Neal Glew, and David Walker. Stack-based typed assembly language. Journal of Functional Programming, 12(1):43-88, January 2002.
18. Greg Morrisett, David Walker, Karl Crary, and Neal Glew. From System F to typed assembly language. ACM Transactions on Programming Languages and Systems, 21(3):527-568, May 1999. An earlier version appeared in the 1998 Symposium on Principles of Programming Languages.
19. George Necula. Proof-carrying code. In Twenty-Fourth ACM Symposium on Principles of Programming Languages, pages 106-119, Paris, January 1997.
20. George Necula and Peter Lee. Safe kernel extensions without run-time checking. In Second Symposium on Operating Systems Design and Implementation, pages 229-243, Seattle, October 1996.
21. George Ciprian Necula. Compiling with Proofs. PhD thesis, Carnegie Mellon University, School of Computer Science, Pittsburgh, Pennsylvania, September 1998.
22. Manish Parashar, editor. Third International Workshop on Grid Computing, volume 2536 of Lecture Notes in Computer Science, Baltimore, Maryland, November 2002. Springer-Verlag.
23. Christine Paulin-Mohring. Inductive definitions in the system coq-rules and properties. In International Conference on Typed Lambda Calculi and Applications, volume 664 of Lecture Notes in Computer Science. Springer-Verlag, 1993.
24. Frank Pfenning and Carsten Schürmann. System description: Twelf-a metalogic framework for deductive systems. In Sixteenth International Conference on Automated Deduction, volume 1632 of Lecture Notes in Computer Science, pages 202-206, Trento, Italy, July 1999. Springer-Verlag.
25. Frank Pfenning and Carsten Schürmann. Twelf User’s Guide, Version 1. 3R4, 2002. Available electronically at http://www.cs.cmu.edu/~twelf.
26. SETI@Home. http://setiathome.ssl.berkeley.edu, November 2000.
27. Tool Interface Standards Committee. Executable and Linking Format (ELF) specification, May 1995. http://x86.ddj.com/ftp/manuals/tools/elf.pdf.
28. Andrew K. Wright and Matthias Felleisen. A syntactic approach to type soundness. Information and Computation, 115:38-94, 1994.