Toward a foundational typed assembly language

ACM SIGPLAN Notices

Volumn 38, Issue 1, 2003, Pages 198-212

  Crary, Karl ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Proof carrying code; Typed assembly language

Indexed keywords

COMPUTER ARCHITECTURE; HIGH LEVEL LANGUAGES; PROGRAM COMPILERS; SECURITY OF DATA; SEMANTICS; STORAGE ALLOCATION (COMPUTER); THEOREM PROVING;

GARBAGE COLLECTION; PROOF-CARRYING CODE; TYPED ASSEMBLY LANGUAGE;

PROGRAM ASSEMBLERS;

EID: 1542316041     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/640128.604149     Document Type: Article

References (31)

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. Hans-J. Boehm. Simple garbage-collector safety. In 1996 SIGPLAN Conference on Programming Language Design and Implementation, pages 89-98, Philadelphia, Pennsylvania, May 1996.
3. Hans-J. Boehm and David Chase. A proposal for garbage-collector-safe C compilation. The Journal of C Language Translation, 4(2):126-141, December 1992.
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. Henry Cejtin, Suresh Jagannathan, and Stephen Weeks. Flow-directed closure conversion for typed languages. In European Symposium on Programming, March 2000.
7. Bor-Yuh Evan Chang, Karl Crary, Margaret DeLap, Robert Harper, Jason Liszka, Tom Murphy VII, and Frank Pfenning. Trustless grid computing in Concert. Technical Report CMU-CS-02-152, Carnegie Mellon University, School of Computer Science, June 2002.
8. 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.
9. ConCert. http://www.cs.cmu.edu/~concert, September, 2001.
10. Karl Crary. Toward a foundational typed assembly language. Technical Report CMU-CS-02-196, Carnegie Mellon University, School of Computer Science, December 2002.
11. Karl Crary and Greg Morrisett. Type structure for low-level programming languages. In Twenty-Sixth International Colloquium on Automata, Languages, and Programming, volume 1644 of Lectures Notes in Computer Science, pages 40-54, Prague, Czech Republic, July 1999. Springer-Verlag.
12. Joshua Dunfield. Personal communication.
13. 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, Copenhagen, Denmark, July 2002.
14. Robert Harper, Furio Honsell, and Gordon Plotkin. A framework for defining logics. Journal of the ACM, 40(1):143-184, January 1993.
15. Intel Corporation. IA-32 Intel Architecture Software Developer's Manual, 2001. Order numbers 245470-245472.
16. Craig Lee, editor. Second International Workshop on Grid Computing, volume 2242 of Lecture Notes in Computer Science, Denver, Colorado, November 2001. Springer-Verlag.
17. Tim Lindholm and Frank Yellin. The Java Virtual Machine Specification. Addison-Wesley, 1996.
18. Greg Morrisett, Karl Crary, Neal Glew, Dan Grossman, Richards 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.
19. Greg Morrisett, Karl Crary, Neal Glew, and David Walker. Stack-based typed assembly language. Journal of Functional Programming, 12(1):43-88, January 2002. An earlier version appeared in the 1998 Workshop on Types in Compilation, volume 1473 of Lecture Notes in Computer Science.
20. 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.
21. George Nacula and S. P. Rahul. Oracle-based checking of untrusted software. In Twenty-Eighth ACM Symposium on Principles of Programming Languages, pages 142-154, London, January 2001.
22. Frank Pfenning. Logic programming in the LF logical framework. In Gérard Huet and Gordon Plotkin, editors, Logical Frameworks, pages 149-181. Cambridge University Press, 1991.
23. Frank Pfenning and Ekkehard Rohwedder. Implementing the meta-theory of deductive systems. In Eleventh International Conference on Automated Deduction, volume 607 of Lecture Notes in Computer Science, pages 537-551, Saratoga Springs, New York, June 1992. Springer-Verlag.
24. Frank Pfenning and Carsten Schürmann. System description: Twelf - a meta-logic 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. Ekkehard Rohwedder and Frank Pfenning. Mode and termination checking for higher-order logic programs. In European Symposium on Programming, volume 1058 of Lecture Notes in Computer Science, pages 296-310, Linköping, Sweden, April 1996. Springer-Verlag.
27. Carsten Schürmann. Automating the Meta Theory of Deductive Systems. PhD thesis, Carnegie Mellon University, School of Computer Science, Pittsburgh, Pennsylvania, October 2000.
28. SETI Home. http://setiathome.ssl.berkeley.edu November 2000.
29. Frederick Smith, David Walker, and Greg Morrisett. Alias types. In European Symposium on Programming, Berlin, Germany, March 2000.
30. Andrew Tolmach and Dino P. Oliva. From ML to Ada: Strongly-typed language interoperability via source translation. Journal of Functional Programming, 8(4):367-412, July 1998.
31. J. B. Wells. Typability and type checking in System F are equivalent and undecidable. Annals of Pure and Applied Logic, 98(1-3):111-156, 1999.