George C. Necula, Peter Lee  Home/Search
Context Related
| berkeley.edu/home/necu...tr97172.ps.gz cmu.edu/~necula/tr97172.ps.gz cmu.edu/anon/1997/...MUCS97172.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: berkeley.edu/home/necula...papers (more) From: cmu.edu/~necula/papers (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This report describes a framework for representing and validating formal proofs in various axiomatic systems. The framework is based on the Edinburgh Logical Framework (LF) but is optimized for minimizing the size of proofs and the complexity of proof validation, by removing redundant representation components. Several variants of representation algorithms are presented with the resulting representations being a factor of 15 smaller than similar LF representations. The validation algorithm is a ... (Update)
Context of citations to this paper: More
...security. We point here two of them. To avoid the execution of malicious agents, a novel and elegant idea is to use Proof Carrying Code [19]. Every agent has a specification that can in the first step be used by a proving system of the dock to see if the agent is harmless. The...
...the whole derivation tree to be reconstructed from its leaves. An efficient way of storing this information has been investigated in [31]. A significant part of my MSc project was devoted to developing an implementation of the sequent calculus for experimental purposes....
Cited by: More
Automated Techniques for Provably Safe Mobile Code - Colby, Crary, Harper, Lee.. (2000) (Correct)
Access Control for the Web via Proof-Carrying Authorization - Bauer (2003) (Correct)
Certification Support for Automatically Generated Programs - Schumann, Fischer.. (2003) (Correct)
Active bibliography (related documents): More All
0.6: Efficient Representation and Validation of Proofs - Necula, Lee (1998) (Correct)
0.2: Compiling with Proofs - Necula (1997) (Correct)
0.2: Proof-Carrying Code - Necula (1997) (Correct)
Similar documents based on text: More All
0.4: Faster Proof Checking in the Edinburgh Logical Framework - Stump, Dill (2002) (Correct)
0.2: Global Value Numbering using Random Interpretation - Gulwani, Necula (2004) (Correct)
0.2: Capriccio: Scalable Threads for Internet Services - von Behren, Condit, Zhou.. (2003) (Correct)
Related documents from co-citation: More All
9: Proof-carrying code - Necula - 1997
9: A framework for defining logics - Harper, Honsell et al. - 1987
7: Safe Kernel Extensions Without Run-Time Checking - Necula, Lee - 1996
BibTeX entry: (Update)
Necula, G. C., and Lee, P. Efficient representation and validation of logical proofs. Technical Report CMU-CS-97-172, Computer Science Department, Carnegie Mellon University, Oct. 1997. http://citeseer.ist.psu.edu/necula97efficient.html More
@inproceedings{ necula98efficient,
author = "George C. Necula and Peter Lee",
title = "Efficient Representation and Validation of Logical Proofs",
booktitle = "Proceedings of the 13th Annual Symposium on Logic in Computer Science ({LICS}'98)",
publisher = "IEEE Computer Society Press",
address = "Indianapolis, Indiana",
pages = "93--104",
year = "1998",
url = "citeseer.ist.psu.edu/necula97efficient.html" }
Citations (may not include all citations):566 Proof-carrying code - Necula - 1997 ACM DBLP
434 A framework for defining logics - Harper, Honsell et al. - 1993 ACM DBLP
264 Safe kernel extensions without run-time checking - Necula, Lee - 1996 ACM DBLP
251 A logic programming language with lambda-abstraction - Miller - 1991
210 Logic programming in the LF logical framework - Pfenning - 1991 ACM
191 The LEGO proof development system: A user's manual (context) - Luo, Pollack - 1992
143 The Coq proof assistant user's guide (context) - Dowek, Felty et al. - 1993
106 Lambda-calculus notation with nameless dummies (context) - DeBruijn - 1972
72 Semantics and Pragmatics of the Lambda Calculus (context) - Wadsworth - 1971
63 Elf: A meta-language for deductive systems (context) - Pfenning - 1994
56 Unification and anti-unification in the Calculus of Construc.. - Pfenning - 1991 DBLP
29 A unification algorithm for typed lambda calculus (context) - Huet - 1973
25 An empirical study of the runtime behavior of higherorder lo.. - Michaylov, Pfenning - 1992
20 The typed -calculus is not elementary recursive (context) - Statman - 1979
16 A compact representation of proofs (context) - Miller - 1987
15 Higher-order unification with dependent types (context) - Elliott - 1989
14 Higher-order logic programming as constraint logic programmi.. - Michaylov, Pfenning - 1993
7 Informal Proceedings of First Workshop on Logical Frameworks (context) - Pollack - 1990
5 and L' evy (context) - Abadi, Cardelli et al. - 1991
4 Also appeared as FOX memorandum CMU-CS-FOX (context) - Necula, Lee et al. - 1996
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www-nt.cs.berkeley.edu/home/necula/public_html/papers.html): More
The Design and Implementation of a Certifying Compiler - Necula, Lee (1998) (Correct)
Research on Proof-Carrying Code for Mobile-Code Security - Lee, Necula (1997) (Correct)
Proof-Carrying Code - Necula (1997) (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