{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:06:05Z","timestamp":1740096365412,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642401831"},{"type":"electronic","value":"9783642401848"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40184-8_13","type":"book-chapter","created":{"date-parts":[[2013,7,22]],"date-time":"2013-07-22T21:50:56Z","timestamp":1374529856000},"page":"167-181","source":"Crossref","is-referenced-by-count":2,"title":["Symbolic Bisimulation for a Higher-Order Distributed Language with Passivation"],"prefix":"10.1007","author":[{"given":"Vasileios","family":"Koutavas","sequence":"first","affiliation":[]},{"given":"Matthew","family":"Hennessy","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/3-540-59293-8_196","volume-title":"TAPSOFT \u201995: Theory and Practice of Software Development","author":"R.M. Amadio","year":"1995","unstructured":"Amadio, R.M., Dam, M.: Reasoning about higher-order processes. In: Mosses, P.D., Nielsen, M. (eds.) CAAP 1995, FASE 1995, and TAPSOFT 1995. LNCS, vol.\u00a0915, pp. 202\u2013216. Springer, Heidelberg (1995)"},{"issue":"1","key":"13_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ic.2004.11.005","volume":"201","author":"G. Castagna","year":"2005","unstructured":"Castagna, G., Vitek, J., Zappa Nardelli, F.: The Seal calculus. Information and Computation\u00a0201(1), 1\u201354 (2005)","journal-title":"Information and Computation"},{"key":"13_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1007\/11590156_11","volume-title":"FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science","author":"J.C.. Godskesen","year":"2005","unstructured":"Godskesen, J.C., Hildebrandt, T.: Extending Howes method to early bisimulations for typed mobile embedded resources with local names. In: Sarukkai, S., Sen, S. (eds.) FSTTCS 2005. LNCS, vol.\u00a03821, pp. 140\u2013151. Springer, Heidelberg (2005)"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Jeffrey, A., Rathke, J.: Contextual equivalence for higher-order pi-calculus revisited. LMCS\u00a01(1:4) (2005)","DOI":"10.2168\/LMCS-1(1:4)2005"},{"key":"13_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1007\/978-3-642-19718-5_19","volume-title":"Programming Languages and Systems","author":"V. Koutavas","year":"2011","unstructured":"Koutavas, V., Hennessy, M.: A testing theory for a higher-order cryptographic language. In: Barthe, G. (ed.) ESOP 2011. LNCS, vol.\u00a06602, pp. 358\u2013377. Springer, Heidelberg (2011), http:\/\/dx.doi.org\/10.1007\/978-3-642-19718-5_19"},{"issue":"3","key":"13_CR6","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1016\/j.cl.2012.04.003","volume":"38","author":"V. Koutavas","year":"2012","unstructured":"Koutavas, V., Hennessy, M.: First-order reasoning for higher-order concurrency. Computer Languages, Systems & Structures\u00a038(3), 242\u2013277 (2012)","journal-title":"Computer Languages, Systems & Structures"},{"issue":"11","key":"13_CR7","doi-asserted-by":"publisher","first-page":"1390","DOI":"10.1016\/j.ic.2011.08.002","volume":"209","author":"S. Lenglet","year":"2011","unstructured":"Lenglet, S.: Schmitt A, and Stefani J.-B. Characterizing contextual equivalence in calculi with passivation. Information and Computation\u00a0209(11), 1390\u20131433 (2011)","journal-title":"Information and Computation"},{"key":"13_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1007\/3-540-55719-9_114","volume-title":"Automata, Languages and Programming","author":"R. Milner","year":"1992","unstructured":"Milner, R., Sangiorgi, D.: Barbed bisimulation. In: Kuich, W. (ed.) ICALP 1992. LNCS, vol.\u00a0623, pp. 685\u2013695. Springer, Heidelberg (1992)"},{"key":"13_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-642-19805-2_9","volume-title":"Foundations of Software Science and Computational Structures","author":"A. Pi\u00e9rard","year":"2011","unstructured":"Pi\u00e9rard, A., Sumii, E.: Sound bisimulations for higher-order distributed process calculus. In: Hofmann, M. (ed.) FOSSACS 2011. LNCS, vol.\u00a06604, pp. 123\u2013137. Springer, Heidelberg (2011)"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Pierard, A., Sumii, E.: A higher-order distributed calculus with name creation. In: LICS, pp. 531\u2013540. IEEE Computer Society (June 2012)","DOI":"10.1109\/LICS.2012.63"},{"key":"13_CR11","unstructured":"Sangiorgi, D.: Expressing Mobility in Process Algebras: First-Order and Higher-Order Paradigms. PhD thesis, University of Edinburgh (1992)"},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"Sangiorgi, D.: From pi-calculus to higher-order pi-calculus\u2013and back. In: Gaudel, M.-C., Jouannaud, J.-P. (eds.) CAAP 1993, FASE 1993, and TAPSOFT 1993. LNCS, vol.\u00a0668, pp. 151\u2013166. Springer, Heidelberg (1993)","DOI":"10.1007\/3-540-56610-4_62"},{"issue":"5","key":"13_CR13","first-page":"447","volume":"8","author":"D. Sangiorgi","year":"1998","unstructured":"Sangiorgi, D.: On the bisimulation proof method. MSCS\u00a08(5), 447\u2013479 (1998)","journal-title":"MSCS"},{"key":"13_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/978-3-540-31794-4_9","volume-title":"Global Computing","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.\u00a03267, pp. 146\u2013178. Springer, Heidelberg (2005)"},{"key":"13_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/BFb0055619","volume-title":"CONCUR \u201998 Concurrency Theory","author":"J.-L. Vivas","year":"1998","unstructured":"Vivas, J.-L., Dam, M.: From higher-order \u03c0-calculus to \u03c0-calculus in the presence of static operators. In: Sangiorgi, D., de Simone, R. (eds.) CONCUR 1998. LNCS, vol.\u00a01466, pp. 115\u2013130. Springer, Heidelberg (1998)"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2013 \u2013 Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40184-8_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,18]],"date-time":"2019-07-18T23:41:29Z","timestamp":1563493289000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40184-8_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642401831","9783642401848"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40184-8_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}