Compositional circular assume-guarantee rules cannot be sound and complete

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2620, Issue , 2003, Pages 343-357

  Maier, Patrick ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY;

ASSUME-GUARANTEE REASONING; COMPOSITIONAL VERIFICATION; CONCURRENT SYSTEMS; SOUND AND COMPLETE;

MODEL CHECKING;

EID: 24644463797     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36576-1_22     Document Type: Article

References (20)

1. M. Abadi and L. Lamport. Conjoining specifications. ACM Transactions on Programming Languages and Systems, 17(3):507-534, 1995.
2. M. Abadi and S. Merz. An abstract account of composition. In MFCS, LNCS 969, pages 499-508. Springer, 1995.
3. B. Alpern and F. B. Schneider. Denning liveness. Information Processing Letters, 21:181-185, 1985.
4. R. Alur and T. A. Henzinger. Reactive modules. In LICS, pages 207-218. IEEE Computer Society, 1996.
5. E. A. Emerson. Modal and temporal logics. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, pages 135-191. Elsevier, 1990.
6. C. Flangan, S. N. Freund, and S. Qadeer. Thread-modular verification for shared-memory programs. In ESOP, LNCS 2305, pages 262-277. Springer, 2002.
7. 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.
8. 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.
9. 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.
10. B. Jonsson and Y.-K. Tsay. Assumption/guarantee specifications in linear-time temporal logic. Theoretical Computer Science, 167(1-2):47-72, 1996.
11. P. Maier. A set-theoretic framework for assume-guarantee reasoning. In ICALP, LNCS 2076, pages 821-834. Springer, 2001.
12. P. Maier. A Lattice-Theoretic framework For Circular Assume-Guarantee Reasoning. PhD thesis, Universität des Saarlandes, 2002. Submitted.
13. 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.
14. Z. Manna and A. Pnueli. Temporal Verification of Reactive Systems: Safety. Springer, 1995.
15. K. L. McMillan. Verification of an implementation of Tomasulo's algorithm by compositional model checking. In CAV, LNCS 1427, pages 110-121. Springer, 1998.
16. K. L. McMillan. Circular compositional reasoning about liveness. In CHARME, LNCS 1703, pages 342-345. Springer, 1999.
17. J. Misra and K. M. Chandy. Proofs of networks of processes. IEEE Transactions on Software Engineering, 7(4):417-426, 1981.
18. K. S. Namjoshi and R. J. Trefler. On the completeness of compositional reasoning. In CAV, LNCS 1855, pages 139-153. Springer, 2000.
19. W. Thomas. Automata on infinite objects. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, pages 135-191. Elsevier, 1990.
20. M. Viswanathan and R. Viswanathan. Foundations for circular compositional reasoning. In ICALP, LNCS 2076, pages 835-847. Springer, 2001.