| Andrew Bernard and Peter Lee. Temporal logic for proof-carrying code. In Eighteenth International Conference on Automated Deduction, volume 2392 of Lecture Notes in Arti cial Intelligence, pages 31-46, Copenhagen, Denmark, July 2002. Springer-Verlag. |
....constitute an improvement because they remove a substantial trusted element. Removing trusted elements is desirable for two reasons: First, a trusted element could be faulty, so eliminating it improves security. This is particularly compelling for software elements; for example, Bernard and Lee [3] eliminate the verification condition generator from the trusted elements of the SpecialJ PCC system [7] and Appel et al. 2] seek to minimize the number of lines of code in an LF proof checker [11] This is valuable, but even complex elements can become trustworthy if given time to mature. ....
Andrew Bernard and Peter Lee. Temporal logic for proof-carrying code. In Eighteenth International Conference on Automated Deduction, volume 2392 of Lecture Notes in Artificial Intelligence, pages 31--46, Copenhagen, Denmark, July 2002. Springer-Verlag.
No context found.
Andrew Bernard and Peter Lee. Temporal logic for proof-carrying code. In Eighteenth International Conference on Automated Deduction, volume 2392 of Lecture Notes in Arti cial Intelligence, pages 31-46, Copenhagen, Denmark, July 2002. Springer-Verlag.
No context found.
A. Bernard and P. Lee. Temporal Logic for Proof-carrying Code. In Proceedings of the 18th International Conference on Automated Deduction (CADE-18), volume 2392 of Lecture Notes in Arti cial Intelligence, pages 31-46, Copenhagen, Danmark, July 2002.
No context found.
A. Bernard and P. Lee. Temporal logic for proof-carrying code. Technical Report CMU-CS-02-130, School of Computer Science, Carniege Mellon University, Pittsburgh, PA, 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