George C. Necula and Peter Lee. E#cient representation and validation of proofs. In In Proceedings of the 13th Annual Symposium on Logic in Computer Science, 1998. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
More On Implicit Syntax - Luther (Correct)
....a dynamic compression algorithm for proof terms in Isabelle [BN00] Their algorithm searches for optimal representations by essentially doing elaboration on erasure and seems not to be e#cient enough for interactive usage. The problem of redundancy has been addressed also by Necula and Lee [NL98] in the context of Proof Carrying Code systems. They analyze the combination of ad hoc argument synthesis with implicit type annotations for canonical first order proof objects represented as fully applied LF terms in long ## normal form, given a fully explicit expected type. This special setting ....
G. Necula, P. Lee. E#cient representation and validation of proofs. In Proc. of LICS'98, pp. 93--104. IEEE Press, 1998.
Proof-Carrying Authentication - Appel, Felten (1999) (45 citations) (Correct)
....can simply send a 84 word theorem and 123 word proof to justify read foo. But if other lemmas turn out to be helpful in structuring the proof, they can be represented in a very reasonable size, as the table shows. These numbers are gross overestimates of what can be achieved in practice; Necula [10] has shown methods of reducing the redundancy in LF proofs and cutting their size by large factors. Some servers such as programmable disk controllers or active network routers are so specialized that they will not even want to have a full proof checker. In this case, they can rely on ....
George C. Necula and Peter Lee. E#cient Representation and Validation of Proofs. In In Proceedings of the 13th Annual Symposium on Logic in Computer Science, 1998.
Foundational Proof Checkers with Small Witnesses - Wu, Appel, Stump (2003) (3 citations) (Correct)
No context found.
George C. Necula and Peter Lee. E#cient representation and validation of proofs. In In Proceedings of the 13th Annual Symposium on Logic in Computer Science, 1998.
Interfacing Compilers, Proof Checkers, and Proofs for Foundational.. - Wu (2005) (Correct)
No context found.
George C. Necula and Peter Lee. E#cient representation and validation of proofs. In Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science (LICS '98), pages 93--104. IEEE Computer Society, 1998.
Safe Programming at the C Level of Abstraction - Grossman (2003) (Correct)
No context found.
George Necula and Peter Lee. E#cient representation and validation of proofs. In 13th IEEE Symposium on Logic in Computer Science, pages 93-- 104, Indianapolis, IN, June 1998.
Proof Terms for Simply Typed Higher Order Logic - Stefan Berghofer And (2000) (5 citations) (Correct)
No context found.
G. C. Necula and P. Lee. E#cient representation and validation of proofs. In 13th IEEE Symp. Logic in Computer Science (LICS'98), pages 93--104. IEEE Computer Society Press, 1998.
Foundational Proof Checkers with Small Witnesses - Dinghao Wu Andrew (2003) (3 citations) (Correct)
No context found.
George C. Necula and Peter Lee. E#cient representation and validation of proofs. In In Proceedings of the 13th Annual Symposium on Logic in Computer Science, 1998.
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