{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T21:10:16Z","timestamp":1742591416679,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540186250"},{"type":"electronic","value":"9783540480334"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1987]]},"DOI":"10.1007\/3-540-18625-5_50","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T19:40:16Z","timestamp":1330198816000},"page":"173-194","source":"Crossref","is-referenced-by-count":2,"title":["Parallelism and programming: A perspective"],"prefix":"10.1007","author":[{"given":"K. Mani","family":"Chandy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jayadev","family":"Misra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,27]]},"reference":[{"key":"14_CR1","volume-title":"Data Structures and Algorithms","author":"A. V. Aho","year":"1983","unstructured":"Aho, A. V., J. E. Hopcroft, and J. D. Ullman [1983]. Data Structures and Algorithms, Reading, Massachusetts: Addison-Wesley, 1983."},{"issue":"1","key":"14_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1145\/356901.356903","volume":"15","author":"G. R. Andrews","year":"1983","unstructured":"Andrews, G. R., and F. B. Schneider [1983]. \u201cConcepts and Notations for Concurrent Programming,\u201d Computing Surveys, 15:1, March 1983, pp. 3\u201343.","journal-title":"Computing Surveys"},{"issue":"8","key":"14_CR3","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1145\/359576.359579","volume":"21","author":"J. Backus","year":"1978","unstructured":"Backus, J. [1978]. \u201cCan Programming be Liberated from the von Neumaan Style? A Functional Style and its Algebra of Programs,\u201d C.ACM, 21:8, August 1978, pp. 613\u2013641.","journal-title":"C.ACM"},{"issue":"3","key":"14_CR4","doi-asserted-by":"publisher","first-page":"610","DOI":"10.1109\/TAC.1982.1102980","volume":"AC-27","author":"D. P. Bertsekas","year":"1982","unstructured":"Bertsekas, D. P. [1982]. \u201cDistributed Dynamic Programming,\u201d IEEE Transactions on Automatic Control, AC-27:3, June 1982, pp. 610\u2013616.","journal-title":"IEEE Transactions on Automatic Control"},{"key":"14_CR5","volume-title":"Self Stabilizing Distributed Resource Allocation","author":"G. M. Brown","year":"1987","unstructured":"Brown, G. M. [1987]. \u201cSelf Stabilizing Distributed Resource Allocation,\u201d Ph.D. thesis, University of Texas at Austin, Austin, Texas, 1987."},{"key":"14_CR6","volume-title":"Programming Expert Systems in OPS5","author":"L. Brownston","year":"1985","unstructured":"Brownston, L., et al., [1985]. Programming Expert Systems in OPS5, Reading, Massachusetts: Addison-Wesley, 1985."},{"doi-asserted-by":"crossref","unstructured":"Chandy, K. M. [1984]. \u201cConcurrent Programming for the Masses,\u201d (invited address) 3rd Annual ACM Symposium on Principles of Distributed Computing, Vancouver, Canada, August 5\u20137, 1984. (The text appears in Proc. of the 4th Annual ACM Symposium on Principles of Distributed Computing, 1985, pp. 1\u201312.)","key":"14_CR7","DOI":"10.1145\/323596.323597"},{"issue":"3","key":"14_CR8","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1145\/5956.5958","volume":"8","author":"K. M. Chandy","year":"1986","unstructured":"Chandy, K. M., and J. Misra [1986a]. \u201cAn Example of Stepwise Refinement of Distributed Programs: Quiescence Detection,\u201d ACM TOPLAS, 8:3, July 1986, pp. 326\u2013343.","journal-title":"ACM TOPLAS"},{"key":"14_CR9","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/BF01661171","volume":"1","author":"K. M. Chandy","year":"1986","unstructured":"Chandy, K. M., and J. Misra [1986b]. \u201cSystolic Algorithms as Programs,\u201d Distributed Computing, 1, 1986, pp. 177\u2013183.","journal-title":"Distributed Computing"},{"doi-asserted-by":"crossref","unstructured":"Cook, S. A. [1983]. \u201cThe Classification of Problems Which Have Fast Parallel Algorithms,\u201d Proc. of 24th IEEE Symposium on the Foundations of Computer Science, 1983.","key":"14_CR10","DOI":"10.1007\/3-540-12689-9_95"},{"key":"14_CR11","volume-title":"A Discipline of Programming","author":"E. W. Dijkstra","year":"1976","unstructured":"Dijkstra, E. W. [1976]. A Discipline of Programming, Englewood Cliffs, New Jersey: Prentice-Hall, 1976."},{"key":"14_CR12","first-page":"43","volume-title":"Programming Languages","author":"E. W. Dijkstra","year":"1968","unstructured":"Dijkstra, E. W. [1968]. \u201cCooperating Sequential Processes,\u201d (in) Programming Languages, (ed.) Genuys, New York: Academic Press, 1968, pp. 43\u2013112."},{"key":"14_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-4886-6","volume-title":"Fairness","author":"N. Francez","year":"1986","unstructured":"Francez, N. [1986]. Fairness, New York: Springer-Verlag, 1986."},{"key":"14_CR14","volume-title":"Synchronous Parallel Computation","author":"L. M. Goldschlager","year":"1978","unstructured":"Goldschlager, L. M. [1978]. \u201cSynchronous Parallel Computation,\u201d Ph.D. thesis, University of Toronto, Toronto, Ontario, (1977); see also Proc. of 10th ACM Symposium on the Theory of Computing, 1978, pp. 89\u201394 and J.ACM, 29:4, October 1982, pp. 1073\u20131086."},{"doi-asserted-by":"crossref","unstructured":"Hoare, C. A. R. [1984]. Communicating Sequential Processes, London: Prentice-Hall International, 1984.","key":"14_CR15","DOI":"10.1007\/978-3-662-09507-2_19"},{"issue":"8","key":"14_CR16","doi-asserted-by":"publisher","first-page":"666","DOI":"10.1145\/359576.359585","volume":"21","author":"C. A. R. R. Hoare","year":"1978","unstructured":"Hoare, C. A. R. [1978]. \u201cCommunicating Sequential Processes,\u201d C.ACM, 21:8, August 1978, pp. 666\u2013677.","journal-title":"C.ACM"},{"issue":"2","key":"14_CR17","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1145\/2993.357247","volume":"6","author":"L. Lamport","year":"1984","unstructured":"Lamport, L., and F. B. Schneider [1984]. \u201cThe \u2018Hoare Logic\u2019 of CSP, and All That,\u201d ACM TOPLAS, 6:2, April 1984, pp. 281\u2013296.","journal-title":"ACM TOPLAS"},{"doi-asserted-by":"crossref","unstructured":"Lynch, N. A., and M. R. Tuttle [1987]. \u201cHierarchical Correctness Proofs for Distributed Algorithms,\u201d Proc. of 6th Annual ACM Symposium on Principles of Distributed Computing, Vancouver, Canada, 1987.","key":"14_CR18","DOI":"10.1145\/41840.41852"},{"doi-asserted-by":"crossref","unstructured":"Manna, Z., and A. Pnueli [1983]. \u201cHow to Cook a Temporal Proof System for Your Pet Language,\u201d Proc. of the 10th Annual ACM Symposium on Principles of Programming Languages, Austin, Texas, 1983.","key":"14_CR19","DOI":"10.1145\/567067.567082"},{"key":"14_CR20","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/0304-3975(83)90114-7","volume":"25","author":"R. Milner","year":"1983","unstructured":"Milner, R. [1983]. \u201cCalculi for Synchrony and Asynchrony,\u201d Theoretical Computer Science, 25, 1983, pp. 267\u2013310.","journal-title":"Theoretical Computer Science"},{"unstructured":"Parker, R. A., et al., [1980]. \u201cAbstract Interface Specifications for the A-7E Device Interface Module,\u201d U.S. Navy Research Laboratories Memorandum Report 4385, November 1980.","key":"14_CR21"},{"doi-asserted-by":"crossref","unstructured":"Pippenger, N. [1979]. \u201cOn Simultaneous Resource Bounds,\u201d Proc. of 20th IEEE Symposium on Foundations of Computer Science, 1979, pp. 307\u2013311.","key":"14_CR22","DOI":"10.1109\/SFCS.1979.29"},{"key":"14_CR23","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/0304-3975(81)90110-9","volume":"13","author":"A. Pnueli","year":"1981","unstructured":"Pnueli, Amir [1981]. \u201cThe Temporal Semantics of Concurrent Programs,\u201d Theoretical Computer Science, 13, 1981, pp. 45\u201360.","journal-title":"Theoretical Computer Science"},{"key":"14_CR24","volume-title":"\u201cOn the Design of Some Systolic Algorithms,\u201d JAN 131a","author":"J. L. A. A. Snepscheut van de","year":"1987","unstructured":"van de Snepscheut, J. L. A., and J. B. Swenker [1987]. \u201cOn the Design of Some Systolic Algorithms,\u201d JAN 131a, The Netherlands: University of Groningen, 1987."}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-18625-5_50.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T20:39:13Z","timestamp":1742589553000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-18625-5_50"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987]]},"ISBN":["9783540186250","9783540480334"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-18625-5_50","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1987]]}}}