{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:14:07Z","timestamp":1725664447056},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540592938"},{"type":"electronic","value":"9783540492337"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-59293-8_222","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:12:29Z","timestamp":1330276349000},"page":"590-604","source":"Crossref","is-referenced-by-count":3,"title":["Static and dynamic processor allocation for higher-order concurrent languages"],"prefix":"10.1007","author":[{"given":"Hanne Riis","family":"Nielson","sequence":"first","affiliation":[]},{"given":"Flemming","family":"Nielson","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"39_CR1","unstructured":"T.Amtoft, F.Nielson, H.R.Nielson: Type and behaviour reconstruction for higher-order concurrent programs. Manuscript."},{"key":"39_CR2","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/0167-6423(88)90033-0","volume":"11","author":"J. Cai","year":"1989","unstructured":"J. Cai, R. Paige: Program Derivation by Fixed Point Computation. Science of Computer Programming 11, pp. 197\u2013261, 1989.","journal-title":"Science of Computer Programming"},{"key":"39_CR3","doi-asserted-by":"crossref","unstructured":"R. Cridlig, E.Goubault: Semantics and analysis of Linda-based languages. Proc. Static Analysis, Springer Lecture Notes in Computer Science 724, 1993.","DOI":"10.1007\/3-540-57264-3_30"},{"key":"39_CR4","doi-asserted-by":"crossref","unstructured":"C.E:McDowell: A practical algorithm for static analysis of parallel programs. Journal of parallel and distributed computing 6, 1989.","DOI":"10.1016\/0743-7315(89)90004-X"},{"key":"39_CR5","unstructured":"A.Giacalone, P.Mishra, S.Prasad: Operational and Algebraic Semantics for Facile: a Symmetric Integration of Concurrent and Functional Programming. Proc. ICALP'90, Springer Lecture Notes in Computer Science 443, 1990."},{"key":"39_CR6","unstructured":"M.S.Hecht: Flow Analysis of Computer Programs, North-Holland, 1977."},{"key":"39_CR7","doi-asserted-by":"crossref","unstructured":"Y.-C.Hung, G.-H.Chen: Reverse reachability analysis: a new technique for deadlock detection on communicating finite state machines. Software \u2014 Practice and Experience 23, 1993.","DOI":"10.1002\/spe.4380230904"},{"key":"39_CR8","doi-asserted-by":"crossref","unstructured":"S.Jagannathan, S.Week: Analysing stores and references in a parallel symbolic language. Proc. L&FP, 1994.","DOI":"10.1145\/182409.182493"},{"key":"39_CR9","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1007\/3-540-52592-0_67","volume":"432","author":"M. Jourdan","year":"1990","unstructured":"M. Jourdan, D. Parigot: Techniques for Improving Grammar Flow Analysis. proc. ESOP'90, Springer Lecture Notes in Computer Science 432, pp. 240\u2013255, 1990.","journal-title":"proc. ESOP'90, Springer Lecture Notes in Computer Science"},{"key":"39_CR10","doi-asserted-by":"crossref","unstructured":"N. Mercouroff: An algorithm for analysing communicating processes. Proc. of MFPS, Springer Lecture Notes in Computer Science 598, 1992.","DOI":"10.1007\/3-540-55511-0_16"},{"key":"39_CR11","doi-asserted-by":"crossref","unstructured":"F.Nielson, H.R.Nielson: From CML to Process Algebras. Proc. CONCUR'93, Springer Lecture Notes in Computer Science 715, 1993.","DOI":"10.1007\/3-540-57208-2_34"},{"key":"39_CR12","doi-asserted-by":"crossref","unstructured":"H.R.Nielson, F.Nielson: Higher-Order Concurrent Programs with Finite Communication Topology. Proc. POPL'94, pp. 84\u201397, ACM Press, 1994.","DOI":"10.1145\/174675.174538"},{"key":"39_CR13","doi-asserted-by":"crossref","unstructured":"F.Nielson, H.R.Nielson: Constraints for Polymorphic Behaviours for Concurrent ML. Proc. CCL'94, Springer Lecture Notes in Computer Science 845, 1994.","DOI":"10.1007\/BFb0016845"},{"key":"39_CR14","doi-asserted-by":"crossref","unstructured":"J.H.Reif, S.A.Smolka: Dataflow analysis of distributed communicating processes. International Journal of Parallel Programs 19, 1990.","DOI":"10.1007\/BF01407862"},{"key":"39_CR15","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/3-540-56883-2_10","volume":"693","author":"J.R. Reppy","year":"1993","unstructured":"J.R. Reppy: Concurrent ML: Design, Application and Semantics. Springer Lecture Notes in Computer Science 693, pp. 165\u2013198, 1993.","journal-title":"Springer Lecture Notes in Computer Science"},{"key":"39_CR16","unstructured":"R.Tarjan: Iterative Algorithms for Global Flow Analysis. In J.Traub (ed.), Algorithms and Complexity, pp. 91\u2013102, Academic Press, 1976."},{"key":"39_CR17","unstructured":"B.Thomsen. Personal communication, May 1994."}],"container-title":["Lecture Notes in Computer Science","TAPSOFT '95: Theory and Practice of Software Development"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-59293-8_222.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:26:38Z","timestamp":1605648398000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-59293-8_222"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540592938","9783540492337"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-59293-8_222","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}