Abstract
Several proof rules based on the assume-guarantee paradigm have been proposed for compositional reasoning about concurrent systems. Some of the rules are syntactically circular in nature, in that assumptions and guarantees appear to be circularly dependent. While these rules are sound, we show that several such rules are incomplete, i.e., there are true properties of a composition that cannot be deduced using these rules. We present a new sound and complete circular rule. We also show that circular and non-circular rules are closely related. For the circular rules defined here, proofs with circular rules can be efficiently transformed to proofs with non-circular rules and vice versa.
Chapter PDF
Similar content being viewed by others
References
Alur, R., Henzinger, T.: Reactive modules. In: IEEE LICS (1996)
Abadi, M., Lamport, L.: Conjoining specifications. ACM Trans. on Programming Languages and Systems, TOPLAS (May 1995)
Clarke, E.M., Emerson, E.A.: Design and synthesis of synchronization skeletons using branching time temporal logic. In: Kozen, D. (ed.) Logic of Programs 1981. LNCS, vol. 131. Springer, Heidelberg (1982)
Clarke, E.M., Emerson, E.A., Sistla, A.P.: Automatic verification of finite-state concurrent systems using temporal logic. ACM Transactions on Programming Languages and Systems (TOPLAS) 8(2) (1986)
Clarke, E.M., Long, D.E., McMillan, K.L.: Compositional model checking. In: IEEE LICS (1989)
Chandy, K.M., Misra, J.: Proofs of networks of processes. IEEE Transactions on Software Engineering 7(4) (1981)
de Roever, W.-P., de Boer, F., Hannemann, U., Hooman, J., Lakhnech, Y., Poel, M., Zwiers, J.: Concurrency Verification: Introduction to Compositional and Noncompositional Proof Methods. Draft book (1999)
de Roever, W.-P., Langmaack, H., Pnueli, A. (eds.): COMPOS 1997. LNCS, vol. 1536. Springer, Heidelberg (1998)
Grümberg, O., Long, D.E.: Model checking and modular verification. ACM Trans. on Programming Languages and Systems, TOPLAS (1994)
Hoare, C.A.R.: An axiomatic basis for computer programming. Communications of the ACM (1969)
Harel, D., Pnueli, A.: On the development of reactive systems. In: Apt, K. (ed.) Logics and Models of Concurrent Systems. NATO Advanced Summer Institutes, vol. F-13, pp. 477–498. Springer, Heidelberg (1985)
Henzinger, T.A., Qadeer, S., Rajamani, S.K., Taşıran, S.: An assume-guarantee rule for checking simulation. In: Gopalakrishnan, G.C., Windley, P. (eds.) FMCAD 1998. LNCS, vol. 1522, pp. 421–431. Springer, Heidelberg (1998)
Jones, C.B.: Development methods for computer programs including a notion of interference. PhD thesis, Oxford University (1981)
Josko, B.: Model checking of CTL formulae under liveness assumptions. In: Ottmann, T. (ed.) ICALP 1987. LNCS, vol. 267. Springer, Heidelberg (1987)
Kurshan, R.P.: Reducibility in analysis of coordination. In: Ledgard, H., Whiteside, J., Singer, A. (eds.) Directions in Human Factors for Interactive Systems. LNCS, vol. 103, Springer, Heidelberg (1981)
Kupferman, O., Vardi, M.: On the complexity of branching modular model checking. In: Lee, I., Smolka, S.A. (eds.) CONCUR 1995. LNCS, vol. 962. Springer, Heidelberg (1995)
Kupferman, O., Vardi, M.: Module checking revisited. In: Grumberg, O. (ed.) CAV 1997. LNCS, vol. 1254. Springer, Heidelberg (1997)
Lichtenstein, O., Pnueli, A., Zuck, L.: The glory of the past. In: Proc. of the Conf. on Logics of Programs (1985)
McMillan, K.L.: A compositional rule for hardware design refinement. In: Grumberg, O. (ed.) CAV 1997. LNCS, vol. 1254. Springer, Heidelberg (1997)
McMillan, K.L.: Verification of an implementation of Tomasulo’s algorithm by compositional model checking. In: Y. Vardi, M. (ed.) CAV 1998. LNCS, vol. 1427. Springer, Heidelberg (1998)
McMillan, K.L.: Circular compositional reasoning about liveness. In: Pierre, L., Kropf, T. (eds.) CHARME 1999. LNCS, vol. 1703, pp. 342–346. Springer, Heidelberg (1999)
Manna, Z., Pnueli, A.: Adequate proof principles for invariance and liveness properties of concurrent programs. Science of Computer Programming (1984)
Manna, Z., Pnueli, A.: Temporal Verfication of Reactive Systems: Safety. Springer, Heidelberg (1995)
Pandya, P.: Compositional Verification of Distributed Programs. PhD thesis, University of Bombay (1988)
Pandya, P., Joseph, M.: P-A logic - a compositional proof system for distributed programs. Distributed Computing (1991)
Pnueli, A.: The temporal logic of programs. In: FOCS (1977)
Pnueli, A.: In transition from global to modular reasoning about programs. In: Logics and Models of Concurrent Systems. NATO ASI Series (1985)
Queille, J.P., Sifakis, J.: Specification and verification of concurrent systems in CESAR. In: Dezani-Ciancaglini, M., Montanari, U. (eds.) Programming 1982. LNCS, vol. 137. Springer, Heidelberg (1982)
Stark, E.: A proof technique for rely/guarantee properties. In: Maheshwari, S.N. (ed.) FSTTCS 1985. LNCS, vol. 206. Springer, Heidelberg (1985)
Thomas, W.: Automata on infinite objects. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science. Formal Models and Semantics, vol. B. Elsevier and MIT Press (1990)
Vardi, M., Wolper, P.: An automata-theoretic approach to automatic program verification. In: IEEE Symposium on Logic in Computer Science (1986)
Zwiers, J., de Roever, W.P., van EmdeBoas, P.: Compositionality and concurrent networks: Soundness and completeness of a proof system. Technical Report, University of Nijmegen (1984)
Zwiers, J. (ed.): Compositionality, Concurrency, and Partial Correctness. LNCS, vol. 321. Springer, Heidelberg (1989)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Namjoshi, K.S., Trefler, R.J. (2000). On the Completeness of Compositional Reasoning. In: Emerson, E.A., Sistla, A.P. (eds) Computer Aided Verification. CAV 2000. Lecture Notes in Computer Science, vol 1855. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10722167_14
Download citation
DOI: https://doi.org/10.1007/10722167_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67770-3
Online ISBN: 978-3-540-45047-4
eBook Packages: Springer Book Archive