{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:27:23Z","timestamp":1725456443643},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540634409"},{"type":"electronic","value":"9783540695493"}],"license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0002777","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T12:29:42Z","timestamp":1132748982000},"page":"511-520","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Synchronising asynchronous communications"],"prefix":"10.1007","author":[{"given":"A.","family":"Stewart","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Clint","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,9,26]]},"reference":[{"issue":"3","key":"65_CR1","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1145\/357103.357110","volume":"2","author":"K. R. Apt","year":"1980","unstructured":"Apt K. R., Francez N., de Roever W. P.: A proof system for communicating sequential processes. ACM Trans. Programming Languages Systems,. 2 (3) (1980) 359\u2013385.","journal-title":"ACM Trans. Programming Languages Systems"},{"key":"65_CR2","unstructured":"Bouge L., Le Guyadec Y., Virot B., Utard G.: On the expressivity of a weakest precondition calculus for a simple data-parallel programming language. Parallel Processing: CONPAR 94-VAPP VI, eds: B. Buchberger & J. Volkert, LNCS 854, Springer-Verlag, pp 100\u2013111, 1994."},{"issue":"1","key":"65_CR3","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/BF00571463","volume":"2","author":"M. Clint","year":"1973","unstructured":"Clint M.: Program proving: coroutines, Acta Informatica, 2 (1) (1973) 50\u201363.","journal-title":"Acta Informatica"},{"key":"65_CR4","unstructured":"Clint M., Narayana K. T.: Programming structures for synchronous parallelism, Parallel Computing 83, eds: F. Feilmeier, J. Joubert, U. Schendel, North-Holland, pp 405\u2013412, 1984."},{"key":"65_CR5","unstructured":"Dahl O.-J.: Verifiable Programming, Prentice-Hall International, 1992."},{"key":"65_CR6","unstructured":"Dijkstra E. W.: A Discipline of Programming, Prentice-Hall, 1976."},{"key":"65_CR7","unstructured":"FORTRAN 90 International Standard, ISO: IEC 1539: 1991."},{"key":"65_CR8","unstructured":"Francez N.: Program Verification, Addison-Wesley, 1992."},{"key":"65_CR9","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1006\/jpdc.1994.1080","volume":"22","author":"J. Gabarro","year":"1994","unstructured":"Gabarro J., Gavalda R.: An approach to correctness of data parallel algorithms, Journal of Parallel and Distributed Computing, 22 (1994) 185\u2013201.","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"65_CR10","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1006\/jpdc.1994.1085","volume":"22","author":"A. V. Gerbessiotis","year":"1994","unstructured":"Gerbessiotis A. V., Valiant L. G.: Direct bulk-synchronous parallel algorithms, Journal of Parallel and Distributed Computing, 22 (1994) 251\u2013267.","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"65_CR11","doi-asserted-by":"crossref","unstructured":"Gries D.: The Science of Programming, Springer-Verlag, 1981.","DOI":"10.1007\/978-1-4612-5983-1"},{"issue":"10","key":"65_CR12","doi-asserted-by":"publisher","first-page":"576","DOI":"10.1145\/363235.363259","volume":"12","author":"C. A. R. Hoare","year":"1969","unstructured":"Hoare C. A. R.: An axiomatic basis for computer programming, Comm. ACM, 12 (10) (1969) 576\u2013580.","journal-title":"Comm. ACM"},{"key":"65_CR13","doi-asserted-by":"crossref","unstructured":"Hoare C. A. R.: Communicating Sequential Processes, Prentice Hall, 1985.","DOI":"10.1007\/978-3-642-82921-5_4"},{"key":"65_CR14","unstructured":"Jifeng H., Miller Q., Chen L.: Algebraic laws for BSP programming, Euro-Par 96 Parallel Processing, Vol. 2, eds: L. Bouge, P. Fraigniaud, A. Mignotte, Y. Robert, LNCS 1124, Springer-Verlag, pp 359\u2013368, 1996."},{"issue":"4","key":"65_CR15","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1145\/69575.69577","volume":"5","author":"C. B. Jones","year":"1983","unstructured":"Jones C. B.: Tentative steps towards a development method for interfering programs, ACM Trans. Programming Languages Systems,. 5 (4) (1983) 596\u2013619.","journal-title":"ACM Trans. Programming Languages Systems"},{"key":"65_CR16","unstructured":"Jones C. B.: Systematic Software Development using VDM (2nd edn.), Prentice Hall, 1990."},{"key":"65_CR17","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/BF00289266","volume":"15","author":"G. Levin","year":"1981","unstructured":"Levin G., Gries D.: Proof techniques for communicating sequential processes, Acta Informatica, 15 (1981) 281\u2013302.","journal-title":"Acta Informatica"},{"key":"65_CR18","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/BF00268134","volume":"6","author":"S. Owicki","year":"1976","unstructured":"Owicki S., Gries D.: An axiomatic proof technique for parallel pograms, Acta Informatica, 6 (1976) 319\u2013340.","journal-title":"Acta Informatica"},{"key":"65_CR19","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/BF01932133","volume":"30","author":"A. Stewart","year":"1990","unstructured":"Stewart A.: An axiomatic treatment of SIMD assignment, BIT, 30 (1990) 70\u201382.","journal-title":"BIT"},{"issue":"1","key":"65_CR20","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1006\/jpdc.1995.1073","volume":"27","author":"A. Stewart","year":"1995","unstructured":"Stewart A.: Reasoning about data-parallel array assignment, Journal of Parallel and Distributed Computing, 27 (1) (1995) 79\u201385.","journal-title":"Journal of Parallel and Distributed Computing"},{"issue":"8","key":"65_CR21","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1145\/79173.79181","volume":"33","author":"L. G. Valiant","year":"1990","unstructured":"Valiant L. G.: A bridging model for parallel computation, Comm. ACM, 33 (8) (1990) 103\u2013111.","journal-title":"Comm. ACM"}],"container-title":["Lecture Notes in Computer Science","Euro-Par'97 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0002777","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,5]],"date-time":"2023-05-05T15:59:23Z","timestamp":1683302363000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0002777"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540634409","9783540695493"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/bfb0002777","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]},"assertion":[{"value":"26 September 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}