{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:25:56Z","timestamp":1725456356721},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540602477"},{"type":"electronic","value":"9783540447696"}],"license":[{"start":{"date-parts":[[1995,1,1]],"date-time":"1995-01-01T00:00:00Z","timestamp":788918400000},"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":[[1995]]},"DOI":"10.1007\/bfb0020461","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T08:33:05Z","timestamp":1132734785000},"page":"143-154","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On the completeness of a proof system for a simple data-parallel programming language (extended abstract)"],"prefix":"10.1007","author":[{"given":"Luc","family":"Boug\u00e9","sequence":"first","affiliation":[]},{"given":"David","family":"Cachera","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,9]]},"reference":[{"key":"13_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":"13_CR2","unstructured":"L. Boug\u00e9 and D. Cachera. On the completeness of a proof system for a simple dataparallel programming language. Research Report 94-42, LIP ENS Lyon, France, December 1994. Available at URL ftp:\/\/ftp.lip.ens-lyon.fr\/pub\/Rapports\/ RR\/RR94\/RR94-42.ps.Z."},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"L. Boug\u00e9, Y. Le Guyadec, G. Utard, and B. Virot. On the expressivity of a weakest preconditions calculus for a simple data-parallel programming language. In ConPar'94-VAPP VI, Linz, Austria, September 1994.","DOI":"10.1007\/3-540-58430-7_10"},{"key":"13_CR4","volume-title":"IFIP WG 10.3","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 Applications in Parallel and Distributed Computing, Caracas, Venezuela, April 1994. IFIP WG 10.3, North-Holland."},{"key":"13_CR5","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. Future Generation Computer Systems, 8:363\u2013378, 1992.","journal-title":"Future Generation Computer Systems"},{"key":"13_CR6","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":"13_CR7","unstructured":"E.W. Dijkstra. A Discipline of Programming. Prentice-Hall, 1976."},{"issue":"2","key":"13_CR8","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1006\/jpdc.1994.1080","volume":"22","author":"J. Gabarr\u00f3","year":"1994","unstructured":"J. Gabarr\u00f3 and R. Gavald\u00e0. An approach to correctness of data parallel algorithms. Journal of Parallel and Distributed Computing, 22(2):185\u2013201, August 1994.","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"13_CR9","unstructured":"M.J.C. Gordon. Programming Language Theory and its Implementation. Prentice Hall International, 1988."},{"key":"13_CR10","doi-asserted-by":"crossref","first-page":"576","DOI":"10.1145\/363235.363259","volume":"12","author":"C.A.R. Hoare","year":"1969","unstructured":"C.A.R. Hoare. An axiomatic basis for computer programming. Comm of the ACM, 12:576\u2013580, 1969.","journal-title":"Comm of the ACM"},{"key":"13_CR11","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"}],"container-title":["Lecture Notes in Computer Science","EURO-PAR '95 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0020461","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,20]],"date-time":"2020-04-20T00:37:31Z","timestamp":1587343051000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0020461"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540602477","9783540447696"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/bfb0020461","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]},"assertion":[{"value":"9 June 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"}]}}