Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Journal of Automated Reasoning manuscript No. (will be inserted by the editor)
 

Summary: Journal of Automated Reasoning manuscript No.
(will be inserted by the editor)
A list-machine benchmark for mechanized metatheory
Andrew W. Appel Robert Dockins
Xavier Leroy
the date of receipt and acceptance should be inserted later
Abstract We propose a benchmark to compare theorem-proving systems on their
ability to express proofs of compiler correctness. In contrast to the first POPLmark, we
emphasize the connection of proofs to compiler implementations, and we point out that
much can be done without binders or alpha-conversion. We propose specific criteria for
evaluating the utility of mechanized metatheory systems; we have constructed solutions
in both Coq and Twelf metatheory, and we draw conclusions about those two systems
in particular.
Keywords Theorem proving proof assistants program proof compiler verification
typed machine language metatheory Coq Twelf
1 How to evaluate mechanized metatheories
The POPLmark challenge [4] aims to compare the usability of several automated proof
assistants for mechanizing the kind of programming-language proofs that might be
done by the author of a POPL paper. The statement of rationale by the POPLmark
team (as of 26 June 2009) is,

  

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

 

Collections: Computer Technologies and Information Sciences