Aaron Stump, David L. Dill  Home/Search
Context Related
| stanford.edu/PAPERS/CADESD2002.ps 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: stanford.edu/papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This paper describes optimizations for checking proofs represented in the Edinburgh Logical Framework (LF). The optimizations allow large proofs to be checked eciently which cannot feasibly be checked using the standard algorithm for LF. The crucial optimization is a form of result caching. To formalize this optimization, a path calculus for LF is developed and shown equivalent to a standard calculus. (Update)
Context of citations to this paper: More
.... arity functions like the tuple forming operator and n ary addition [12] The proofs can be e ciently checked by a proof checker called ea [11], which ships with CVC. 4 Cha Given the great advances that have been made in propositional SAT solving tools in the last decade, much...
...had only the required functionality would be more lightweight. This also impacts the proof checking performance; a specialized checker [21] would be much faster. 5 Conclusion In this paper we describe an authorization system for web browsers and web servers that solves the...
Cited by: More
High-Performance Deduction for Verification: A Case.. - Armando, Bonacina.. (2002) (Correct)
A General and Flexible Access-Control System for the Web - Bauer, Schneider, Felten (2002) (Correct)
CVC: a Cooperating Validity Checker - Stump, Barrett, Dill (2002) (Correct)
Active bibliography (related documents): More All
0.5: Certifying Term Rewriting Proofs in ELAN - Nguyen (2001) (Correct)
0.5: A Proof-Producing Boolean Search Engine - Barrett, Berezin (2003) (Correct)
0.2: The rewriting calculus - Part II - Cirstea, KIRCHNER (2001) (Correct)
Similar documents based on text: More All
1.3: Flea: a Fast Proof Checker for Elliptical LF - Stump, Dill (Correct)
0.8: Generating Proofs from a Decision Procedure - Stump, Dill (1999) (Correct)
0.6: Efficient Representation and Validation of Proofs - Necula, Lee (1998) (Correct)
Related documents from co-citation: More All
2: A Framework for Cooperating Decision Procedures - Barrett, Dill et al. - 2000
2: A Decision Procedure for an Extensional Theory of Arrays - Stump, Dill et al. - 2001
2: CVC: a Cooperating Validity Checker - Stump, Barrett et al. - 2002
BibTeX entry: (Update)
A. Stump and D. Dill. Faster Proof Checking in the Edinburgh Logical Framework. In 18th International Conference on Automated Deduction, 2002. http://citeseer.ist.psu.edu/stump02faster.html More
@misc{ stump02faster,
author = "A. Stump and D. Dill",
title = "Faster Proof Checking in the Edinburgh Logical Framework",
text = "A. Stump and D. Dill. Faster Proof Checking in the Edinburgh Logical Framework.
In 18th International Conference on Automated Deduction, 2002.",
year = "2002",
url = "citeseer.ist.psu.edu/stump02faster.html" }
Citations (may not include all citations):566 Proof-Carrying Code - Necula - 1997
382 Lambda Calculi with Types - Barendregt - 1992
191 LEGO Proof Development System: User's Manual (context) - Luo, Pollack - 1992
136 System Description: Twelf | A Meta-Logical Framework for Ded.. - Pfenning, Sch - 1999
102 Tree automata techniques and applications - Comon, Dauchet et al. - 1997
96 An algorithm for testing conversion in Type Theory (context) - Coquand - 1991
69 Handbook of Logic in Computer Science (context) - Abramsky, Gabbay et al. - 1992
57 Proof-carrying authentication - Appel, Felten - 1999
47 Logical Frameworks - Pfenning - 2001
45 CVC: a Cooperating Validity Checker - Stump, Barrett et al. - 2002
45 Cambridge University Press (context) - Huet, Plotkin et al. - 1991
35 On Equivalence and Canonical Forms in the LF Type Theory - Harper, Pfenning - 2000
33 Handbook of Automated Reasoning (context) - Robinson, Voronkov - 2001
27 A Framework for De ning Logics (context) - Harper, Honsell et al. - 1993
24 Higher-Order Rewriting with Dependent Types - Virga - 1999
9 Ecient representation and validation of proofs (context) - Necula, Lee - 1998
9 A Set Theory with Support for Partial Functions - Farmer, Guttman - 2000
8 Proof terms for simply typed higher order logic - Berghofer, Nipkow - 2000
6 Validation of HOL Proofs by Proof Checking (context) - Wong - 1999
5 The Inverse Method - Degtyarev, Voronkov - 2001
4 The Rho Cube - Cirstea, Kirchner et al. - 2001
2 Checking Validities and Proofs with CVC and ea (context) - Stump - 2002
1 Reviewing the classical and the de Bruijn notation for -cal.. (context) - Kamareddine
Documents on the same site (http://sprout.stanford.edu/papers.html): More
Self-Consistency Checking - Jones, Seger, Dill (1996) (Correct)
Verifying Systems with Replicated Components in Murφ - Ip, Dill (1997) (Correct)
A High-Performance Asynchronous SCSI Controller - Yun, Dill (1995) (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