{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T17:27:43Z","timestamp":1778520463926,"version":"3.51.4"},"reference-count":33,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[1995,3,1]],"date-time":"1995-03-01T00:00:00Z","timestamp":794016000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Form. Asp. Comput."],"published-print":{"date-parts":[[1995,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We propose a new framework called ACL for concurrent computation based on linear logic. ACL is a kind of<jats:italic>linear logic programming<\/jats:italic>framework, where its operational semantics is described in terms of<jats:italic>proof construction<\/jats:italic>in linear logic. We also give a model-theoretic semantics based on<jats:italic>phase semantics<\/jats:italic>, a model of linear logic. Our framework well captures concurrent computation based on asynchronous communication. It will, therefore, provide us with a new insight into other models of asynchronous concurrent computation from a<jats:italic>logical<\/jats:italic>point of view. We also expect ACL to become a formal framework for analysis, synthesis and transformation of concurrent programs by the use of techniques for traditional logic programming. ACL's attractive features for concurrent programming paradigms are also discussed.<\/jats:p>","DOI":"10.1007\/bf01211602","type":"journal-article","created":{"date-parts":[[2005,2,25]],"date-time":"2005-02-25T19:41:40Z","timestamp":1109360500000},"page":"113-149","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["Asynchronous communication model based on linear logic"],"prefix":"10.1145","volume":"7","author":[{"given":"Naoki","family":"Kobayashi","sequence":"first","affiliation":[{"name":"Department of Information Science, University of Tokyo, 7-3-1 Hongo, Bunkyo-ku, 113, Tokyo, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Akinori","family":"Yonezawa","sequence":"additional","affiliation":[{"name":"Department of Information Science, University of Tokyo, 7-3-1 Hongo, Bunkyo-ku, 113, Tokyo, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","reference":[{"key":"e_1_2_1_2_1_2","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(93)90181-R"},{"key":"e_1_2_1_2_2_2","doi-asserted-by":"crossref","unstructured":"Agha G.: Actors: A Model of Concurrent Computation in Distributed Systems . MIT Press 1986.","DOI":"10.7551\/mitpress\/1086.001.0001"},{"key":"e_1_2_1_2_3_2","doi-asserted-by":"crossref","unstructured":"Agha G.: \u201cThe Structure and Semantics of Actor Language \u201d in Proceedings of the School\/Workshop on Foundations of Object-Oriented Languages Springer Verlag 1991.","DOI":"10.1007\/BFb0019439"},{"key":"e_1_2_1_2_4_2","doi-asserted-by":"crossref","unstructured":"Agha G. and Callsen C. J.: \u201cActorSpaces: An Open Distributed Programming Paradigm \u201d in Proceedings of Principles and Practices of Parallel Programming pp. 23\u201332 1993.","DOI":"10.1145\/173284.155335"},{"key":"e_1_2_1_2_5_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF03037173"},{"key":"e_1_2_1_2_6_2","doi-asserted-by":"crossref","unstructured":"Andreoli J.-M. and Pareschi R.: \u201cCommunication as Fair Distribution of Knowledge \u201d in Proceedings of OOPSLA '91 pp. 212\u2013229 1991.","DOI":"10.1145\/117954.117971"},{"key":"e_1_2_1_2_7_2","unstructured":"Andreoli J.-M. and Pareschi R.: \u201cAssociative Communication and its Optimization via Abstract Interpretation \u201d 1992. Submitted for publication."},{"key":"e_1_2_1_2_8_2","doi-asserted-by":"crossref","unstructured":"Asperti A. Ferrari G. L. and Gorrieri R.: \u201cImplicative Formulae in the \u201cProofs as Computations Analogy\u201d \u201d in Proceedings of SIGACT\/SIGPLAN Symposium on Principles of Programming Language pp. 59\u201371 1990.","DOI":"10.1145\/96709.96715"},{"key":"e_1_2_1_2_9_2","unstructured":"Bellin G. and van de Wiele J.: \u201cProof Nets and Typed Lambda Calculus I. Empires and Kingdoms.\u201d draft 1993."},{"issue":"3","key":"e_1_2_1_2_10_2","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1145\/828.833","article-title":"A Theory of Communicating Sequential Processes","volume":"31","author":"Brookes S. D.","year":"1984","journal-title":"Journal of ACM"},{"key":"e_1_2_1_2_11_2","doi-asserted-by":"crossref","unstructured":"Dershowitz N. and Jouannaud J.-P.: \u201cRewrite Systems \u201d in Handbook of Theoretical Computer Science Volume B (J. V. Leeuwen ed.) ch. 6 pp. 243\u2013320 The MIT press\/Elsevier 1990.","DOI":"10.1016\/B978-0-444-88074-1.50011-1"},{"key":"e_1_2_1_2_12_2","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/3-540-52590-4_46","article-title":"Petri Nets as Models of Linear Logic","volume":"431","author":"Engberg U.","year":"1990","journal-title":"Proceedings of CAAP'90"},{"key":"e_1_2_1_2_13_2","doi-asserted-by":"crossref","unstructured":"Gehlot V. and Gunter C.: \u201c Normal Process Representatives \u201d in Proceedings of IEEE Symposium on Logic in Computer Science pp. 200\u2013207 1990.","DOI":"10.1109\/LICS.1990.113746"},{"issue":"1","key":"e_1_2_1_2_14_2","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1145\/2363.2433","article-title":"Generative Communication in Linda","volume":"7","author":"Gelernter D.","year":"1985","journal-title":"ACM Transactions on Programming Language and Systems"},{"key":"e_1_2_1_2_15_2","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(87)90045-4"},{"key":"e_1_2_1_2_16_2","unstructured":"Girard J.-Y. Lafont Y. and Taylor P.: Proofs and Types . Cambridge Tracts in Theoretical Computer Science Cambridge University Press 1990."},{"issue":"6","key":"e_1_2_1_2_17_2","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1145\/360825.360861","article-title":"A linear space algorithm for computing maximal common subsequence","volume":"18","author":"Hirschberg D. S.","year":"1975","journal-title":"Communications of the ACM"},{"key":"e_1_2_1_2_18_2","unstructured":"Kobayashi N. and Yonezawa A.: \u201c ACL \u2014 A Concurrent Linear Logic Programming Paradigm \u201d in Proceedings of International Logic Programming Symposium pp. 279\u2013294 MIT Press 1993."},{"key":"e_1_2_1_2_19_2","unstructured":"Kobayashi N. and Yonezawa A.: \u201cLogical Testing and Observation Equivalence for Processes in a Linear Logic Programming \u201d Tech. Rep. 93-4 Department of Information Science University of Tokyo 1993. presented at Linear Logic Workshop Cornell University."},{"key":"e_1_2_1_2_20_2","doi-asserted-by":"crossref","unstructured":"Lafont Y.: \u201cInteraction Nets \u201d in Proceedings of Seventeenth ACM SIGPLAN\/SIGACT Symposium on Principles Of Programming Language pp. 95\u2013108 1990.","DOI":"10.1145\/96709.96718"},{"key":"e_1_2_1_2_21_2","doi-asserted-by":"crossref","unstructured":"Lloyd J.: Foundations of Logic Programming . Springer-Verlag 2nd ed. 1987.","DOI":"10.1007\/978-3-642-83189-8"},{"key":"e_1_2_1_2_22_2","doi-asserted-by":"crossref","unstructured":"Marti-Oliet N. and Meseguer J.: \u201cFrom Petri Nets to Linear Logic \u201d in Category Theory and Computer Science vol. 389 of Lecture Notes in Computer Science pp. 313\u2013337 Springer Verlag 1989.","DOI":"10.1007\/BFb0018359"},{"key":"e_1_2_1_2_23_2","first-page":"242","article-title":"The \u03c0-calculus as a theory in linear logic: Preliminary results","volume":"660","author":"Miller D.","year":"1992","journal-title":"Proceedings of the 1992 Workshop on Extensions to Logic Programming"},{"key":"e_1_2_1_2_24_2","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(83)90114-7"},{"key":"e_1_2_1_2_25_2","unstructured":"Milner R.: Communication and Concurrency . Prentice Hall 1989."},{"key":"e_1_2_1_2_26_2","doi-asserted-by":"crossref","unstructured":"Milner R.: \u201cFunction as Processes \u201d in Automata Language and Programming vol. 443 of Lecture Notes in Computer Science pp. 167\u2013180 Springer Verlag 1990.","DOI":"10.1007\/BFb0032030"},{"key":"e_1_2_1_2_27_2","doi-asserted-by":"crossref","unstructured":"Milner R. Parrow J. and Walker D.: \u201cA Calculus of Mobile Processes Part I \u201d Information and Computation pp. 1\u201340 September 1992.","DOI":"10.1016\/0890-5401(92)90008-4"},{"key":"e_1_2_1_2_28_2","doi-asserted-by":"crossref","unstructured":"Milner R. Parrow J. and Walker D.: \u201cA Calculus of Mobile Processes Part II \u201d Information and Computation pp. 1\u201340 September 1992.","DOI":"10.1016\/0890-5401(92)90008-4"},{"key":"e_1_2_1_2_29_2","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(84)90113-0"},{"key":"e_1_2_1_2_30_2","doi-asserted-by":"crossref","unstructured":"Saraswat V. and Lincoln P.: \u201cHigher-order linear concurrent constraint programming \u201d July 1992. draft.","DOI":"10.7551\/mitpress\/2086.001.0001"},{"issue":"3","key":"e_1_2_1_2_31_2","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1145\/72551.72555","article-title":"The Family of Concurrent Logic Programming Languages","volume":"21","author":"Shapiro E.","year":"1989","journal-title":"ACM Computing Surveys"},{"key":"e_1_2_1_2_32_2","unstructured":"Yonezawa A.: ABCL: An Object-Oriented Concurrent System . MIT Press 1990."},{"key":"e_1_2_1_2_33_2","doi-asserted-by":"crossref","unstructured":"Yonezawa A. and Tokoro M.: Object-Oriented Concurrent Programming . The MIT Press 1987.","DOI":"10.1145\/28697.28722"}],"container-title":["Formal Aspects of Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01211602.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01211602\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1007\/BF01211602","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,24]],"date-time":"2024-12-24T01:14:07Z","timestamp":1735002847000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1007\/BF01211602"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,3]]},"references-count":33,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1995,3]]}},"alternative-id":["10.1007\/BF01211602"],"URL":"https:\/\/doi.org\/10.1007\/bf01211602","relation":{},"ISSN":["0934-5043","1433-299X"],"issn-type":[{"value":"0934-5043","type":"print"},{"value":"1433-299X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,3]]}}}