{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T12:58:45Z","timestamp":1760014725847},"publisher-location":"Berlin, Heidelberg","reference-count":17,"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_68","type":"book-chapter","created":{"date-parts":[[2007,10,28]],"date-time":"2007-10-28T02:29:04Z","timestamp":1193538544000},"page":"835-847","source":"Crossref","is-referenced-by-count":12,"title":["Foundations for Circular Compositional Reasoning"],"prefix":"10.1007","author":[{"given":"Mahesh","family":"Viswanathan","sequence":"first","affiliation":[]},{"given":"Ramesh","family":"Viswanathan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,7,4]]},"reference":[{"issue":"1","key":"68_CR1","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1145\/151646.151649","volume":"15","author":"M. Abadi","year":"1993","unstructured":"M. Abadi, and L. Lamport. Composing Specifications. ACM Transactions on Programming Languages and Systems, 15(1):73\u2013132, 1993.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"3","key":"68_CR2","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1145\/203095.201069","volume":"17","author":"M. Abadi","year":"1995","unstructured":"M. Abadi, and L. Lamport. Conjoining Specifications. ACM Transactions on Programming Languages and Systems, 17(3):507\u2013534, 1995.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"68_CR3","doi-asserted-by":"crossref","unstructured":"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\u2013179, 1995.","DOI":"10.1007\/3-540-60045-0_49"},{"key":"68_CR4","doi-asserted-by":"crossref","unstructured":"R. Alur, and T. A. Henzinger. Reactive Modules. In Proceedings of the IEEE Symposium on Logic in Computer Science, pages 207\u2013218, 1996.","DOI":"10.1109\/LICS.1996.561320"},{"key":"68_CR5","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/s002360050039","volume":"33","author":"A. Cau","year":"1996","unstructured":"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\u2013176, 1996.","journal-title":"Acta Informatica"},{"issue":"3","key":"68_CR6","doi-asserted-by":"publisher","first-page":"843","DOI":"10.1145\/177492.177725","volume":"16","author":"O. Grumberg","year":"1994","unstructured":"O. Grumberg, and D. E. Long. Model checking and modular verification. ACM Transactions on Programming Languages and Systems, 16(3):843\u2013871, 1994. Earlier version in Proceedings of CONCUR 91: Concurrency Theory, 1991.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"68_CR7","doi-asserted-by":"crossref","unstructured":"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\u2013432, 1998.","DOI":"10.1007\/3-540-49519-3_27"},{"issue":"4","key":"68_CR8","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1145\/69575.69577","volume":"5","author":"C. B. Jones","year":"1983","unstructured":"C. B. Jones. Tentative steps towards a development method for infering programs. ACM Transactions on Programming Languages and Systems, 5(4):596\u2013619, 1983.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"68_CR9","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0304-3975(96)00069-2","volume":"167","author":"B. Jonsson","year":"1996","unstructured":"B. Jonsson, and Y.-K. Tsay. Assumption\/guarantee specifications in linear-time temporal logic. Theoretical Computer Science, 167:47\u201372, 1996","journal-title":"Theoretical Computer Science"},{"key":"68_CR10","doi-asserted-by":"crossref","unstructured":"R. P. Kurshan. Computer-aided Verification of Coordinating Processes. Princeton University Press, 1994.","DOI":"10.1515\/9781400864041"},{"key":"68_CR11","doi-asserted-by":"crossref","unstructured":"K. McMillan. A compositional rule for hardware design refinement. In Proceedings of the Conference on Computer-Aided Verification, pages 24\u201335, 1997.","DOI":"10.1007\/3-540-63166-6_6"},{"key":"68_CR12","doi-asserted-by":"crossref","unstructured":"K. McMillan. Circular compositional reasoning about liveness. In CHARME 99: Correct Hardware Design and Verification, pages 342\u2013345, 1999.","DOI":"10.1007\/3-540-48153-2_30"},{"issue":"4","key":"68_CR13","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1109\/TSE.1981.230844","volume":"SE-7","author":"J. Misra","year":"1981","unstructured":"J. Misra, and K. M. Chandy. Proofs of network processes. IEEE Transactions on Software Engineering, SE-7(4):417\u2013426, 1981.","journal-title":"IEEE Transactions on Software Engineering"},{"key":"68_CR14","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/BF02311231","volume":"5","author":"P. K. Pandya","year":"1991","unstructured":"P. K. Pandya, and M. Joseph. P-A logic \u2014 A compositional proof system for distributed programs. Distributed Computing, 5:37\u201354, 1991.","journal-title":"Distributed Computing"},{"key":"68_CR15","doi-asserted-by":"crossref","unstructured":"A. Pnueli. In transition from global to modular temporal reasoning about programs. In Logics and Models of Concurrent Systems, pages 123\u2013144, 1984.","DOI":"10.1007\/978-3-642-82453-1_5"},{"key":"68_CR16","doi-asserted-by":"crossref","unstructured":"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\u2013391, 1985.","DOI":"10.1007\/3-540-16042-6_21"},{"key":"68_CR17","doi-asserted-by":"crossref","first-page":"285","DOI":"10.2140\/pjm.1955.5.285","volume":"5","author":"A. Tarski","year":"1955","unstructured":"A. Tarski. A lattice-theoretical fixpoint theorem and its applications. Pacific Journal of Mathematics, 5:285\u2013309, 1955.","journal-title":"Pacific Journal of Mathematics"}],"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_68","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T22:27:53Z","timestamp":1556922473000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48224-5_68"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540422877","9783540482246"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-48224-5_68","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}