{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T12:50:07Z","timestamp":1743079807849,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540664437"},{"type":"electronic","value":"9783540483113"}],"license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"vor","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":[[1999]]},"DOI":"10.1007\/3-540-48311-x_50","type":"book-chapter","created":{"date-parts":[[2010,3,29]],"date-time":"2010-03-29T21:16:48Z","timestamp":1269897408000},"page":"383-390","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Array SSA for Explicitly Parallel Programs"],"prefix":"10.1007","author":[{"given":"Jean-Fran\u00e7ois","family":"Collard\u22c6","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[1999,8,6]]},"reference":[{"key":"50_CR1","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1006\/jpdc.1996.1261","volume":"40","author":"D. Barthou","year":"1997","unstructured":"D. Barthou, J.-F. Collard, and P. Feautrier. Fuzzy array dataflow analysis. Journal of Parallel and Distributed Computing, 40:210\u2013226, 1997.","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"50_CR2","doi-asserted-by":"crossref","unstructured":"J.-F. Collard and M. Griebl. Array dataflow analysis for explicitly parallel programs. Parallel Processing Letters, 1997.","DOI":"10.1142\/S0129626497000140"},{"issue":"4","key":"50_CR3","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1145\/115372.115320","volume":"13","author":"R. Cytron","year":"1991","unstructured":"R. Cytron, J. Ferrante, B.K. Rosen, M.N. Wegman, and F.K. Zadeck. Efficiently computing static single assignment form and the control dependence graph. ACM Trans. on Prog. Lang. Sys., 13(4):451\u2013490, Oct. 1991.","journal-title":"ACM Trans. on Prog. Lang. Sys."},{"key":"50_CR4","series-title":"Lect Notes Comput Sci","first-page":"316","volume-title":"W. on Lang. and Comp. for Par. Comp. (LCPC)","author":"J. Ferrante","year":"1994","unstructured":"J. Ferrante, D. Grunwald, and H. Srinivasan. Computing communication sets for control parallel programs. In W. on Lang. and Comp. for Par. Comp. (LCPC), volume 892 of LNCS, pages 316\u2013330, Ithaca, NY, August 1994."},{"key":"50_CR5","doi-asserted-by":"crossref","unstructured":"D. Grunwald and H. Srinivasan. Data flow equations for explicitely parallel programs. In ACM Symp. on Prin. of Prog. Lang. (PoPL), pages 159\u2013168, May 1993.","DOI":"10.1145\/173284.155349"},{"key":"50_CR6","doi-asserted-by":"crossref","unstructured":"K. Knobe and V. Sarkar. Array SSA form and its use in parallelization. In ACM Symp. on Prin. of Prog. Lang. (PoPL), pages 107\u2013120, San Diego, CA, Jan. 1998.","DOI":"10.1145\/268946.268956"},{"key":"50_CR7","doi-asserted-by":"crossref","unstructured":"J. Lee, S. Midki_, and D.A. Padua. Concurrent static single assignment form and constant propagation for explicitly parallel programs. In W. on Lang. and Comp. for Par. Comp. (LCPC), Aug. 1997.","DOI":"10.1007\/BFb0032687"},{"key":"50_CR8","doi-asserted-by":"crossref","unstructured":"D. Novillo, R. Unrau, and J. Schaeffer. Concurrent SSA form in the presence of mutual exclusion. In Int. Conf. on Par. Proc. (ICPP\u201998), pages 356\u2013364, Aug. 1998.","DOI":"10.1109\/ICPP.1998.708506"},{"key":"50_CR9","doi-asserted-by":"crossref","unstructured":"H. Srinivasan, J. Hook, and M. Wolfe. Static single assignment form for explicitely parallel programs. In ACM Symp. on Prin. of Prog. Lang. (PoPL), pages 260\u2013272, Charleston, D.C., Jan. 1993.","DOI":"10.1145\/158511.158644"}],"container-title":["Lecture Notes in Computer Science","Euro-Par\u201999 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48311-X_50","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,19]],"date-time":"2025-02-19T19:23:11Z","timestamp":1739992991000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48311-X_50"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540664437","9783540483113"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-48311-x_50","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1999]]},"assertion":[{"value":"6 August 1999","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"}]}}