{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,30]],"date-time":"2025-12-30T23:39:56Z","timestamp":1767137996593,"version":"build-2238731810"},"publisher-location":"Cham","reference-count":17,"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_6","type":"book-chapter","created":{"date-parts":[[2014,3,7]],"date-time":"2014-03-07T04:36:28Z","timestamp":1394166988000},"page":"83-102","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Types for Resources in $$\\psi $$-calculi"],"prefix":"10.1007","author":[{"given":"Hans","family":"H\u00fcttel","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,3,8]]},"reference":[{"issue":"1","key":"6_CR1","first-page":"11","volume":"7","author":"J. Bengtson","year":"2011","unstructured":"Bengtson, J., Johansson, M., Parrow, J., Victor, B.: Psi-calculi: a framework for mobile processes with nominal data and logic. Logical Meth. Comput. Sci. 7(1), 11 (2011)","journal-title":"Logical Meth. Comput. Sci."},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Bugliesi, M., Calzavara, S., Eigner, F., Maffei, M.: Resource-aware authorization policies for statically typed cryptographic protocols. In: Proceedings of CSF 2011, pp. 83\u201398. IEEE Computer Society (2011)","DOI":"10.1109\/CSF.2011.13"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Dardha, O., Giachino, E., Sangiorgi, D.: Session types revisited. In: Proceedings of PPDP, pp. 139\u2013150. ACM, New York (2012)","DOI":"10.1145\/2370776.2370794"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"de Vries, E., Francalanza, A., Hennessy, M.: Uniqueness typing for resource management in message-passing concurrency. In: LINEARITY. EPTCS, vol. 22, pp. 26\u201337 (2009)","DOI":"10.4204\/EPTCS.22.3"},{"key":"6_CR5","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/978-3-642-23217-6_19","volume-title":"CONCUR 2011","author":"R Demangeon","year":"2011","unstructured":"Demangeon, R., Honda, K.: Full Abstraction in a Subtyped pi-calculus with Linear Types. In: Katoen, J.-P., K\u00f6nig, B. (eds.) CONCUR 2011. LNCS, vol. 6901, pp. 280\u2013296. Springer, Heidelberg (2011)"},{"issue":"7","key":"6_CR6","doi-asserted-by":"publisher","first-page":"1045","DOI":"10.1016\/j.ic.2006.03.002","volume":"204","author":"Y Deng","year":"2006","unstructured":"Deng, Y., Sangiorgi, D.: Ensuring termination by typability. Inf. Comput. 204(7), 1045\u20131082 (2006)","journal-title":"Inf. Comput."},{"issue":"6","key":"6_CR7","doi-asserted-by":"publisher","first-page":"1455","DOI":"10.1093\/logcom\/exp033","volume":"19","author":"MJ Gabbay","year":"2009","unstructured":"Gabbay, M.J., Mathijssen, A.: Nominal (universal) algebra: equational logic with names and binding. J. Logic Comput. 19(6), 1455\u20131508 (2009)","journal-title":"J. Logic Comput."},{"key":"6_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","volume":"50","author":"J-Y Girard","year":"1987","unstructured":"Girard, J.-Y.: Linear logic. Theoret. Comput. Sci. 50, 1\u2013102 (1987)","journal-title":"Theoret. Comput. Sci."},{"key":"6_CR9","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1007\/978-3-642-15375-4_30","volume-title":"CONCUR 2010","author":"M Giunti","year":"2010","unstructured":"Giunti, M., Vasconcelos, V.T.: A linear account of session types in the Pi calculus. In: Gastin, P., Laroussinie, F. (eds.) CONCUR 2010. LNCS, vol. 6269, pp. 432\u2013446. Springer, Heidelberg (2010)"},{"key":"6_CR10","series-title":"LNCS","first-page":"509","volume-title":"CONCUR 1993","author":"K Honda","year":"1993","unstructured":"Honda, K.: Types for dynamic interaction. In: Best, E. (ed.) CONCUR 1993. LNCS, vol. 715, pp. 509\u2013523. Springer, Heidelberg (1993)"},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"Honda, K.: Composing processes. In: Proceedings of POPL 1996, pp. 344\u2013357 (1996)","DOI":"10.1145\/237721.237802"},{"key":"6_CR12","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1007\/978-3-642-16164-3_3","volume-title":"Model Checking Software","author":"K K\u00e4hk\u00f6nen","year":"2010","unstructured":"K\u00e4hk\u00f6nen, K., Kindermann, R., Heljanko, K., Niemel\u00e4, I.: Experimental comparison of concolic and random testing for Java card applets. In: Pol, J., Weber, M. (eds.) Model Checking Software. LNCS, vol. 6349, pp. 22\u201339. Springer, Heidelberg (2010)"},{"key":"6_CR13","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)"},{"issue":"5","key":"6_CR14","doi-asserted-by":"publisher","first-page":"914","DOI":"10.1145\/330249.330251","volume":"21","author":"N Kobayashi","year":"1999","unstructured":"Kobayashi, N., Pierce, B.C., Turner, D.N.: Linearity and the pi-calculus. ACM Trans. Program. Lang. Syst. 21(5), 914\u2013947 (1999)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"6_CR15","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/11817949_16","volume-title":"CONCUR 2006","author":"N Kobayashi","year":"2006","unstructured":"Kobayashi, N.: A new type system for deadlock-free processes. In: Baier, Ch., Hermanns, H. (eds.) CONCUR 2006. LNCS, vol. 4137, pp. 233\u2013247. Springer, Heidelberg (2006)"},{"key":"6_CR16","doi-asserted-by":"crossref","unstructured":"Yoshida, N., Berger, M., Honda, K.: Strong normalisation in the $$\\pi $$-calculus. In: Proceedings of LICS 2001, pp. 311\u2013322. IEEE (2001)","DOI":"10.1109\/LICS.2001.932507"},{"issue":"2\/3","key":"6_CR17","first-page":"83","volume":"42","author":"N Yoshida","year":"2005","unstructured":"Yoshida, N., Berger, M., Honda, K.: Genericity and the $$\\pi $$-calculus. Acta Inf. 42(2\/3), 83\u2013141 (2005)","journal-title":"Acta Inf."}],"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_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T20:35:51Z","timestamp":1746131751000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-05119-2_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319051185","9783319051192"],"references-count":17,"aliases":["10.1007\/978-3-319-14128-2_6"],"URL":"https:\/\/doi.org\/10.1007\/978-3-319-05119-2_6","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"}}]}}