{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T18:18:50Z","timestamp":1726424330417},"reference-count":26,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1997,9,1]],"date-time":"1997-09-01T00:00:00Z","timestamp":873072000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5798,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1997,9]]},"DOI":"10.1016\/s0304-3975(96)00327-1","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T23:53:40Z","timestamp":1051142020000},"page":"253-279","source":"Crossref","is-referenced-by-count":9,"title":["A foundation for modular reasoning about safety and progress properties of state-based concurrent programs"],"prefix":"10.1016","volume":"183","author":[{"given":"Pierre","family":"Collette","sequence":"first","affiliation":[]},{"given":"Edgar","family":"Knapp","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(96)00327-1_BIB1","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/0304-3975(91)90224-P","article-title":"The existence of refinement mappings","volume":"82","author":"Abadi","year":"1991","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(96)00327-1_BIB2","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1145\/151646.151649","article-title":"Composing specifications","volume":"15","author":"Abadi","year":"1993","journal-title":"ACM Trans. Programming Languages Systems"},{"key":"10.1016\/S0304-3975(96)00327-1_BIB3","series-title":"Program Design Calculi","first-page":"53","article-title":"Refinements calculus, lattices and higher order logic","author":"Back","year":"1993"},{"key":"10.1016\/S0304-3975(96)00327-1_BIB4","series-title":"16th Ann. ACM Symp. on Theory of Computing, ACM","first-page":"51","article-title":"Now you may compose temporal logic specifications","author":"Barringer","year":"1984"},{"year":"1988","series-title":"Parallel Program Design \u2014 A Foundation","author":"Chandy","key":"10.1016\/S0304-3975(96)00327-1_BIB5"},{"key":"10.1016\/S0304-3975(96)00327-1_BIB6","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0167-6423(94)00033-B","article-title":"Predicate transformers for reasoning about concurrent computation","volume":"24","author":"Chandy","year":"1995","journal-title":"Sci. Comput. Programming"},{"key":"10.1016\/S0304-3975(96)00327-1_BIB7","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/0167-6423(94)00017-4","article-title":"Composition of assumption-commitment specifications in a UNITY style","volume":"23","author":"Collette","year":"1994","journal-title":"Sci. Comput. Programming"},{"article-title":"Design of compositional proof systems based on assumption-commitment specifications \u2014 application to UNITY","year":"1994","author":"Collette","key":"10.1016\/S0304-3975(96)00327-1_BIB8"},{"key":"10.1016\/S0304-3975(96)00327-1_BIB9","series-title":"Algebraic Methodology and Software Technology","first-page":"353","article-title":"Logical foundations for compositional verification and development of concurrent programs in UNITY","volume":"vol. 936","author":"Collette","year":"1995"},{"year":"1990","series-title":"Predicate Calculus and Program Semantics","author":"Dijkstra","key":"10.1016\/S0304-3975(96)00327-1_BIB10"},{"key":"10.1016\/S0304-3975(96)00327-1_BIB11","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/BF01211214","article-title":"DUALITY: a simple formalism for the analysis of UNITY","volume":"7","author":"Dijkstra","year":"1995","journal-title":"Formal Aspects Comput."},{"article-title":"Development methods for computer programs including a notion of interference","year":"1981","author":"Jones","key":"10.1016\/S0304-3975(96)00327-1_BIB12"},{"key":"10.1016\/S0304-3975(96)00327-1_BIB13","series-title":"8th Ann. ACM Symp. on Principles of Distributed Computing, ACM","first-page":"249","article-title":"A predicate transformer approach to the semantics of parallel programs","author":"Jutla","year":"1989"},{"key":"10.1016\/S0304-3975(96)00327-1_BIB14","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1007\/BF01178381","article-title":"Invariants, composition, and substitution","volume":"32","author":"Kindler","year":"1995","journal-title":"Acta Inform."},{"key":"10.1016\/S0304-3975(96)00327-1_BIB15","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/0020-0190(90)90218-M","article-title":"A predicate transformer for progress","volume":"33","author":"Knapp","year":"1990","journal-title":"Inform. Processing Lett."},{"key":"10.1016\/S0304-3975(96)00327-1_BIB16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0167-6423(92)90002-S","article-title":"Derivation of concurrent programs: two examples","volume":"19","author":"Knapp","year":"1992","journal-title":"Sci. Comput. Programming"},{"key":"10.1016\/S0304-3975(96)00327-1_BIB17","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1145\/78969.78970","article-title":"Win and sin: predicate transformers for concurrency","volume":"12","author":"Lamport","year":"1990","journal-title":"ACM Trans. Programming Languages Systems"},{"key":"10.1016\/S0304-3975(96)00327-1_BIB18","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1109\/TSE.1981.230844","article-title":"Proofs of networks of processes","volume":"7","author":"Misra","year":"1981","journal-title":"IEEE Trans. Software Eng."},{"key":"10.1016\/S0304-3975(96)00327-1_BIB19","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0304-3975(94)00206-X","article-title":"On using temporal logic for refinement and compositional verification of concurrent systems","volume":"140","author":"Mokkedem","year":"1995","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(96)00327-1_BIB20","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/BF02311231","article-title":"P-A logic \u2014 a compositional proof system for distributed programs","volume":"5","author":"Pandya","year":"1991","journal-title":"Distributed Comput."},{"key":"10.1016\/S0304-3975(96)00327-1_BIB21","series-title":"Logics and Models of Concurrent Systems","first-page":"123","article-title":"In transition from global to modular reasoning about programs","author":"Pnueli","year":"1985"},{"key":"10.1016\/S0304-3975(96)00327-1_BIB22","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/BF01898402","article-title":"Eliminating the substitution axiom from UNITY logic","volume":"3","author":"Sanders","year":"1991","journal-title":"Formal Aspects Comput."},{"key":"10.1016\/S0304-3975(96)00327-1_BIB23","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1109\/32.232015","article-title":"Formal derivation of concurrent programs: an example from industry","volume":"19","author":"Staskauskas","year":"1993","journal-title":"IEEE Trans. Software Eng."},{"key":"10.1016\/S0304-3975(96)00327-1_BIB24","series-title":"CONCUR'91: 2nd Internat. Conf. on Concurrency Theory","first-page":"510","article-title":"A method for the development of totally correct shared-state parallel programs","volume":"vol. 527","author":"St\u00f8len","year":"1991"},{"article-title":"Program refinement in UNITY-like environments","year":"1995","author":"Udink","key":"10.1016\/S0304-3975(96)00327-1_BIB25"},{"key":"10.1016\/S0304-3975(96)00327-1_BIB26","article-title":"Compositionality, Concurrency, and Partial Correctness","volume":"vol. 321","author":"Zwiers","year":"1989"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397596003271?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397596003271?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T12:58:57Z","timestamp":1555419537000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397596003271"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,9]]},"references-count":26,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1997,9]]}},"alternative-id":["S0304397596003271"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(96)00327-1","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[1997,9]]}}}