{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:08:24Z","timestamp":1725664104104},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540600435"},{"type":"electronic","value":"9783540494102"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60043-4_64","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:33:14Z","timestamp":1330277594000},"page":"353-367","source":"Crossref","is-referenced-by-count":11,"title":["Logical foundations for compositional verification and development of concurrent programs in UNITY"],"prefix":"10.1007","author":[{"given":"Pierre","family":"Collette","sequence":"first","affiliation":[]},{"given":"Edgar","family":"Knapp","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,7,25]]},"reference":[{"key":"22_CR1","doi-asserted-by":"crossref","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:73\u2013132, 1993.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"22_CR2","unstructured":"M. Abadi and L. Lamport, Decomposing specifications of concurrent systems, in E.R. Olderog, ed., Proc. IFIP Conference on Programming Concepts, Methods and Calculi, 1994, pp. 323\u2013336."},{"key":"22_CR3","doi-asserted-by":"crossref","unstructured":"H. Barringer, R. Kuiper, and A. Pnueli, Now you may compose temporal logic specifications, in Proc. 16th ACM Symposium on Theory of Computing, 1984, pp. 51\u201363.","DOI":"10.1145\/800057.808665"},{"key":"22_CR4","doi-asserted-by":"crossref","unstructured":"K.M. Chandy and J. Misra, Parallel Program Design: a Foundation, Addison-Wesley, 1988.","DOI":"10.1007\/978-1-4613-9668-0_6"},{"key":"22_CR5","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/0167-6423(94)00017-4","volume":"23","author":"P. Collette","year":"1994","unstructured":"P. Collette, Composition of assumption-commitment specifications in a UNITY style, Science of Computer Programming, 23:107\u2013125, 1994.","journal-title":"Science of Computer Programming"},{"key":"22_CR6","unstructured":"P. Collette, Design of Compositional Proof Systems Based on Assumption-Commitment Specifications \u2014 Application to UNITY, Ph.D. Thesis, 1994, Universit\u00e9 Catholique de Louvain."},{"key":"22_CR7","unstructured":"C.B. Jones, Development Methods for Computer Programs Including a Notion of Interference, Ph.D. Thesis, 1981, Oxford University."},{"key":"22_CR8","doi-asserted-by":"crossref","unstructured":"C.S. Jutla, E. Knapp, and J.R. Rao, A predicate transformer approach to the semantics of parallel programs, Proc. 8th ACM Symposium on Principles of Distributed Computing, 1989, pp. 249\u2013263.","DOI":"10.1145\/72981.72999"},{"key":"22_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0167-6423(92)90002-S","volume":"19","author":"E. Knapp","year":"1992","unstructured":"E. Knapp, Derivation of concurrent programs: two examples, Science of Computer Programming, 19:1\u201323, 1992.","journal-title":"Science of Computer Programming"},{"key":"22_CR10","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1145\/78969.78970","volume":"12","author":"L. Lamport","year":"1990","unstructured":"L. Lamport, win and sin: predicate transformers for concurrency, ACM Transactions on Programming Languages and Systems, 1990, 12:396\u2013428, 1990.","journal-title":"ACM Transactions on Programming Languages and Systems, 1990"},{"key":"22_CR11","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1109\/TSE.1981.230844","volume":"7","author":"J. Misra","year":"1981","unstructured":"J. Misra and K.M. Chandy, Proofs of networks of processes, IEEE Transactions on Software Engineering, 7:417\u2013426, 1981.","journal-title":"IEEE Transactions on Software Engineering"},{"key":"22_CR12","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0304-3975(94)00206-X","volume":"140","author":"A. Mokkedem","year":"1995","unstructured":"A. Mokkedem and D. M\u00e9ry, On using temporal logic for refinement and compositional verification of concurrent systems, Theoretical Computer Science, 140:95\u2013138,1995.","journal-title":"Theoretical Computer Science"},{"key":"22_CR13","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/BF00268134","volume":"6","author":"S. Owicki","year":"1976","unstructured":"S. Owicki and D. Gries, An axiomatic proof technique for parallel programs, Acta Informatica, 6:319\u2013340, 1976.","journal-title":"Acta Informatica"},{"key":"22_CR14","doi-asserted-by":"crossref","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":"22_CR15","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/BF01898402","volume":"3","author":"B. Sanders","year":"1991","unstructured":"B. Sanders, Eliminating the substitution axiom from UNITY logic, Formal Aspects of Computing, 3:189\u2013205, 1991.","journal-title":"Formal Aspects of Computing"},{"key":"22_CR16","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1109\/32.232015","volume":"19","author":"M. Staskauskas","year":"1993","unstructured":"M. Staskauskas, Formal derivation of concurrent programs: an example from industry, IEEE Transactions on Software Engineering, 19:503\u2013528, 1993.","journal-title":"IEEE Transactions on Software Engineering"},{"key":"22_CR17","doi-asserted-by":"crossref","unstructured":"K. St\u00f8len, A method for the development of totally correct shared-state parallel programs, in J.C.M. Baeten and J.F. Groote, eds., Concurrency Theory, Springer-Verlag, 1991, LNCS 527, pp. 510\u2013525.","DOI":"10.1007\/3-540-54430-5_110"},{"key":"22_CR18","unstructured":"R.T. Udink, T. Herman, and J.N. Kok, Progress for local variables in UNITY, in E.R. Olderog, ed., Proc. IFIP Conference on Programming Concepts, Methods and Calculi, 1994, pp. 124\u2013143."},{"key":"22_CR19","doi-asserted-by":"crossref","unstructured":"Q. Xu and J. He, A theory of state-based parallel programming: part I, in J. Morris and R.C. Shaw, eds., Proc. 4th Refinement Workshop, Springer-Verlag, 1991, pp. 326\u2013359.","DOI":"10.1007\/978-1-4471-3756-6_15"},{"key":"22_CR20","unstructured":"J. Zwiers, Compositionality, Concurrency, and Partial Correctness, Springer-Verlag, 1989, LNCS 321."}],"container-title":["Lecture Notes in Computer Science","Algebraic Methodology and Software Technology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60043-4_64.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:28:29Z","timestamp":1605648509000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60043-4_64"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540600435","9783540494102"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-60043-4_64","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}