Abstract
Compositional proofs about systems of many components require circular reasoning principles in which properties of other components need to be assumed in proving the properties of each individual component. A number of such circular assume-guarantee rules have been proposed for different concurrency models and different forms of property specifications. In this paper, we provide a framework that unifies and extends these results. We define an assume-guarantee semantics for properties expressible as least or greatest fixed points, and a circular compositional rule that is sound with respect to this semantics. We demonstrate the utility of this general rule by applying it to trace semantics with linear temporal logic specifications, and trace tree semantics with automata refinement specifications. For traces, we derive a new assume-guarantee rule for the “weakly until” operator of linear temporal logic and show that previously proposed assume-guarantee rules can be seen as special instances of our rule. For trace trees, we derive a rule for parallel composition of Moore machines, and show that the rule of [7] is a special instance thus yielding an alternate proof of the results in [7].
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
M. Abadi, and L. Lamport. Composing Specifications. ACM Transactions on Programming Languages and Systems, 15(1):73–132, 1993.
M. Abadi, and L. Lamport. Conjoining Specifications. ACM Transactions on Programming Languages and Systems, 17(3):507–534, 1995.
R. Alur, and T. A. Henzinger. Local liveness for compositional modeling of fair reactive systems. In Proceedings of the Conference on Computer-Aided Verification, pages 166–179, 1995.
R. Alur, and T. A. Henzinger. Reactive Modules. In Proceedings of the IEEE Symposium on Logic in Computer Science, pages 207–218, 1996.
A. Cau, and P. Collette. Parallel composition of assumption-commitment specifications: A unifying approach for shared variable and distributed message passing concurrency. Acta Informatica, 33:153–176, 1996.
O. Grumberg, and D. E. Long. Model checking and modular verification. ACM Transactions on Programming Languages and Systems, 16(3):843–871, 1994. Earlier version in Proceedings of CONCUR 91: Concurrency Theory, 1991.
T. A. Henzinger, S. Qadeer, S. K. Rajamani, and S. Tasiran. An assume-guarantee rule for checking simulation. In FMCAD 98: Formal Methods in Computer-aided Design, pages 421–432, 1998.
C. B. Jones. Tentative steps towards a development method for infering programs. ACM Transactions on Programming Languages and Systems, 5(4):596–619, 1983.
B. Jonsson, and Y.-K. Tsay. Assumption/guarantee specifications in linear-time temporal logic. Theoretical Computer Science, 167:47–72, 1996
R. P. Kurshan. Computer-aided Verification of Coordinating Processes. Princeton University Press, 1994.
K. McMillan. A compositional rule for hardware design refinement. In Proceedings of the Conference on Computer-Aided Verification, pages 24–35, 1997.
K. McMillan. Circular compositional reasoning about liveness. In CHARME 99: Correct Hardware Design and Verification, pages 342–345, 1999.
J. Misra, and K. M. Chandy. Proofs of network processes. IEEE Transactions on Software Engineering, SE-7(4):417–426, 1981.
P. K. Pandya, and M. Joseph. P-A logic — A compositional proof system for distributed programs. Distributed Computing, 5:37–54, 1991.
A. Pnueli. In transition from global to modular temporal reasoning about programs. In Logics and Models of Concurrent Systems, pages 123–144, 1984.
E. W. Stark. A proof technique for rely-guarantee properties In Proceedings of the Conference on the Foundations of Software Technology and Theoretical Computer Science, pages 369–391, 1985.
A. Tarski. A lattice-theoretical fixpoint theorem and its applications. Pacific Journal of Mathematics, 5:285–309, 1955.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Viswanathan, M., Viswanathan, R. (2001). Foundations for Circular Compositional Reasoning. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds) Automata, Languages and Programming. ICALP 2001. Lecture Notes in Computer Science, vol 2076. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48224-5_68
Download citation
DOI: https://doi.org/10.1007/3-540-48224-5_68
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42287-7
Online ISBN: 978-3-540-48224-6
eBook Packages: Springer Book Archive