Skip to main content


An Isabelle proof method language


Daniel Matichuk, Makarius Wenzel and Toby Murray



Univ. Paris-Sud



Machine-checked proofs are becoming ever-larger, presenting an increasing maintenance challenge. Isabelle's most popular language interface, Isar, is attractive for new users, and powerful in the hands of experts, but has previously lacked a means to write automated proof procedures. This can lead to more duplication in large proofs than is desirable. In this paper we present a proof method language for Isabelle, which aims to fill this gap by incorporating Isar language elements, thus making it accessible to existing users. We describe the language and the design principles on which it was developed. We evaluate its effectiveness by implementing some tactics widely-used in the seL4 verification stack, and report on its strengths and limitations.

BibTeX Entry

    publisher        = {Springer},
    doi              = {10.1007/978-3-319-08970-6_25},
    author           = {Matichuk, Daniel and Wenzel, Makarius and Murray, Toby},
    month            = jul,
    editor           = {{Gerwin Klein and Ruben Gamboa}},
    year             = {2014},
    keywords         = {proof automation, proof procedure language, isabelle},
    title            = {An {Isabelle} Proof Method Language},
    booktitle        = {International Conference on Interactive Theorem Proving},
    pages            = {390--405},
    address          = {Vienna, Austria}


Served by Apache on Linux on seL4.