Aaron Stump and David L. Dill. Faster proof checking in the Edinburgh Logical Framework. In Andrei Voronkov, editor, Proc. CADE-18, volume to appear of LNAI. Springer, 2002.  Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
A General and Flexible Access-Control System for the Web - Bauer, Schneider, Felten (2002) (8 citations) (Correct)
....the theorem prover in Java. The capabilities of Twelf are far greater than what we need and impose a severe performance penalty; a custom made theorem prover that 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 problem of interoperability across administrative or trust boundaries by allowing the use of arbitrarily complex security policies. Our system is implemented as ....
A. Stump and D. Dill. Faster Proof Checking in the Edinburgh Logical Framework. In 18th International Conference on Automated Deduction, 2002. A Axioms of the Core Logic Axioms of the higher-order core logic of our PCA system. Except for the last four, they are standard
CVC: a Cooperating Validity Checker - Stump, Barrett, Dill (2002) (36 citations) Self-citation (Stump Dill) (Correct)
....valid. The proofs are represented using a variant of the Edinburgh Logical Framework (LF) 5] extended with features for more conveniently representing multi 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 greater performance on problems with boolean structure can be achieved by incorporating a modern SAT solver. CVC incorporates the Cha SAT solver [6] to do its ....
A. Stump and D. Dill. Faster Proof Checking in the Edinburgh Logical Framework. In 18th International Conference on Automated Deduction, 2002.
High-Performance Deduction for Verification: A Case.. - Armando, Bonacina.. (2002) (Correct)
No context found.
Aaron Stump and David L. Dill. Faster proof checking in the Edinburgh Logical Framework. In Andrei Voronkov, editor, Proc. CADE-18, volume to appear of LNAI. Springer, 2002.
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