{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:01:39Z","timestamp":1725483699321},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540678236"},{"type":"electronic","value":"9783540449294"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44929-9_40","type":"book-chapter","created":{"date-parts":[[2007,5,5]],"date-time":"2007-05-05T13:20:53Z","timestamp":1178371253000},"page":"580-595","source":"Crossref","is-referenced-by-count":3,"title":["Reasoning about Composition Using Property Transformers and Their Conjugates"],"prefix":"10.1007","author":[{"given":"Michel","family":"Charpentier","sequence":"first","affiliation":[]},{"given":"K.","family":"Mani Chandy","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,8,24]]},"reference":[{"issue":"1","key":"40_CR1","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1145\/151646.151649","volume":"15","author":"Mart\u00edn Abadi and Leslie Lamport","year":"1993","unstructured":"Mart\u00edn Abadi and Leslie Lamport. Composing specifications. ACM Transactions on Programming Languages and Systems, 15(1):73\u2013132, January 1993.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"3","key":"40_CR2","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1145\/203095.201069","volume":"17","author":"Mart\u00edn Abadi and Leslie Lamport. Conjoining speci_cations","year":"1995","unstructured":"Mart\u00edn Abadi and Leslie Lamport. Conjoining speci_cations. ACM Transactions on Programming Languages and Systems, 17(3):507\u2013534, May 1995.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"40_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1007\/3-540-60246-1_155","volume-title":"Mathematical Foundations of Computer Science","author":"M. Abadi","year":"1995","unstructured":"Mart\u00edn Abadi and Stephan Merz. An abstract account of composition. In Jivr\u00ed Wiedermann and Petr Hajek, editors, Mathematical Foundations of Computer Science, volume 969 of Lecture Notes in Computer Science, pages 499\u2013508. Springer-Verlag, September 1995."},{"issue":"1","key":"40_CR4","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0304-3975(93)90151-I","volume":"114","author":"Mart\u00edn Abadi and Gordon Plotkin","year":"1993","unstructured":"Mart\u00edn Abadi and Gordon Plotkin. A logical view of composition. Theoretical Computer Science, 114(1):3\u201330, June 1993.","journal-title":"Theoretical Computer Science"},{"key":"40_CR5","unstructured":"K. Mani Chandy and Beverly Sanders. Reasoning about program composition. Submitted for publication. \n                    http:\/\/www.cise.ufl.edu\/~sanders\/pubs\/composition.ps\n                    \n                  ."},{"key":"40_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"1215","DOI":"10.1007\/BFb0098004","volume-title":"International workshop on Formal Methods for Parallel Programming: Theory and Applications (FMPPTA\u201999)","author":"M. Charpentier","year":"1999","unstructured":"Michel Charpentier and K. Mani Chandy. Examples of program composition illustrating the use of universal properties. In J. Rolim, editor, International workshop on Formal Methods for Parallel Programming: Theory and Applications (FMPPTA\u201999), volume1586 of Lecture Notes in Computer Science, pages 1215\u20131227. Springer-Verlag, April 1999."},{"key":"40_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"570","DOI":"10.1007\/3-540-48119-2_32","volume-title":"World Congress on Formal Methods in the Development of Computing Systems (FM\u201999),(Vol. I)","author":"M. Charpentier","year":"1999","unstructured":"Michel Charpentier and K. Mani Chandy. Towards a compositional approach to the design and verification of distributed systems. In J. Wing, J. Woodcock, and J. Davies, editors, World Congress on Formal Methods in the Development of Computing Systems (FM\u201999),(Vol. I), volume1708 of Lecture Notes in Computer Science, pages 570\u2013589. Springer-Verlag, September 1999."},{"key":"40_CR8","unstructured":"Michel Charpentier and K. Mani Chandy. Theorems about composition. Technical Report CS-TR-99-02, California Institute of Technology, January 2000. 29 pages."},{"key":"40_CR9","unstructured":"Pierre Collette. Design of Compositional Proof Systems Based on Assumption-Commitment Specifications. Application to Unity. Doctoral thesis, Facult\u00e9 des Sciences Appliqu\u00e9s, Universit\u00e9 Catholique de Louvain, June 1994."},{"key":"40_CR10","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/0020-0190(94)90041-8","volume":"50","author":"P. Collette","year":"1994","unstructured":"Pierre Collette. An explanatory presentation of composition rules for assumption-commitment specifications. Information Processing Letters, 50:31\u201335, 1994.","journal-title":"Information Processing Letters"},{"key":"40_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/3-540-60043-4_64","volume-title":"International Conference on Algebraic Methodology and Software Technology","author":"P. Collette","year":"1995","unstructured":"Pierre Collette and Edgar Knapp. Logical foundations for compositional verification and development of concurrent programs in Unity. In International Conference on Algebraic Methodology and Software Technology, volume 936 of Lecture Notes in Computer Science, pages 353\u2013367. Springer-Verlag, 1995."},{"key":"40_CR12","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/S0304-3975(96)00327-1","volume":"183","author":"P. Collette","year":"1997","unstructured":"Pierre Collette and Edgar Knapp. A foundation for modular reasoning about safety and progress properties of state-based concurrent programs. Theoretical Computer Science, 183:253\u2013279, 1997.","journal-title":"Theoretical Computer Science"},{"key":"40_CR13","doi-asserted-by":"crossref","unstructured":"Edsger W. Dijkstra and Carel S. Scholten. Predicate calculus and program semantics. Texts and monographs in computer science. Springer-Verlag, 1990.","DOI":"10.1007\/978-1-4612-3228-5"},{"key":"40_CR14","unstructured":"J.L. Fiadeiro and T. Maibaum. Verifying for reuse: foundations of object-oriented system verification. In I. Makie C. Hankin and R. Nagarajan, editors, Theory and Formal Methods, pages 235\u2013257. World Scientific Publishing Company, 1995."},{"key":"40_CR15","doi-asserted-by":"crossref","unstructured":"Zohar Manna and Amir Pnueli. The Temporal Logic of Reactive and Concurrent Systems: Specification. Springer-Verlag, 1992.","DOI":"10.1007\/978-1-4612-0931-7"},{"key":"40_CR16","unstructured":"Rob T. Udink. Program Refinement in\n                  UNITY-like Environments. PhD thesis, Utrecht University, September 1995."}],"container-title":["Lecture Notes in Computer Science","Theoretical Computer Science: Exploring New Frontiers of Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44929-9_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T15:15:42Z","timestamp":1550330142000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44929-9_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540678236","9783540449294"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-44929-9_40","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}