Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Foundational Proof Checkers with Small Witnesses Dinghao Wu Andrew W. Appel Aaron Stump
 

Summary: Foundational Proof Checkers with Small Witnesses
Dinghao Wu Andrew W. Appel Aaron Stump
Princeton University Washington University in St. Louis
{dinghao,appel}@cs.princeton.edu stump@cs.wustl.edu
ABSTRACT
Proof checkers for proof-carrying code (and similar systems)
can suffer from two problems: huge proof witnesses and un-
trustworthy proof rules. No previous design has addressed
both of these problems simultaneously. We show the theory,
design, and implementation of a proof-checker that permits
small proof witnesses and machine-checkable proofs of the
soundness of the system.
Categories and Subject Descriptors
D.2.4 [Software Engineering]: Software/Program Verifi-
cation--correctness proofs, formal methods; F.3.1 [Logics
and Meanings of Programs]: Specifying and Verifying
and Reasoning about Programs--logics of programs, me-
chanical verification; F.3.2 [Logics and Meanings of Pro-
grams]: Semantics of Programming Languages--denota-
tional semantics

  

Source: Appel, Andrew W. - Department of Computer Science, Princeton University

 

Collections: Computer Technologies and Information Sciences