D.: Partial Clock Functions in ACL2 (2004)
by
John Matthews
| Venue: | 5th ACL2 Workshop. (2004 |
| Citations: | 4 - 3 self |
BibTeX
@INPROCEEDINGS{Matthews04d.:partial,
author = {John Matthews},
title = {D.: Partial Clock Functions in ACL2},
booktitle = {5th ACL2 Workshop. (2004},
year = {2004}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract J Moore has discovered an elegant approach for verifying state invariants of imperative programs without having to write a verification condition generator (VCG) or clock function. Users need only make assertions about selected cutpoint instructions of a program, such as loop tests and subroutine entry and exit points. ACL2's rewriter is then used to automatically propagate these assertions through the intervening instructions.
Citations
| 89 | A complete method for the synthesis of linear ranking functions - Podelski, Rybalchenko - 2004 |
| 49 | Practical methods for proving program termination - Colón, Sipma - 2002 |
| 45 | Concurrency Verification: Introduction to Compositional and Noncompositional Methods - Roever, Boer, et al. - 2001 |
| 39 | Synthesis of linear ranking functions - Colón, Sipma - 2001 |
| 30 | Partial functions in ACL2 - Manolios, Moore |
| 26 | Reasoning about terminating functional programs - Slind - 1999 |
| 22 | Inductive assertions and operational semantics - Moore - 2003 |
| 11 | Verifying BDD algorithms through monadic interpretation - Krstic, Matthews - 2002 |
| 9 | Ordinal arithmetic in acl2 - Manolios, Vroon - 2003 |
| 8 | Proof styles in operational semantics - Ray, Moore - 2004 |
| 7 | Another Look at Nested Recursion - Slind - 2000 |
| 5 | Wellfounded Schematic Definitions - Slind - 2000 |
| 4 | Inductive invariants for nested recursion - Krstic, Matthews - 2003 |
| 1 | Information on Cryptol can be found at http://www.cryptol.net. [4 - Dams, Gerth, et al. - 2000 |
