{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,10]],"date-time":"2026-11-10T19:01:14Z","timestamp":1794337274178,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540634683","type":"print"},{"value":"9783540695769","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0032744","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T01:56:10Z","timestamp":1133402170000},"page":"217-231","source":"Crossref","is-referenced-by-count":1,"title":["Static analysis of interaction nets for distributed implementations"],"prefix":"10.1007","author":[{"given":"Ian","family":"Mackie","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2005,6,15]]},"reference":[{"issue":"4","key":"15_CR1","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1017\/S0956796800000496","volume":"2","author":"F. Bourdoncle","year":"1992","unstructured":"Fran\u00e7ois Bourdoncle. Abstract interpretation by dynamic partitioning. Journal of Functional Programming, 2(4):407\u2013435, 1992.","journal-title":"Journal of Functional Programming"},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"Christopher Colby. Analyzing the communication topology of concurrent programs. In Proceedings of the ACM Symposium on Partial Evaluation and Semantic Based Program Manipulation (PEPM'95), 1995.","DOI":"10.1145\/215465.215592"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"Patrick Cousot and Radhia Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Proceedings of the 4th ACM Symposium on Principles of Programming Languages, pages 238\u2013252, January 1977.","DOI":"10.1145\/512950.512973"},{"issue":"2-3","key":"15_CR4","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0743-1066(92)90030-7","volume":"13","author":"P. Cousot","year":"1992","unstructured":"Patrick Cousot and Radhia Cousot. Abstract interpretation and application to logic programs. Journal of Logic Programming, 13(2-3):103\u2013179, July 1992. Available from http:\/\/ww.dmi.ens.fr\/~Couot.","journal-title":"Journal of Logic Programming"},{"issue":"4","key":"15_CR5","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1093\/logcom\/2.4.511","volume":"2","author":"P. Cousot","year":"1992","unstructured":"Patrick Cousot and Radhia Cousot. Abstract interpretation frameworks. Journal of Logic and Computation, 2(4):511\u2013547, August 1992.","journal-title":"Journal of Logic and Computation"},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"Patrick Cousot and Radhia Cousot. Formal language, grammar and set-constraint-based program analysis by abstract interpretation. In Conference Record of FPCA '95 SIGPLAN\/SIGARCH\/WG2.8 Conference on Punctional Programming and Computer Architecture, pages 170\u2013181. ACM Press, 1995.","DOI":"10.1145\/224164.224199"},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"Maribel Fern\u00e1ndez and Ian Mackie. From term rewriting to generalised interaction nets. In Herbert Kuchen and S. Doaitse Swierstra, editors, Programming Languages: Implementations, Logics, and Programs. 8th International Symposium, PLILP'96, Aachen, Germany, number 1140 in Lecture Notes in Computer Science, pages 319\u2013333. Springer-Verlag, September 1996.","DOI":"10.1007\/3-540-61756-6_94"},{"key":"15_CR8","unstructured":"Maribel Fern\u00e1ndez and Ian Mackie. Integrating paradigms via interaction nets. In Manuel M. T. Chakravarty, Yike Guo, and Tetsuo Ida, editors, Multi-Paradigm Logic Programming, MPLP'96. Proceedings of the JICSLP'96 Post Conference Workshop, pages 137\u2013146. Technical University of Berlin Report Number 96-28, August 1996."},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"Al Geist, Adam Beguelin, Jack Dongarra, Weicheng Jiang, Robert Manchek, and Vaidy Sunderam. PVM Parallel Virtual Machine. Scientific and Engineering Computation Series. The MIT Press, 1994.","DOI":"10.7551\/mitpress\/5712.001.0001"},{"key":"15_CR10","doi-asserted-by":"crossref","unstructured":"Georges Gonthier, Mart\u00edn Abadi, and Jean-Jacques L\u00e9vy. The geometry of optimal lambda reduction. In Proceedings of the 19th ACM Symposium on Principles of Programming Languages, pages 15\u201326, January 1992.","DOI":"10.1145\/143165.143172"},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"Yves Lafont. Interaction nets. In Proceedings of the 17th ACM Symposium on Principles of Programming Languages, pages 95\u2013108, January 1990.","DOI":"10.1145\/96709.96718"},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"Yves Lafont. Interaction combinators. Information and Computation, 1997. To appear.","DOI":"10.1006\/inco.1997.2643"},{"key":"15_CR13","unstructured":"Ian Mackie. A \u03bb-evaluator based on interaction nets. In Chris Hankin, Ian Mackie, and Raja Nagarajan, editors, Theory and Formal Methods 1994: Proceedings of the Second Imperial College, Department of Computing, Workshop on Theory and Formal Methods, pages 41\u201360. Imperial College Press, September 1995."},{"key":"15_CR14","doi-asserted-by":"crossref","unstructured":"Hanne Riis Nielson and Flemming Nielson. Higher-order concurrent programs with finite communication topology. In Proceedings of the 21st ACM Symposium on Principles of Programming Languages (POPL'94), 1994.","DOI":"10.1145\/174675.174538"},{"key":"15_CR15","unstructured":"Marc Snir, Steve W. Otto, Steven Huss-Lederman, David W. Walker, and Jack Dongarra. MPI The Complete Reference. Scientific and Engineering Computation Series. The MIT Press, 1996."},{"key":"15_CR16","doi-asserted-by":"crossref","unstructured":"Arnaud Venet. Abstract interpretation of the \u03c0-calculus. In Proceedings of the 5th LOMAPS Workshop on Analysis and Verification of High-Level Concurrent Languages, number 1192 in Lecture Notes in Computer Science, pages 51\u201375. Springer-Verlag, 1996.","DOI":"10.1007\/3-540-62503-8_3"}],"container-title":["Lecture Notes in Computer Science","Static Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0032744","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T04:24:26Z","timestamp":1586579066000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0032744"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540634683","9783540695769"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/bfb0032744","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/bfb0032729","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997]]}}}