{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:57:21Z","timestamp":1725663441737},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540541523"},{"type":"electronic","value":"9783540474722"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-54152-7_55","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T22:32:07Z","timestamp":1330209127000},"page":"1-26","source":"Crossref","is-referenced-by-count":5,"title":["Loosely-coupled processes (preliminary version)"],"prefix":"10.1007","author":[{"given":"Jayadev","family":"Misra","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"issue":"4","key":"1_CR1","doi-asserted-by":"crossref","first-page":"598","DOI":"10.1145\/69558.69562","volume":"11","author":"Arvind","year":"1989","unstructured":"Arvind, Nikil, R.S. and K. K. Pingali [1989]. \u201cI-Structures: Data Structures for Parallel Computing,\u201d ACM TOPLAS, Vol 11, No. 4, October 1989, 598\u2013632.","journal-title":"ACM TOPLAS"},{"key":"1_CR2","volume-title":"Parallel Program Design: A Foundation","author":"K. M. Chandy","year":"1988","unstructured":"Chandy, K. M., and J. Misra [1988]. Parallel Program Design: A Foundation, Reading, Massachusetts: Addison-Wesley, 1988."},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Chandy, K. Mani and Stephen Taylor, \u201cA Primer for Program Composition Notation,\u201d Caltech-CS-TR-90-10, June 20, 1990.","DOI":"10.21236\/ADA452317"},{"issue":"11","key":"1_CR4","doi-asserted-by":"crossref","first-page":"624","DOI":"10.1145\/360363.360369","volume":"19","author":"K. P. Eswaran","year":"1976","unstructured":"Eswaran, K. P., Gray, J. N., Lorie, R. A. and I. L. Traiger, \u201cThe Notions of Consistency and Predicate Locks in a Database System,\u201d C. ACM 19(11):624\u2013633, November 1976.","journal-title":"C. ACM"},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"Gaifman, H., Maher, M. J., and E. Shapiro [1990. \u201cReplay, Recovery, Replication and Snapshot of Nondeterministic Concurrent Programs,\u201d Department of Applied Mathematics and Computer Science, The Weizmann Institute of Science, Rehovot, 76100, Israel, July 1990.","DOI":"10.1145\/112600.112621"},{"issue":"10","key":"1_CR6","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1145\/355620.361161","volume":"17","author":"C. A. R. Hoare","year":"1974","unstructured":"C. A. R. Hoare, \u201cMonitors: An Operating System Structuring Concept,\u201d C. ACM, Vol. 17, No. 10, 549\u2013557, October 1974.","journal-title":"C. ACM"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Lenoski, D., Gharachorloo, K., Laudon, J., Gupta, A., Hennessy, J., Horowitz, M. and Lam, M., \u201cDesign of Scalable Shared-Memory Multiprocessors: The DASH Approach,\u201d Proc. ACM, Compcon, February, 1990.","DOI":"10.1109\/CMPCON.1990.63654"},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"Lenoski, D., Laudon, J., Gharachorloo, K., Gupta, A. and Hennessy, J., \u201cThe Directory-Based Cache Coherence Protocol for the DASH Multiprocessor,\u201d Proc. IEEE, 17th Annual International Symposium on Computer Architecture, 148\u2013159, Seattle, WA, May, 1990.","DOI":"10.1145\/325096.325132"},{"key":"1_CR9","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/0167-6423(90)90019-A","volume":"14","author":"J. Misra","year":"1990","unstructured":"Misra, J. [1990]. \u201cSpecifying Concurrent Objects as Communicating Processes,\u201d Science of Computer Programming 14 (1990), 159\u2013184.","journal-title":"Science of Computer Programming"},{"issue":"1","key":"1_CR10","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/BF00268134","volume":"6","author":"S. Owicki","year":"1976","unstructured":"Owicki, S., and D. Gries [1976]. \u201cAn Axiomatic Proof Technique for Parallel Programs I,\u201d Acta Informatica, 6:1, 1976, 319\u2013340.","journal-title":"Acta Informatica"},{"issue":"3","key":"1_CR11","doi-asserted-by":"crossref","first-page":"412","DOI":"10.1145\/72551.72555","volume":"21","author":"E. Shapiro","year":"1989","unstructured":"Shapiro, E. [1989]. \u201cThe Family of Concurrent Logic Programming Languages,\u201d ACM Computing Surveys, 21:3, 412\u2013510, 1989.","journal-title":"ACM Computing Surveys"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Steele, Guy L. Jr., \u201cMaking Asynchronous Parallelism Safe for the World,\u201d Proc. 17th Annual ACM Symposium on Principles of Programming Languages, San Francisco, CA, January 17\u201319, 1990, pp. 218\u2013231.","DOI":"10.1145\/96709.96731"},{"key":"1_CR13","unstructured":"Vishnubhotla, Prasad [1989]. \u201cConcurrency and Synchronization in the ALPS Programming Language,\u201d TR56, Ohio State University, 1989."}],"container-title":["Lecture Notes in Computer Science","PARLE '91 Parallel Architectures and Languages Europe"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-54152-7_55.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:52:40Z","timestamp":1605646360000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54152-7_55"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540541523","9783540474722"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-54152-7_55","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}