Abstract
Compositional proofs about systems of many components often involve apparently circular arguments. That is, correctness of component A must be assumed when verifying component B, and vice versa. The apparent circularity of such arguments can be resolved by induction over time. However, previous methods for such circular compositional proofs apply only to safety properties. This paper presents a method of circular compositional reasoning that applies to liveness properties as well. It is based on a new circular compositional rule implemented in the SMV proof assistant. The method is illustrated using Tomasulo’s algorithm for out-of-order instruction execution. An implementation is proved live for arbitrary resources using compositional model checking.
Chapter PDF
Similar content being viewed by others
References
http://www-cad.eecs.berkeley.edu/~kenmcmil/papers/1999-02.ps.gz,Feb. 1999.
M. Abadi and L. Lamport. Composing specifications. ACM Trans.on Prog.Lang. and Syst., 15(1):73–132,Jan. 1993.
R. Alur and T. A. Henzinger. Reactive modules. In 11th annual IEEE symp. Logic in Computer Science (LICS’ 96), 1996.
R. Alur, T. A. Henzinger, F. Mang, S. Qadeer, S. K. Rajamani, and S. Tasiran. Mocha:Modularity in model checking.In CAV’ 98, number 1427 LNCS, pages 521–525. Springer-Verlag.
L. Lamport. The temporal logic of actions. Research report 79,Digital Equipment Corporation, Systems Research Center, Dec. 1991.
K. L. McMillan. Verification of infinite state systems by compositional model checking. this volume.
K. L. McMillan. Verification of an implementation of Tomasulo’s algorithm by compositional model checking. In CAV’98,number 1427 in LNCS,pages 100–121. Springer-Verlag, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
McMillan, K.L. (1999). Circular Compositional Reasoning about Liveness. In: Pierre, L., Kropf, T. (eds) Correct Hardware Design and Verification Methods. CHARME 1999. Lecture Notes in Computer Science, vol 1703. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48153-2_30
Download citation
DOI: https://doi.org/10.1007/3-540-48153-2_30
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66559-5
Online ISBN: 978-3-540-48153-9
eBook Packages: Springer Book Archive