A termination checker for Isabelle Hoare logic
Authors
Jia Meng, Lawrence C. Paulson and Gerwin Klein
School of Computer Science and Engineering
University of New South Wales
Sydney 2052 Australia
NICTA, Sydney,
Australia
Abstract
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
@inproceedings{Meng_PK_07,
author = {Jia Meng and Lawrence C. Paulson and Gerwin Klein},
title = {A Termination Checker for {Isabelle} {Hoare} Logic},
series = {CEUR Workshop Proceedings},
booktitle = {Proceedings of the 4th International Verification Workshop},
issn = {1613-0073},
year = {2007},
month = {Jul},
volume = {259},
editor = {Bernhard Beckert},
address = {Bremen, Germany},
pages = {104--118}
}