Bibliographic Details
| Title: |
A Mechanical Analysis of Program Verification Strategies. |
| Authors: |
Sandip Ray1, Warren Hunt1, John Matthews2, J. Moore1 |
| Source: |
Journal of Automated Reasoning. May2008, Vol. 40 Issue 4, p245-269. 25p. |
| Subjects: |
Completeness theorem, Model theory, Comparative linguistics, Information theory |
| Abstract: |
Abstract We analyze three proof strategies commonly used in deductive verification of deterministic sequential programs formalized with operational semantics. The strategies are (i) stepwise invariants, (ii) clock functions, and (iii) inductive assertions. We show how to formalize the strategies in the logic of the ACL2 theorem prover. Based on our formalization, we prove that each strategy is both sound and complete. The completeness result implies that given any proof of correctness of a sequential program one can derive a proof in each of the above strategies. The soundness and completeness theorems have been mechanically checked with ACL2. [ABSTRACT FROM AUTHOR] |
|
Copyright of Journal of Automated Reasoning is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Engineering Source |
