Abstract
Circular assume-guarantee reasoning is used for the compositional verification of concurrent systems. Its soundness has been studied in depth, perhaps because circularity makes it anything but obvious. In this paper, we investigate completeness. We show that compositional circular assume-guarantee rules cannot be both sound and complete.
Chapter PDF
Similar content being viewed by others
References
M. Abadi and L. Lamport. Conjoining specifications. ACM Transactions on Programming Languages and Systems, 17(3):507–534, 1995.
M. Abadi and S. Merz. An abstract account of composition. In MFCS, LNCS 969, pages 499–508. Springer, 1995.
B. Alpern and F. B. Schneider. Defining liveness. Information Processing Letters, 21:181–185, 1985.
R. Alur and T. A. Henzinger. Reactive modules. In LICS, pages 207–218. IEEE Computer Society, 1996.
E. A. Emerson. Modal and temporal logics. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, pages 135–191. Elsevier, 1990.
C. Flangan, S. N. Freund, and S. Qadeer. Thread-modular verification for sharedmemory programs. In ESOP, LNCS 2305, pages 262–277. Springer, 2002.
T. A. Henzinger, X. Liu, S. Qadeer, and S. K. Rajamani. Formal specification and verification of a dataflow processor array. In ICCAD, pages 494–499. IEEE Computer Society, 1999.
T. A. Henzinger, S. Qadeer, and S. K. Rajamani. You assume, we guarantee: Methodology and case studies. In CAV, LNCS 1427, pages 440–451. Springer, 1998.
T. A. Henzinger, S. Qadeer, S. K. Rajamani, and S. Tasiran. An assume-guarantee rule for checking simulation. ACM Transactions on Programming Languages and Systems, 24(1):51–64, 2002.
B. Jonsson and Y.-K. Tsay. Assumption/guarantee specifications in linear-time temporal logic. Theoretical Computer Science, 167(1–2):47–72, 1996.
P. Maier. A set-theoretic framework for assume-guarantee reasoning. In ICALP, LNCS 2076, pages 821–834. Springer, 2001.
P. Maier. A Lattice-Theoretic Framework For Circular Assume-Guarantee Reasoning. PhD thesis, Universität des Saarlandes, 2002. Submitted.
P. Maier. Compositional circular assume-guarantee rules cannot be sound and complete. Technical Report MPI-I-2003-2-001, Max-Planck-Institut für Informatik, 2003.
Z. Manna and A. Pnueli. Temporal Verification of Reactive Systems: Safety. Springer, 1995.
K. L. McMillan. Verification of an implementation of Tomasulo’s algorithm by compositional model checking. In CAV, LNCS 1427, pages 110–121. Springer, 1998.
K. L. McMillan. Circular compositional reasoning about liveness. In CHARME, LNCS 1703, pages 342–345. Springer, 1999.
J. Misra and K. M. Chandy. Proofs of networks of processes. IEEE Transactions on Software Engineering, 7(4):417–426, 1981.
K. S. Namjoshi and R. J. Trefler. On the completeness of compositional reasoning. In CAV, LNCS 1855, pages 139–153. Springer, 2000.
W. Thomas. Automata on infinite objects. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, pages 135–191. Elsevier, 1990.
M. Viswanathan and R. Viswanathan. Foundations for circular compositional reasoning. In ICALP, LNCS 2076, pages 835–847. Springer, 2001.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Maier, P. (2003). Compositional Circular Assume-Guarantee Rules Cannot Be Sound and Complete. In: Gordon, A.D. (eds) Foundations of Software Science and Computation Structures. FoSSaCS 2003. Lecture Notes in Computer Science, vol 2620. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36576-1_22
Download citation
DOI: https://doi.org/10.1007/3-540-36576-1_22
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00897-2
Online ISBN: 978-3-540-36576-1
eBook Packages: Springer Book Archive