{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:02:01Z","timestamp":1725663721581},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540513056"},{"type":"electronic","value":"9783540461913"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/3-540-51305-1_18","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T20:54:32Z","timestamp":1330203272000},"page":"307-324","source":"Crossref","is-referenced-by-count":4,"title":["The projection of systolic programs"],"prefix":"10.1007","author":[{"given":"C.","family":"Lengauer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J. W.","family":"Sanders","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"18_CR1","unstructured":"C. A. R. Hoare, Communicating Sequential Processes, Series in Computer Science, Prentice-Hall Int., 1985."},{"issue":"2","key":"18_CR2","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0020-0190(87)90224-9","volume":"25","author":"C. A. R. Hoare","year":"1987","unstructured":"C. A. R. Hoare, He Jifeng and J. W. Sanders, \u201cPrespecification in Data Refinement\u201d, Information Processing Letters 25, 2 (May 1987), 71\u201376.","journal-title":"Information Processing Letters"},{"issue":"6","key":"18_CR3","first-page":"595","volume":"24","author":"C.-H. Huang","year":"1987","unstructured":"C.-H. Huang and C. Lengauer, \u201cThe Derivation of Systolic Implementations of Programs\u201d, Acta Informatica 24, 6 (Nov. 1987), 595\u2013632.","journal-title":"Acta Informatica"},{"key":"18_CR4","unstructured":"INMOS Ltd., occam Programming Manual, Series in Computer Science, Prentice-Hall Int., 1984."},{"key":"18_CR5","unstructured":"J. L. Jacob, \u201cOn Shared Systems\u201d, D. Phil. Thesis, Programming Research Group, Oxford University Computing Laboratory, 1987."},{"key":"18_CR6","unstructured":"H. T. Kung and C. E. Leiserson, \u201cAlgorithms for VLSI Processor Arrays\u201d, in Introduction to VLSI Systems, C. Mead and L. Conway (eds.), Addison-Wesley, 1980, Sect. 8.3."},{"issue":"12","key":"18_CR7","first-page":"1578","volume":"TC-37","author":"P. Lee","year":"1988","unstructured":"P. Lee, Z. Kedem, \u201cSynthesizing Linear Array Algorithms from Nested for Loop Algorithms\u201d, IEEE Trans. on Computers TC-37, 12 (Dec. 1988), 1578\u20131598.","journal-title":"IEEE Trans. on Computers"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"C. Lengauer, \u201cTowards Systolizing Compilation: An Overview\u201d, Proc. Conf. on Parallel Architectures and Languages Europe (PARLE 89), June 1989, to appear as Springer-Verlag Lecture Notes in Computer Science.","DOI":"10.1007\/3-540-51285-3_45"},{"issue":"1","key":"18_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TC.1986.1676652","volume":"C-35","author":"D. I. Moldovan","year":"1986","unstructured":"D. I. Moldovan and J. A. B. Fortes, \u201cPartitioning and Mapping Algorithms into Fixed-Size Systolic Arrays\u201d, IEEE Trans. on Computers C-35, 1 (Jan. 1986), 1\u201312.","journal-title":"IEEE Trans. on Computers"},{"issue":"6","key":"18_CR10","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1007\/BF00263649","volume":"22","author":"T. Nipkow","year":"1986","unstructured":"T. Nipkow, \u201cNon-Determinstic Data Types\u201d, Acta Informatica 22, 6 (Mar. 1986), 629\u2013661.","journal-title":"Acta Informatica"},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"A. W. Roscoe and C. A. R. Hoare, \u201cThe Laws of occam Programming\u201d, Theoretical Computer Science 60, 2 (1988), 177ff.","DOI":"10.1016\/0304-3975(88)90049-7"}],"container-title":["Lecture Notes in Computer Science","Mathematics of Program Construction"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-51305-1_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:20:57Z","timestamp":1605648057000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-51305-1_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540513056","9783540461913"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-51305-1_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]}}}