Journal of Automated Reasoning

, Volume 49, Issue 3, pp 453–491

A List-Machine Benchmark for Mechanized Metatheory

Article

DOI: 10.1007/s10817-011-9226-1

Cite this article as:
Appel, A.W., Dockins, R. & Leroy, X. J Autom Reasoning (2012) 49: 453. doi:10.1007/s10817-011-9226-1

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 

Copyright information

© Springer Science+Business Media B.V. 2011

Authors and Affiliations

  • Andrew W. Appel
    • 1
  • Robert Dockins
    • 1
  • Xavier Leroy
    • 2
  1. 1.Princeton UniversityPrincetonUSA
  2. 2.INRIA Paris-RocquencourtLe ChesnayFrance

Personalised recommendations