Skip to main content


A termination checker for isabelle hoare logic


Jia Meng, Lawrence C. Paulson and Gerwin Klein


University of Cambridge



Hoare logic is widely used for software specification and verification. Frequen tly we need to prove the total correctness of a program: to prove that the progr am not only satisfies its pre- and post-conditions but also terminates. We have implemented a termination checker for Isabelle's Hoare logic. The tool can be used as an oracle, where Isabelle accepts its claim of termination. The tool can also be used as an Isabelle method for proving the entire total correctness spe cification. For many loop structures, verifying the tool's termination claim wit hin Isabelle is essentially automatic.

BibTeX Entry

    publisher        = {CEUR Workshop Proceedings},
    author           = {Meng, Jia and Paulson, Lawrence C. and Klein, Gerwin},
    series           = {CEUR Workshop Proceedings},
    issn             = {1613-0073},
    month            = {jul},
    volume           = {259},
    editor           = {{Bernhard Beckert}},
    year             = {2007},
    title            = {A Termination Checker for Isabelle Hoare Logic},
    booktitle        = {International Verification Workshop},
    pages            = {104-118},
    address          = {Bremen, Germany}