Code-carrying theory

Proceedings of the ACM Symposium on Applied Computing

Volumn , Issue , 2008, Pages 376-383

  Vargun, Aytekin ^a   Musser, David R ^a  

^a RENSSELAER POLYTECHNIC INSTITUTE   (United States)

Author keywords

Correctness; Memory safety; Proof carrying code; Secure code delivery

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; LINGUISTICS;

CORRECTNESS; GENERATING THEOREMS; MEMORY SAFETY; PROOF CHECKING; PROOF OF CORRECTNESSES; PROOF-CARRYING CODE; SAFETY PROPERTIES; SECURE CODE DELIVERY; TRADITIONAL PROGRAMMING LANGUAGES; VERIFICATION CONDITIONS;

CODES (SYMBOLS);

EID: 56749096024     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1363686.1363780     Document Type: Conference Paper

References (22)

1. A. Ahmed, A. Appel, and R. Virga. A stratified semantics of general references embeddable in higher-order logic, 2002.
2. A. W. Appel. Foundational proof-carrying code. In Symposium on Logic in Computer Science, pages 247-258, boston, 2001. IEEE Computer Society Press.
3. A. W. Appel and D. A. McAllester. An indexed model of recursive types for foundational proof-carrying code. Programming Languages and Systems, 23(5):657-683, 2001.
4. K. Arkoudas. Denotational Proof Languages. PhD thesis, MIT, 2000.
5. K. Arkoudas. Certified computation, 2001. citeseer.nj.nec.com/ arkoudas01certified.html.
6. K. Arkoudas. Specification, abduction, and proof. In 2nd International Symposium on Automated Technology for Verification and Analysis (ATVA 2004), National Taiwan University, October 2004.
7. K. Arkoudas. An Athena tutorial, 2005. http://www.cag.csail.mit.edu/ ~kostas/dpls/athena/athenaTutorial.pdf.
8. M. W. Bailey and N. C. Weston. Performance benefits of tail recursion removal in procedural languages. Technical Report TR-2001-2, Computer Science Department, Hamilton College, June 2001.
9. C. Colby, P. Lee, G. C. Necula, F. Blau, M. Plesko, and K. Cline. A certifying compiler for Java. In Proceedings of the Conference on Programming Language Design and Implementation, pages 95-107, Vancouver, Canada, June 2000. ACM Press.
10. M. Consortium. The Mozart Programming System. http://www.mozart-oz.org.
11. P. W. L. Fong. Proof Linking: A Modular Verification Architecture for Mobile Code Systems. PhD thesis, Simon Fraser University, 2004.
12. C. League, Z. Shao, and V. Trifonov. Precision in practice: A type-preserving java compiler. Technical report, YALE/DCS/TR-1223, Dept. of Computer Science, Yale University, New Haven, CT, January 2002.
13. W. W. McCune. Otter 3.0 reference manual and guide. Technical Report ANL 94/6, Argonne National Laboratory, January 1994.
14. D. Musser and A. Vargun. Proving theorems with Athena. http://www.cs.rpi.edu/~musser/gsd/athena.html.
15. G. C. Necula. Proof-carrying code. In Conference Record of POPL '97: The 24th ACM SIGPLAN-SlGACT Symposium on Principles of Programming Languages, pages 106-119, Paris, France, Jan 1997.
16. G. C. Necula. Compiling with Proofs. PhD thesis, CMU, 1998.
17. R.S.Boyer and J. S. Moore. A Computational Logic. Academic Press, 1979.
18. A. Trybulec. Some features of the Mizar language. In ESPRIT Workshop, Torino, 1993.
19. P. Van Roy and S. Haridi. Concepts, Techniques, and Models of Computer Programming. MIT Press, Mar. 2004.
20. A. Vargun. Code-Carrying Theory. PhD thesis, RPI, 2006. http://www.cs.rpi.edu/~vargua/thesis/cct-thesis.pdf.
21. A. Vargun. Termination checking without using an ordering relation. In 11th IASTED International Conference on Software Engineering and Applications, Cambridge, Massachusetts, USA, 2007. ACTA Press.
22. C. Weidenbach. SPASS: An automated theorem prover for first-order logic with equality. http://spass.mpi-sb.mpg.de.