{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:13:14Z","timestamp":1725664394954},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540584308"},{"type":"electronic","value":"9783540487890"}],"license":[{"start":{"date-parts":[[1994,1,1]],"date-time":"1994-01-01T00:00:00Z","timestamp":757382400000},"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":[[1994]]},"DOI":"10.1007\/3-540-58430-7_10","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T16:02:26Z","timestamp":1330272146000},"page":"100-111","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["On the expressivity of a weakest precondition calculus for a simple data-parallel programming language (short version)"],"prefix":"10.1007","author":[{"given":"Luc","family":"Boug\u00e9","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yann","family":"Le Guyadec","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gil","family":"Utard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bernard","family":"Virot","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"K.R. Apt and E.R. Olderog. Verification of Sequential and Concurrent Programs. Text and Monographs in Computer Science. Springer Verlag, 1990.","DOI":"10.1007\/978-1-4757-4376-0"},{"key":"10_CR2","volume-title":"Technical report, LIFO: RR94-07, Universit\u00e9 d'Orl\u00e9ans, and LIP: RR94-12","author":"L. Boug\u00e9","year":"1994","unstructured":"L. Boug\u00e9, Y. Le Guyadec, G. Utard, and B. Virot. On the expressivity of a weakest precondition calculus for a simple data-parallel programming language (extended version). Technical report, LIFO: RR94-07, Universit\u00e9 d'Orl\u00e9ans, and LIP: RR94-12, ENS Lyon, April 1994."},{"key":"10_CR3","volume-title":"A proof system for a simple data-parallel programming language","author":"L. Boug\u00e9","year":"1994","unstructured":"L. Boug\u00e9, Y. Le Guyadec, G. Utard, and B. Virot. A proof system for a simple data-parallel programming language. In C. Girault, editor, Proc. of the IFIP WG10.3 Int. Conf. on Application in Parallel and Distributed Computing, Caracas, V\u00e9n\u00e9zuela, April 1994. Elsevier."},{"key":"10_CR4","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1016\/0167-739X(92)90069-N","volume":"8","author":"L. Boug\u00e9","year":"1992","unstructured":"L. Boug\u00e9 and J.-L. Levaire. Control structures for data-parallel SIMD languages: semantics and implementation. FGCS, 8:363\u2013378, 1992.","journal-title":"FGCS"},{"key":"10_CR5","unstructured":"M. Clint and K.T. Narayana. On the completeness of a proof system for a synchronous parallel programming langage. In Third Conf. Found. Softw. Techn. and Theor. Comp. Science, Bangalore, India, December 1983."},{"key":"10_CR6","unstructured":"E.W. Dijkstra. A Discipline of Programming. Prentice-Hall, 1976."},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"High Performance Fortran Forum. High Performance Fortran language specification (draft version). CITI\/CRPC, Rice Univ., Houston, January 1993. Version 1.0 Draft.","DOI":"10.1145\/174223.158909"},{"key":"10_CR8","unstructured":"J. Gabarr\u00f3 and R. Gavald\u00e0. An approach to correctness of data parallel algorithms. Technical Report LSI-91-19, Univ. Polit\u00e9cnica de Catalunya, October 1991. To appear in Journ. of Parallel and Distr. Computing, 1994."},{"key":"10_CR9","unstructured":"M.J.C. Gordon. Programming Language Theory and its Implementation. Int. Series in Comp. Sciences. Prentice Hall, 1988."},{"key":"10_CR10","unstructured":"MasPar Computer Corporation, Sunnyvale CA. Maspar Parallel Application Language Reference Manual, 1990."},{"key":"10_CR11","unstructured":"N. Paris. HyperC specification document. Technical Report 93-1, HyperParallel Technologie, 1993."},{"key":"10_CR12","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1007\/BF01932133","volume":"30","author":"A. Stewart","year":"1990","unstructured":"A. Stewart. An axiomatic treatment of SIMD assignment. Bit, 30:70\u201382, 1990.","journal-title":"Bit"},{"key":"10_CR13","unstructured":"Thinking Machine Corporation, Cambridge MA. C\n* programming guide, 1990."}],"container-title":["Lecture Notes in Computer Science","Parallel Processing: CONPAR 94 \u2014 VAPP VI"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58430-7_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T12:34:47Z","timestamp":1558269287000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58430-7_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540584308","9783540487890"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-58430-7_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]},"assertion":[{"value":"3 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}