{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T12:19:39Z","timestamp":1770293979087,"version":"3.49.0"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319997247","type":"print"},{"value":"9783319997254","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-99725-4_18","type":"book-chapter","created":{"date-parts":[[2018,8,29]],"date-time":"2018-08-29T13:45:50Z","timestamp":1535550350000},"page":"284-305","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Process-Local Static Analysis of Synchronous Processes"],"prefix":"10.1007","author":[{"given":"Jan","family":"Midtgaard","sequence":"first","affiliation":[]},{"given":"Flemming","family":"Nielson","sequence":"additional","affiliation":[]},{"given":"Hanne Riis","family":"Nielson","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,8,29]]},"reference":[{"key":"18_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/978-3-319-52234-0_5","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"V Botbol","year":"2017","unstructured":"Botbol, V., Chailloux, E., Le Gall, T.: Static analysis of communicating processes using symbolic transducers. In: Bouajjani, A., Monniaux, D. (eds.) VMCAI 2017. LNCS, vol. 10145, pp. 73\u201390. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-52234-0_5"},{"issue":"4","key":"18_CR2","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1145\/321239.321249","volume":"11","author":"JA Brzozowski","year":"1964","unstructured":"Brzozowski, J.A.: Derivatives of regular expressions. J. ACM 11(4), 481\u2013494 (1964)","journal-title":"J. ACM"},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"Colby, C.: Analyzing the communication topology of concurrent programs. In: Proceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation, pp. 202\u2013213 (1995)","DOI":"10.1145\/215465.215592"},{"key":"18_CR4","unstructured":"Cousot, P., Cousot, R.: Static determination of dynamic properties of programs. In: Proceedings of the Second International Symposium on Programming, pp. 106\u2013130. Dunod, France (1976)"},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"Cousot, P., Cousot, R.: Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: Proceedings of the Fourth Annual ACM Symposium on Principles of Programming Languages, pp. 238\u2013252 (1977)","DOI":"10.1145\/512950.512973"},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"Cousot, P., Cousot, R.: Systematic design of program analysis frameworks. In: Proceedings of the Sixth Annual ACM Symposium on Principles of Programming Languages, pp. 269\u2013282 (1979)","DOI":"10.1145\/567752.567778"},{"key":"18_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/3-540-10003-2_65","volume-title":"Automata, Languages and Programming","author":"P Cousot","year":"1980","unstructured":"Cousot, P., Cousot, R.: Semantic analysis of communicating sequential processes. In: de Bakker, J., van Leeuwen, J. (eds.) ICALP 1980. LNCS, vol. 85, pp. 119\u2013133. Springer, Heidelberg (1980). https:\/\/doi.org\/10.1007\/3-540-10003-2_65"},{"key":"18_CR8","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511809088","volume-title":"Introduction to Lattices and Order","author":"BA Davey","year":"2002","unstructured":"Davey, B.A., Priestley, H.A.: Introduction to Lattices and Order, 2nd edn. Cambridge University Press, Cambridge (2002)","edition":"2"},{"key":"18_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-3-540-45099-3_8","volume-title":"Static Analysis","author":"J Feret","year":"2000","unstructured":"Feret, J.: Confidentiality analysis of mobile systems. In: Palsberg, J. (ed.) SAS 2000. LNCS, vol. 1824, pp. 135\u2013154. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/978-3-540-45099-3_8"},{"key":"18_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/978-3-662-44584-6_6","volume-title":"CONCUR 2014 \u2013 Concurrency Theory","author":"E Giachino","year":"2014","unstructured":"Giachino, E., Kobayashi, N., Laneve, C.: Deadlock analysis of unbounded process networks. In: Baldan, P., Gorla, D. (eds.) CONCUR 2014. LNCS, vol. 8704, pp. 63\u201377. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44584-6_6"},{"key":"18_CR11","series-title":"Pure and Applied Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-0348-7633-9","volume-title":"General Lattice Theory","author":"G Gr\u00e4tzer","year":"1978","unstructured":"Gr\u00e4tzer, G.: General Lattice Theory. Pure and Applied Mathematics. Academic Press, New York (1978)"},{"key":"18_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/BFb0032742","volume-title":"Static Analysis","author":"A Igarashi","year":"1997","unstructured":"Igarashi, A., Kobayashi, N.: Type-based analysis of communication for concurrent programming languages. In: Van Hentenryck, P. (ed.) SAS 1997. LNCS, vol. 1302, pp. 187\u2013201. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/BFb0032742"},{"issue":"4\u20135","key":"18_CR13","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/s00236-005-0179-x","volume":"42","author":"N Kobayashi","year":"2005","unstructured":"Kobayashi, N.: Type-based information flow analysis for the pi-calculus. Acta Informatica 42(4\u20135), 291\u2013347 (2005)","journal-title":"Acta Informatica"},{"key":"18_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/11817949_16","volume-title":"CONCUR 2006 \u2013 Concurrency Theory","author":"N Kobayashi","year":"2006","unstructured":"Kobayashi, N.: A new type system for deadlock-free processes. In: Baier, C., Hermanns, H. (eds.) CONCUR 2006. LNCS, vol. 4137, pp. 233\u2013247. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11817949_16"},{"key":"18_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/978-3-540-70545-1_10","volume-title":"Computer Aided Verification","author":"N Kobayashi","year":"2008","unstructured":"Kobayashi, N., Sangiorgi, D.: A hybrid type system for lock-freedom of mobile processes. In: Gupta, A., Malik, S. (eds.) CAV 2008. LNCS, vol. 5123, pp. 80\u201393. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-70545-1_10"},{"key":"18_CR16","doi-asserted-by":"crossref","unstructured":"Lange, J., Ng, N., Toninho, B., Yoshida, N.: Fencing off go: liveness and safety for channel-based programming. In: Proceedings of the 44th Annual ACM Symposium on Principles of Programming Languages, pp. 748\u2013761 (2017)","DOI":"10.1145\/3009837.3009847"},{"key":"18_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/978-3-540-74061-2_4","volume-title":"Static Analysis","author":"T Gall Le","year":"2007","unstructured":"Le Gall, T., Jeannet, B.: Lattice automata: a representation for languages on infinite alphabets, and some applications to verification. In: Nielson, H.R., Fil\u00e9, G. (eds.) SAS 2007. LNCS, vol. 4634, pp. 52\u201368. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74061-2_4"},{"key":"18_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/978-3-540-27815-3_27","volume-title":"Algebraic Methodology and Software Technology","author":"F Logozzo","year":"2004","unstructured":"Logozzo, F.: Separate compositional analysis of class-based object-oriented languages. In: Rattray, C., Maharaj, S., Shankland, C. (eds.) AMAST 2004. LNCS, vol. 3116, pp. 334\u2013348. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-27815-3_27"},{"key":"18_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/3-540-55511-0_16","volume-title":"Mathematical Foundations of Programming Semantics","author":"N Mercouroff","year":"1992","unstructured":"Mercouroff, N.: An algorithm for analyzing communicating processes. In: Brookes, S., Main, M., Melton, A., Mislove, M., Schmidt, D. (eds.) MFPS 1991. LNCS, vol. 598, pp. 312\u2013325. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-55511-0_16"},{"key":"18_CR20","doi-asserted-by":"crossref","unstructured":"Midtgaard, J., Nielson, F., Nielson, H.R.: Iterated process analysis over lattice-valued regular expressions. In: PPDP 2016: Proceedings of the 18th International Symposium on Principles and Practice of Declarative Programming, pp. 132\u2013145 (2016)","DOI":"10.1145\/2967973.2968601"},{"key":"18_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1007\/978-3-662-53413-7_17","volume-title":"Static Analysis","author":"J Midtgaard","year":"2016","unstructured":"Midtgaard, J., Nielson, F., Nielson, H.R.: A parametric abstract domain for lattice-valued regular expressions. In: Rival, X. (ed.) SAS 2016. LNCS, vol. 9837, pp. 338\u2013360. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53413-7_17"},{"key":"18_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/978-3-642-54013-4_3","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"A Min\u00e9","year":"2014","unstructured":"Min\u00e9, A.: Relational thread-modular static value analysis by abstract interpretation. In: McMillan, K.L., Rival, X. (eds.) VMCAI 2014. LNCS, vol. 8318, pp. 39\u201358. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54013-4_3"},{"key":"18_CR23","doi-asserted-by":"crossref","unstructured":"Ng, N., Yoshida, N.: Static deadlock detection for concurrent go by global session graph synthesis. In: Proceedings of the 25th International Conference on Compiler Construction, CC 2016, pp. 174\u2013184. ACM (2016)","DOI":"10.1145\/2892208.2892232"},{"key":"18_CR24","doi-asserted-by":"crossref","unstructured":"Nielson, F., Nielson, H.R.: Higher-order concurrent programs with finite communication topology. In: Proceedings of the 21st Annual ACM Symposium on Principles of Programming Languages, pp. 84\u201397 (1994)","DOI":"10.1145\/174675.174538"},{"key":"18_CR25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-03811-6","volume-title":"Principles of Program Analysis","author":"F Nielson","year":"1999","unstructured":"Nielson, F., Nielson, H.R., Hankin, C.: Principles of Program Analysis. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/978-3-662-03811-6"},{"issue":"2","key":"18_CR26","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1017\/S0956796808007090","volume":"19","author":"S Owens","year":"2009","unstructured":"Owens, S., Reppy, J., Turon, A.: Regular-expression derivatives re-examined. J. Funct. Program. 19(2), 173\u2013190 (2009)","journal-title":"J. Funct. Program."},{"key":"18_CR27","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574962","volume-title":"Concurrent Programming in ML","author":"J Reppy","year":"1999","unstructured":"Reppy, J.: Concurrent Programming in ML. Cambridge University Press, Cambridge (1999)"},{"key":"18_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/3-540-48294-6_9","volume-title":"Static Analysis","author":"R Rydhof Hansen","year":"1999","unstructured":"Rydhof Hansen, R., Jensen, J.G., Nielson, F., Nielson, H.R.: Abstract interpretation of mobile ambients. In: Cortesi, A., Fil\u00e9, G. (eds.) SAS 1999. LNCS, vol. 1694, pp. 134\u2013148. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48294-6_9"},{"issue":"2","key":"18_CR29","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1017\/S0956796807006466","volume":"18","author":"C Skalka","year":"2008","unstructured":"Skalka, C., Smith, S., Van Horn, D.: Types and trace effects of higher order programs. J. Funct. Program. 18(2), 179\u2013249 (2008)","journal-title":"J. Funct. Program."},{"key":"18_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/978-3-319-47958-3_7","volume-title":"Programming Languages and Systems","author":"K Stadtm\u00fcller","year":"2016","unstructured":"Stadtm\u00fcller, K., Sulzmann, M., Thiemann, P.: Static trace-based deadlock analysis for synchronous mini-go. In: Igarashi, A. (ed.) APLAS 2016. LNCS, vol. 10017, pp. 116\u2013136. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-47958-3_7"},{"key":"18_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/978-3-319-15579-1_21","volume-title":"Language and Automata Theory and Applications","author":"M Sulzmann","year":"2015","unstructured":"Sulzmann, M., Thiemann, P.: Derivatives for regular shuffle expressions. In: Dediu, A.-H., Formenti, E., Mart\u00edn-Vide, C., Truthe, B. (eds.) LATA 2015. LNCS, vol. 8977, pp. 275\u2013286. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-15579-1_21"},{"key":"18_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/978-3-319-30000-9_15","volume-title":"Language and Automata Theory and Applications","author":"M Sulzmann","year":"2016","unstructured":"Sulzmann, M., Thiemann, P.: Forkable regular expressions. In: Dediu, A.-H., Janou\u0161ek, J., Mart\u00edn-Vide, C., Truthe, B. (eds.) LATA 2016. LNCS, vol. 9618, pp. 194\u2013206. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-30000-9_15"},{"issue":"3","key":"18_CR33","doi-asserted-by":"publisher","first-page":"594","DOI":"10.1145\/322261.322273","volume":"28","author":"RE Tarjan","year":"1981","unstructured":"Tarjan, R.E.: Fast algorithms for solving path problems. J. ACM 28(3), 594\u2013614 (1981)","journal-title":"J. ACM"},{"key":"18_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/3-540-49727-7_9","volume-title":"Static Analysis","author":"A Venet","year":"1998","unstructured":"Venet, A.: Automatic determination of communication topologies in mobile systems. In: Levi, G. (ed.) SAS 1998. LNCS, vol. 1503, pp. 152\u2013167. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/3-540-49727-7_9"}],"container-title":["Lecture Notes in Computer Science","Static Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-99725-4_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,23]],"date-time":"2019-10-23T00:56:43Z","timestamp":1571792203000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-99725-4_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319997247","9783319997254"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-99725-4_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]}}}