{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:20:36Z","timestamp":1725456036754},"publisher-location":"Berlin\/Heidelberg","reference-count":26,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354019021X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0026104","type":"book-chapter","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T02:47:21Z","timestamp":1132627641000},"page":"185-199","source":"Crossref","is-referenced-by-count":0,"title":["Proving systolic arrays"],"prefix":"10.1007","author":[{"given":"E.","family":"Pascal Gribomont","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1145\/322358.322372","volume":"30","author":"K.R. Apt","year":"1983","unstructured":"APT, K.R. \u201cFormal Justification of a Proof System for Communicating Sequential Processes\u201d, JACM, vol. 30, pp. 197\u2013216, (1983)","journal-title":"JACM"},{"key":"13_CR2","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/BF01661171","volume":"1","author":"C. K.M","year":"1986","unstructured":"CHANDY, K.M., J. MISRA \u201cSystolic algorithms as programs\u201d, Distributed Computing, vol. 1, pp. 177\u2013183, (1986)","journal-title":"Distributed Computing"},{"key":"13_CR3","unstructured":"CHEN, T.C. et al. \u201cThe rebound sorter: an efficient sort engine for large files\u201d, Proc. 4th. Int. Conf. on VLDB, pp. 312\u2013318, IEEE, New-York, (1978)"},{"key":"13_CR4","volume-title":"A discipline of programming","author":"E.W. Dijkstra","year":"1976","unstructured":"DIJKSTRA E.W. \u201cA discipline of programmingrd, Prentice-Hall, New-Jersey, (1976)"},{"key":"13_CR5","volume-title":"A correctness proof for networks of communicating processes: a small exercise","author":"E.W. Dijkstra","year":"1977","unstructured":"DIJKSTRA E.W. \u201cA correctness proof for networks of communicating processes: a small exercise\u201d, EWD 607, Burroughs, The Netherlands, (1977)"},{"key":"13_CR6","first-page":"155","volume":"2","author":"T.E. Elrad","year":"1983","unstructured":"ELRAD, T.E., N. FRANCEZ \u201cDecomposition of distributed programs into communication-closed layers\u201d, SCP, vol. 2, pp. 155\u2013174, (1983)","journal-title":"SCP"},{"key":"13_CR7","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1090\/psapm\/019\/0235771","volume":"19","author":"R.W. Floyd","year":"1967","unstructured":"FLOYD, R.W. \u201cAssigning meanings to programs\u201d, Proc. AMS Symp. in Applied Mathematics, vol. 19, pp. 19\u201331, (1967)","journal-title":"Proc. AMS Symp. in Applied Mathematics"},{"key":"13_CR8","first-page":"300","volume":"1","author":"J.A.B. Fortes","year":"1985","unstructured":"FORTES, J.A.B. et al. \u201cSystematic approaches to the design of algorithmically specified systolic arrays\u201d, IEEE Conf. ICASSP 85, vol.1, pp. 300\u2013302, (1985)","journal-title":"IEEE Conf. ICASSP 85"},{"key":"13_CR9","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1145\/5956.5999","volume":"8","author":"M. Hennessy","year":"1986","unstructured":"HENNESSY, M. \u201cProving Systolic Systems Correct\u201d, ACM Toplas, vol. 8, pp. 344\u2013387, (1986)","journal-title":"ACM Toplas"},{"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":"HOARE, C.A.R. \u201cAn axiomatic approach to computer programming\u201d, CACM, vol. 12, pp. 576\u2013583, (1969)","journal-title":"CACM"},{"key":"13_CR11","doi-asserted-by":"crossref","first-page":"666","DOI":"10.1145\/359576.359585","volume":"21","author":"C.A.R. Hoare","year":"1978","unstructured":"HOARE, C.A.R. \u201cCommunicating Sequential Processes\u201d, CACM, vol. 21, pp. 666\u2013677, (1978)","journal-title":"CACM"},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"HOARE, C.A.R. \u201cCommunicating Sequential Processes\u201d, Prentice-Hall, (1985)","DOI":"10.1007\/978-3-642-82921-5_4"},{"key":"13_CR13","first-page":"160","volume":"258","author":"C.H. Huang","year":"1987","unstructured":"HUANG, C.H., C. LENGAUER \u201cAn implemented method for incremental systolic design\u201d LNCS, vol. 258, pp. 160\u2013177, (1987)","journal-title":"LNCS"},{"key":"13_CR14","first-page":"271","volume-title":"Introduction to VLSI systems","author":"H.T. KUNG","year":"1980","unstructured":"KUNG, H.T., C.E. LEISERSON \u201cAlgorithms for VLSI processor arrays\u201d, in \u201cIntroduction to VLSI systems\u201d, Mead and Conway (Eds), Addison-Wesley, Reading, Mass, pp. 271\u2013292, (1980)"},{"key":"13_CR15","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1109\/MC.1987.1663617","volume":"20","author":"S.Y. Kung","year":"1987","unstructured":"KUNG, S.Y. et al. \u201cWavefront Arrays Processors \u2014 Concept to implementation\u201d, Computer, vol. 20, pp. 18\u201333, (1987)","journal-title":"Computer"},{"issue":"4","key":"13_CR16","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1145\/948176.948183","volume":"18","author":"D. May","year":"1983","unstructured":"MAY, D. \u201cOCCAM\u201d, ACM Sigplan Notices, vol. 18, nr. 4, pp. 69\u201379, (1983)","journal-title":"ACM Sigplan Notices"},{"key":"13_CR17","first-page":"369","volume":"259","author":"A.R. Martin","year":"1987","unstructured":"MARTIN, A.R., J.V. TUCKER \u201cThe concurrent assignment representation of synchronous systems\u201d, LNCS, vol. 259, pp. 369\u2013386, (1987)","journal-title":"LNCS"},{"key":"13_CR18","doi-asserted-by":"crossref","unstructured":"MILNER, R. \u201cA Calculus of Communicating Systems\u201d LNCS, vol. 92 (1980)","DOI":"10.1007\/3-540-10235-3"},{"key":"13_CR19","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1109\/TSE.1981.230844","volume":"SE-7","author":"J. Misra","year":"1981","unstructured":"MISRA, J., K.M. CHANDY \u201cProofs of Networks of Processes\u201d, IEEE Trans. on Software Engineering, vol. SE-7, pp. 417\u2013426, (1981)","journal-title":"IEEE Trans. on Software Engineering"},{"key":"13_CR20","first-page":"277","volume":"5","author":"A. Moitra","year":"1985","unstructured":"MOITRA, A. \u201cAutomatic construction of CSP programs from sequential non-deterministic programs\u201d, SCP, vol. 5, pp. 277\u2013307, (1985)","journal-title":"SCP"},{"key":"13_CR21","first-page":"260","volume":"258","author":"C Mongenet","year":"1987","unstructured":"MONGENET, C, G.-R. PERRIN \u201cSynthesis of systolic arrays for inductive problems\u201d, LNCS, vol. 258, pp. 260\u2013277, (1987)","journal-title":"LNCS"},{"key":"13_CR22","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1145\/69575.2083","volume":"5","author":"M. Ossefort","year":"1983","unstructured":"OSSEFORT, M. \u201cCorrectness Proofs of Communicating Processes: Three Illustrative Examples from the Literature\u201d, ACM Toplas, vol. 5, pp. 620\u2013640, (1983)","journal-title":"ACM Toplas"},{"key":"13_CR23","doi-asserted-by":"crossref","unstructured":"QUINTON, P. \u201cAutomatic Synthesis of Systolic Arrays from Uniform Recurrent Equations\u201d, Proc. 11th Int. Symp. on Computer Architecture, pp. 208\u2013214, (1984)","DOI":"10.1145\/800015.808184"},{"key":"13_CR24","first-page":"295","volume":"258","author":"S.V. Rajopadhye","year":"1987","unstructured":"RAJOPADHYE, S.V., R.M. FUJIMOTO \u201cSystolic array synthesis by static analysis of program dependencies\u201d, LNCS, vol. 258, pp. 295\u2013310, (1987)","journal-title":"LNCS"},{"key":"13_CR25","first-page":"14","volume":"258","author":"M. Rem","year":"1987","unstructured":"REM, M. \u201cTrace theory and systolic computations\u201d, LNCS, vol. 258, pp. 14\u201333, (1987)","journal-title":"LNCS"},{"key":"13_CR26","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1145\/1780.1805","volume":"6","author":"N. Soundararajan","year":"1984","unstructured":"SOUNDARARAJAN, N. \u201cAxiomatic Semantics of Communicating Sequential Processes\u201d, ACM Toplas, vol. 6, pp. 647\u2013662, (1984)","journal-title":"ACM Toplas"}],"container-title":["Lecture Notes in Computer Science","CAAP '88"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0026104.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,5]],"date-time":"2023-05-05T10:38:54Z","timestamp":1683283134000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0026104"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354019021X"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/bfb0026104","relation":{},"subject":[]}}