{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T00:10:01Z","timestamp":1737504601111,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540422877"},{"type":"electronic","value":"9783540482246"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-48224-5_67","type":"book-chapter","created":{"date-parts":[[2007,10,28]],"date-time":"2007-10-28T06:29:04Z","timestamp":1193552944000},"page":"821-834","source":"Crossref","is-referenced-by-count":9,"title":["A Set-Theoretic Framework for Assume-Guarantee Reasoning"],"prefix":"10.1007","author":[{"given":"Patrick","family":"Maier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,7,4]]},"reference":[{"issue":"3","key":"67_CR1","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1145\/203095.201069","volume":"17","author":"M. Abadi","year":"1995","unstructured":"Mart\u00edn Abadi and Leslie Lamport. Conjoining specifications. ACM Transactions on Programming Languages and Systems, 17(3):507\u2013534, 1995.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"1","key":"67_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0304-3975(93)90151-I","volume":"114","author":"M. Abadi","year":"1993","unstructured":"Mart\u00edn Abadi and Gordon D. Plotkin. A logical view of composition. Theoretical Computer Science, 114(1):3\u201330, 1993.","journal-title":"Theoretical Computer Science"},{"key":"67_CR3","doi-asserted-by":"crossref","unstructured":"Rajeev Alur and Thomas A. Henzinger. Reactive modules. In Proc. 11th Annual Symposium On Logic In Computer Science, pages 207\u2013218, 1996.","DOI":"10.1109\/LICS.1996.561320"},{"key":"67_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/3-540-49059-0_16","volume-title":"TACAS\u201999: Tools and Algorithms for the Construction and Analysis of Systems","author":"G. Delzanno","year":"1999","unstructured":"Giorgio Delzanno and Andreas Podelski. Model checking in clp. In TACAS\u201999: Tools and Algorithms for the Construction and Analysis of Systems, Springer LNCS 1579, pages 223\u2013239, 1999."},{"key":"67_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/3-540-49519-3_27","volume-title":"FMCAD\u201998: Formal methods in computer-aided design","author":"T. A. Henzinger","year":"1998","unstructured":"Thomas A. Henzinger, Shaz Qadeer, Sriram K. Rajamani, and Serdar Tasiran. An assume-guarantee rule for checking simulation. In FMCAD\u201998: Formal methods in computer-aided design, Springer LNCS 1522, pages 421\u2013432, 1998."},{"issue":"1-2","key":"67_CR6","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0304-3975(96)00069-2","volume":"167","author":"B. Jonsson","year":"1996","unstructured":"Bengt Jonsson and Yih-Kuen Tsay. Assumption\/guarantee specifications in linear-time temporal logic. Theoretical Computer Science, 167(1-2):47\u201372, 1996.","journal-title":"Theoretical Computer Science"},{"key":"67_CR7","doi-asserted-by":"crossref","unstructured":"Robert P. Kurshan. Computer-aided verification of coordinating processes. Princeton University Press, 1994.","DOI":"10.1515\/9781400864041"},{"key":"67_CR8","doi-asserted-by":"crossref","unstructured":"Patrick Maier. A set-theoretic framework for assume-guarantee reasoning. Technical Report MPI-I-2001-2-002, Max-Planck-Institut f\u00fcr Informatik, 2001.","DOI":"10.1007\/3-540-48224-5_67"},{"key":"67_CR9","series-title":"Lect Notes Comput Sci","first-page":"207","volume-title":"CAV\u201997: Computer aided verification","author":"K. L. McMillan","year":"1997","unstructured":"K. L. McMillan. A compositional rule for hardware design refinement. In CAV\u201997: Computer aided verification, Springer LNCS 1254, pages 207\u2013218, 1997."},{"issue":"4","key":"67_CR10","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1109\/TSE.1981.230844","volume":"7","author":"J. Misra","year":"1981","unstructured":"Jayadev Misra and K. Mani Chandy. Proofs of networks of processes. IEEE Transactions on Software Engineering, 7(4):417\u2013426, 1981.","journal-title":"IEEE Transactions on Software Engineering"},{"key":"67_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1007\/978-3-540-45099-3_2","volume-title":"SAS 2000: Static Analysis","author":"A. Podelski","year":"2000","unstructured":"Andreas Podelski. Model checking as constraint solving. In SAS 2000: Static Analysis, Springer LNCS 1824, pages 22\u201337, 2000."},{"key":"67_CR12","doi-asserted-by":"crossref","unstructured":"Sriram K. Rajamani and Jakob Rehof. A behavioral module system for the \u03c0-calculus. In SAS\u201901: Static Analysis, 2001. To appear.","DOI":"10.1007\/3-540-47764-0_22"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48224-5_67","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T23:49:38Z","timestamp":1737503378000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48224-5_67"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540422877","9783540482246"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-48224-5_67","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}