{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T21:04:22Z","timestamp":1776373462711,"version":"3.51.2"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540734192","type":"print"},{"value":"9783540734208","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73420-8_58","type":"book-chapter","created":{"date-parts":[[2007,8,25]],"date-time":"2007-08-25T10:58:43Z","timestamp":1188039523000},"page":"667-679","source":"Crossref","is-referenced-by-count":27,"title":["A Fully Abstract Trace Semantics for General References"],"prefix":"10.1007","author":[{"given":"James","family":"Laird","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"58_CR1","doi-asserted-by":"crossref","unstructured":"Abramsky, S., Honda, K., McCusker, G.: A fully abstract games semantics for general references. In: LICS 1998. Proceedings of the 13th Annual Symposium on Logic In Computer Science (1998)","DOI":"10.1109\/LICS.1998.705669"},{"key":"58_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45413-6_7","volume-title":"Typed Lambda Calculi and Applications","author":"M. Berger","year":"2001","unstructured":"Berger, M., Honda, K., Yoshida, N.: Sequentiality and the \u03c0-calculus. In: Abramsky, S. (ed.) TLCA 2001. LNCS, vol.\u00a02044, Springer, Heidelberg (2001)"},{"key":"58_CR3","volume-title":"Proceedings of LICS 2005","author":"M. Berger","year":"2005","unstructured":"Berger, M., Honda, K., Yoshida, N.: An observationally complete program logic for imperative higher-order functions. In: Proceedings of LICS 2005, IEEE Computer Society Press, Los Alamitos (2005)"},{"key":"58_CR4","doi-asserted-by":"crossref","unstructured":"Danos, V., Herbelin, H., Regnier, L.: Games semantics and abstract machines. In: LICS 1996. Proceedings of the eleventh International Symposium on Logic In Computer Science (1996)","DOI":"10.1109\/LICS.1996.561456"},{"key":"58_CR5","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1145\/224164.224189","volume-title":"Proceedings of the 7th ACM Conference on Functional Programming Languages and Computer Architecture","author":"J.M.E. Hyland","year":"1995","unstructured":"Hyland, J.M.E., Ong, C.-H.L.: Pi-calculus, dialogue games and PCF. In: Proceedings of the 7th ACM Conference on Functional Programming Languages and Computer Architecture, pp. 96\u2013107. ACM Press, New York (1995)"},{"key":"58_CR6","volume-title":"Proceedings of LICS 1999","author":"A. Jeffrey","year":"1999","unstructured":"Jeffrey, A., Rathke, J.: Towards a theory of bisimulation for local names. In: Proceedings of LICS 1999, IEEE Press, Los Alamitos (1999)"},{"key":"58_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1007\/978-3-540-31987-0_29","volume-title":"Programming Languages and Systems","author":"A. Jeffrey","year":"2005","unstructured":"Jeffrey, A., Rathke, J.: Java jr.: Fully abstract trace semantics for a core java language. In: Sagiv, M. (ed.) ESOP 2005. LNCS, vol.\u00a03444, pp. 423\u2013438. Springer, Heidelberg (2005)"},{"key":"58_CR8","doi-asserted-by":"crossref","unstructured":"Koutavas, V., Wand, M.: Small bisimulations for reasoning about higher-order imperative programs. In: Proceedings of POPL 2006, pp. 141\u2013152 (2006)","DOI":"10.1145\/1111037.1111050"},{"key":"58_CR9","unstructured":"Laird, J.: A game semantics of names and pointers. To appear in Annals of Pure and Applied Logic (2006)"},{"key":"58_CR10","unstructured":"Sangiorgi, D.: Expressing Mobility in Process Algebras: First-Order and Higher-Order Paradigms. PhD thesis, University of Edinburgh (1993)"},{"key":"58_CR11","doi-asserted-by":"crossref","unstructured":"Sanjabi, S., Ong, C.-H.L.: Fully abstract semantics of additive aspects by translation. To appear in proc. In: AOSD 2007 (2007)","DOI":"10.1145\/1218563.1218579"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73420-8_58.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:11:20Z","timestamp":1619503880000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73420-8_58"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540734192","9783540734208"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73420-8_58","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[]}}