{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,30]],"date-time":"2025-12-30T23:37:11Z","timestamp":1767137831886,"version":"build-2238731810"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319051185","type":"print"},{"value":"9783319051192","type":"electronic"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-05119-2_7","type":"book-chapter","created":{"date-parts":[[2014,3,7]],"date-time":"2014-03-07T04:36:28Z","timestamp":1394166988000},"page":"103-118","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A Sorted Semantic Framework for Applied Process Calculi (Extended Abstract)"],"prefix":"10.1007","author":[{"given":"Johannes","family":"Borgstr\u00f6m","sequence":"first","affiliation":[]},{"given":"Ram\u016bnas","family":"Gutkovas","sequence":"additional","affiliation":[]},{"given":"Joachim","family":"Parrow","sequence":"additional","affiliation":[]},{"given":"Bj\u00f6rn","family":"Victor","sequence":"additional","affiliation":[]},{"given":"Johannes \u00c5man","family":"Pohjola","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,3,8]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Bengtson, J., Johansson, M., Parrow, J., Victor, B.: Psi-calculi: a framework for mobile processes with nominal data and logic. LMCS 7(1:11) (2011)","DOI":"10.2168\/LMCS-7(1:11)2011"},{"key":"7_CR2","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/S0890-5401(03)00138-X","volume":"186","author":"AM Pitts","year":"2003","unstructured":"Pitts, A.M.: Nominal logic, a first order theory of names and binding. Inf. Comput. 186, 165\u2013193 (2003)","journal-title":"Inf. Comput."},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Abadi, M., Fournet, C.: Mobile values, new names, and secure communication. In: Proceedings of POPL, pp. 104\u2013115. ACM, January 2001","DOI":"10.1145\/373243.360213"},{"issue":"8","key":"7_CR4","doi-asserted-by":"publisher","first-page":"1195","DOI":"10.1016\/j.ic.2006.04.004","volume":"204","author":"C Haack","year":"2006","unstructured":"Haack, C., Jeffrey, A.: Pattern-matching spi-calculus. Inf. Comput. 204(8), 1195\u20131263 (2006)","journal-title":"Inf. Comput."},{"issue":"1","key":"7_CR5","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1145\/2363.2433","volume":"7","author":"D Gelernter","year":"1985","unstructured":"Gelernter, D.: Generative communication in Linda. ACM TOPLAS 7(1), 80\u2013112 (1985)","journal-title":"ACM TOPLAS"},{"key":"7_CR6","series-title":"LNCS","first-page":"146","volume-title":"GC 2004","author":"A Schmitt","year":"2005","unstructured":"Schmitt, A., Stefani, J.-B.: The KELL calculus: a family of higher-order distributed process calculi. In: Priami, C., Quaglia, P. (eds.) GC 2004. LNCS, vol. 3267, pp. 146\u2013178. Springer, Heidelberg (2005)"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Milner, R.: The polyadic $$\\pi $$-calculus: a tutorial. In: Bauer, F.L., Brauer, W., Schwichtenberg, H. (eds.) Logic and Algebra of Specification. NATO ASI, vol. 94, pp. 203\u2013246. Springer, Heidelberg (1993)","DOI":"10.1007\/978-3-642-58041-3_6"},{"key":"7_CR8","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/978-3-642-23217-6_18","volume-title":"CONCUR 2011","author":"H H\u00fcttel","year":"2011","unstructured":"H\u00fcttel, H.: Typed $$\\psi $$-calculi. In: Katoen, J.-P., K\u00f6nig, B. (eds.) CONCUR 2011. LNCS, vol. 6901, pp. 265\u2013279. Springer, Heidelberg (2011)"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Blanchet, B.: Using Horn clauses for analyzing security protocols. In Cortier, V., Kremer, S., eds.: Formal Models and Techniques for Analyzing Security Protocols. Cryptology and Information Security Series, vol. 5, pp. 86\u2013111. IOS Press (2011)","DOI":"10.3233\/978-1-60750-714-7-86"},{"key":"7_CR10","series-title":"LNCS","first-page":"141","volume-title":"ESOP 2005","author":"C Fournet","year":"2005","unstructured":"Fournet, C., Gordon, A.D., Maffeis, S.: A type discipline for authorization policies. In: Sagiv, M. (ed.) ESOP 2005. LNCS, vol. 3444, pp. 141\u2013156. Springer, Heidelberg (2005)"},{"key":"7_CR11","series-title":"IFIP AICT","first-page":"244","volume-title":"TCS 2010","author":"T Given-Wilson","year":"2010","unstructured":"Given-Wilson, T., Gorla, D., Jay, B.: Concurrent pattern calculus. In: Calude, C.S., Sassone, V. (eds.) TCS 2010. IFIP AICT, vol. 323, pp. 244\u2013258. Springer, Heidelberg (2010)"},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Fournet, C., Gonthier, G.: The reflexive CHAM and the join-calculus. In: Proceedings of the POPL, pp. 372\u2013385 (1996)","DOI":"10.1145\/237721.237805"},{"key":"7_CR13","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/s001650200016","volume":"13","author":"MJ Gabbay","year":"2001","unstructured":"Gabbay, M.J., Pitts, A.M.: A new approach to abstract syntax with variable binding. Formal Aspects Comput. 13, 341\u2013363 (2001)","journal-title":"Formal Aspects Comput."},{"issue":"3","key":"7_CR14","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1016\/j.jlap.2012.01.001","volume":"81","author":"M Johansson","year":"2012","unstructured":"Johansson, M., Victor, B., Parrow, J.: Computing strong and weak bisimulations for psi-calculi. J. Logic Algebraic Program. 81(3), 162\u2013180 (2012)","journal-title":"J. Logic Algebraic Program."},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"Johansson, M., Bengtson, J., Parrow, J., Victor, B.: Weak equivalences in psi-calculi. In: Proceedings of LICS 2010, pp. 322\u2013331. IEEE (2010)","DOI":"10.1109\/LICS.2010.30"},{"key":"7_CR16","volume-title":"Communication and Concurrency","author":"R Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. Prentice-Hall Inc., Upper Saddle River (1989)"},{"key":"7_CR17","unstructured":"Sangiorgi, D.: Expressing mobility in process algebras: first-order and higher-order paradigms. Ph.D thesis, University of Edinburgh, CST-99-93 (1993)"},{"issue":"2","key":"7_CR18","first-page":"70","volume":"10","author":"M Carbone","year":"2003","unstructured":"Carbone, M., Maffeis, S.: On the expressive power of polyadic synchronisation in $$\\pi $$-calculus. Nord. J. Comput. 10(2), 70\u201398 (2003)","journal-title":"Nord. J. Comput."},{"issue":"2","key":"7_CR19","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1109\/TIT.1983.1056650","volume":"29","author":"D Dolev","year":"1983","unstructured":"Dolev, D., Yao, A.C.: On the security of public key protocols. IEEE Trans. Inf. Theor. 29(2), 198\u2013208 (1983)","journal-title":"IEEE Trans. Inf. Theor."},{"key":"7_CR20","doi-asserted-by":"crossref","unstructured":"Borgstr\u00f6m, J., Gutkovas, R., Rodhe, I., Victor, B.: A parametric tool for applied process calculi. In: Proceedings of the 13th International Conference on Application of Concurrency to System Design (ACSD\u201913). IEEE (2013)","DOI":"10.1109\/ACSD.2013.22"},{"key":"7_CR21","doi-asserted-by":"crossref","unstructured":"Parrow, J., Borgstr\u00f6m, J., Raabjerg, P., \u00c5man Pohjola, J.: Higher-order psi-calculi. Mathematical Structures in Computer Science FirstView (June 2013)","DOI":"10.1017\/S0960129513000170"},{"key":"7_CR22","unstructured":"\u00c5man\u00a0Pohjola, J., Borgstr\u00f6m, J., Parrow, J., Raabjerg, P., Rodhe, I.: Negative premises in applied process calculi. Technical Report 2013-014, Department of Information Technology, Uppsala University (2013)"}],"container-title":["Lecture Notes in Computer Science","Trustworthy Global Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-05119-2_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T20:35:57Z","timestamp":1746131757000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-05119-2_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319051185","9783319051192"],"references-count":22,"aliases":["10.1007\/978-3-319-14128-2_7"],"URL":"https:\/\/doi.org\/10.1007\/978-3-319-05119-2_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"8 March 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}