(Enter summary)
Abstract: Foundational certi
ed code systems seek to prove untrusted programs to be safe relative to safety policies
given in terms of actual machine architectures, thereby improving the systems' exibility and extensibility.
Previous eorts have employed a structure wherein the proofs are expressed in the same logic used to
express the safety policy. We propose an alternative structure wherein safety proofs are expressed in the
Twelf metalogic, thereby eliminating from those proofs an extra layer of... (Update)
Cited by: More
Manifest Security for Distributed Information - Crary, Harper, Pfenning (2006)
(Correct)
Small proof witnesses for LF - Sarkar, Pientka, Crary (2005)
(Correct)
Mechanizing the Metatheory of Standard ML - Lee, Crary, Harper (2006)
(Correct)
Similar documents (at the sentence level):
55.1%: A Metalogical Approach to Foundational Certified Code - Crary, Sarkar (2003)
(Correct)
28.7%: Foundational Certified Code in a Metalogical - Framework Karl Crary (2005)
(Correct)
Active bibliography (related documents): More All
1.2: Toward a Foundational Typed Assembly Language - Crary (2002)
(Correct)
0.5: Changing Data Structures in Type Theory: a study of natural.. - Magaud, Bertot (2000)
(Correct)
0.2: Model Checking Reconfigurable Processor Configurations.. - Cochran, Kapur..
(Correct)
Similar documents based on text: More All
0.3: Rewriting Logic as a Metalogical Framework - Basin, Clavel, Meseguer (2000)
(Correct)
0.3: Reflective Metalogical Frameworks - Basin, Clavel, Meseguer (1999)
(Correct)
0.2: An Expressive, Scalable Type Theory for Certified Code - Crary, Vanderwaart (2001)
(Correct)
Related documents from co-citation: More All
4: System description: Twelf --- a meta-logical framework for deductive systems
- Pfenning, Schurmann - 1999
4: A Machine-Checked Model for a Java-Like Language (context) - Klein, Nipkow - 2004
4: Toward a foundational typed assembly language
- Crary - 2002
BibTeX entry: (Update)
Crary, K. & Sarkar, S. (2003), Foundational certified code in a metalogical framework., in `CADE', pp. 106--120. http://citeseer.ist.psu.edu/crary03foundational.html More
@misc{ crary03foundational,
author = "K. Crary and S. Sarkar",
title = "Foundational certified code in a metalogical framework",
text = "Crary, K. & Sarkar, S. (2003), Foundational certified code in a metalogical
framework., in `CADE', pp. 106--120.",
year = "2003",
url = "citeseer.ist.psu.edu/crary03foundational.html" }
Citations (may not include all citations):
566
Proof-carrying code
- Necula - 1997
264
Safe kernel extensions without run-time checking
- Necula, Lee - 1996
210
Logic programming in the LF logical framework
- Pfenning - 1991
167
Garbage collection in an uncooperative environment (context) - Boehm, Weiser - 1988
120
The Java Virtual Machine Speci cation (context) - Lindholm, Yellin - 1996
97
Stack-based typed assembly language
- Morrisett, Crary et al. - 2002
93
TALx86: A realistic typed assembly language
- Morrisett, Crary et al. - 1999
65
A semantic model of types and machine instructions for proof..
- Appel, Felty - 2000
61
IA-32 Intel Architecture Software Developer's Manual (context) - Corporation - 2001
50
A certifying compiler for Java
- Colby, Lee et al. - 2000
46
ACM Transactions on Programming Languages and Systems (context) - Morrisett, Walker et al. - 1999
38
Department of Computer Science (context) - Appel, Michael et al. - 2002
32
Implementing the meta-theory of deductive systems
- Pfenning, Rohwedder - 1992
27
Mode and termination checking for higher-order logic program..
- Rohwedder, Pfenning - 1996
27
A framework for de ning logics (context) - Harper, Honsell et al. - 1993
25
Toward a foundational typed assembly language
- Crary - 2003
21
A syntactic approach to foundational proof-carrying code
- Hamid, Shao et al. - 2002
20
Trustless grid computing in ConCert
- Chang, Crary et al. - 2002
15
Executable and Linking Format (context) - Standards - 1995
14
A simpli ed account of polymorphic references (context) - Harper - 1994
12
School of Computer Science (context) - Necula, Proofs et al. - 1998
9
Termination and reduction checking in the logical framework
- Pientka, Pfenning - 2000
5
Available electronically httpwww (context) - Pfenning, urmann et al. - 2002
4
Temporal logic for proof-carrying code (context) - Bernard, Lee - 2002
4
First International Workshop on Grid Computing (context) - Buyya, Baker - 1971
4
System description: Twelf | a meta-logic framework for deduc.. (context) - Pfenning, Sch - 1999
4
Second International Workshop on Grid Computing (context) - Lee - 2001
2
Third International Workshop on Grid Computing (context) - Parashar - 2002
2
Inductive de nitions in the system coq|rules and properties (context) - Paulin-Mohring - 1993
1
Automating the Meta Theory of Deductive Systems (context) - Sch - 2000
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://reports-archive.adm.cs.cmu.edu/anon/2003/): More
A Type System for Well-Founded Recursion - Dreyer, Harper, Crary (2003)
(Correct)
Approximation Schemes for Flow Time on Multiple Machines - Bansal (2003)
(Correct)
Protecting Privacy in Key-Value Search Systems - Xie, O'Hallaron, Reiter (2003)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC