{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T00:10:24Z","timestamp":1742602224382,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540631415"},{"type":"electronic","value":"9783540691884"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-63141-0_27","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T23:09:13Z","timestamp":1330297753000},"page":"391-405","source":"Crossref","is-referenced-by-count":7,"title":["On implementations and semantics of a concurrent programming language"],"prefix":"10.1007","author":[{"given":"Peter","family":"Sewell","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"27_CR1","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/0304-3975(87)90065-X","volume":"53","author":"S. Abramsky","year":"1987","unstructured":"Samson Abramsky. Observation equivalence as a testing equivalence. Theoretical Computer Science, 53:225\u2013241, 1987.","journal-title":"Theoretical Computer Science"},{"key":"27_CR2","doi-asserted-by":"crossref","unstructured":"Roberto M. Amadio, Ilaria Castellani, and Davide Sangiorgi. On bisimulations for the asynchronous \u03c0-calculus. In Montanari and Sassone [MS96], pages 147\u2013162.","DOI":"10.1007\/3-540-61604-7_53"},{"key":"27_CR3","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1017\/S0960129500000189","volume":"3","author":"S. Abramsky","year":"1993","unstructured":"S. Abramsky and S. J. Vickers. Quantales, observational logic and process semantics. Mathematical Structures in Computer Science, 3:161\u2013227, 1993.","journal-title":"Mathematical Structures in Computer Science"},{"key":"27_CR4","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1006\/inco.1995.1114","volume":"120","author":"M. Boreale","year":"1995","unstructured":"Michele Boreale and Rocco De Nicola. Testing equivalences for mobile processes. Information and Computation, 120:279\u2013303, 1995.","journal-title":"Information and Computation"},{"key":"27_CR5","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0304-3975(84)90113-0","volume":"34","author":"R. Nicola De","year":"1984","unstructured":"R. De Nicola and M. C. B. Hennessy. Testing equivalences for processes. Theoretical Computer Science, 34:83\u2013133, 1984.","journal-title":"Theoretical Computer Science"},{"key":"27_CR6","doi-asserted-by":"crossref","unstructured":"C\u00e9dric Fournet and Georges Gonthier. The reflexive CHAM and the joincalculus. In POPL'96 [POP96], pages 372\u2013385.","DOI":"10.1145\/237721.237805"},{"key":"27_CR7","doi-asserted-by":"crossref","unstructured":"R. J. van Glabeek. The linear time \u2014 branching time spectrum. In Proceedings CONCUR '90, LNCS 458, pages 278\u2013297, 1990.","DOI":"10.1007\/BFb0039066"},{"key":"27_CR8","doi-asserted-by":"crossref","unstructured":"R. J. van Glabbeek. The linear time \u2014 branching time spectrum II (the semantics of sequential systems with silent moves). In Proceedings of CONCUR '93, LNCS 715, pages 66\u201381, 1993.","DOI":"10.1007\/3-540-57208-2_6"},{"key":"27_CR9","unstructured":"M. Hennessy. A model for the \u03c0-calculus. Technical Report 91:08, University of Sussex, 1991."},{"key":"27_CR10","doi-asserted-by":"crossref","unstructured":"Matthew Hennessy and Robin Milner. On observing nondeterminism and concurrency. In Proceedings 7th ICALP, LNCS 85, pages 299\u2013309, 1980.","DOI":"10.1007\/3-540-10003-2_79"},{"key":"27_CR11","unstructured":"C. A. R. Hoare. Communicating Sequential Processes. Series in Computer Science. Prentice-Hall International, 1985."},{"key":"27_CR12","doi-asserted-by":"crossref","unstructured":"Simon Peyton Jones, Andrew Gordon, and Sigbjorn Finne. Concurrent Haskell. In POPL'96 [POP96], pages 295\u2013308.","DOI":"10.1145\/237721.237794"},{"issue":"2","key":"27_CR13","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF00122417","volume":"8","author":"C. B. Jones","year":"1996","unstructured":"C. B. Jones. Accommodating interference in the formal design of concurrent object-based programs. Formal Methods in System Design, 8(2):105\u2013122, March 1996.","journal-title":"Formal Methods in System Design"},{"key":"27_CR14","doi-asserted-by":"crossref","unstructured":"Robin Milner. A modal characterisation of observable machine-behaviour. In Proceedings CAAP '81, LNCS 112, pages 25\u201334, 1981.","DOI":"10.1007\/3-540-10828-9_52"},{"issue":"1","key":"27_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0890-5401(92)90008-4","volume":"100","author":"R. Milner","year":"1992","unstructured":"R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes, Parts I + II. Information and Computation, 100(1):1\u201377, 1992.","journal-title":"Information and Computation"},{"key":"27_CR16","unstructured":"Ugo Montanari and Vladimiro Sassone, editors. Proceedings CONCUR 96, Pisa, Italy, volume 1119 of Lecture Notes in Computer Science. Springer-Verlag, 1996."},{"key":"27_CR17","doi-asserted-by":"crossref","unstructured":"Uwe Nestmann and Benjamin C. Pierce. Decoding choice encodings. In Montanari and Sassone [MS96], pages 179\u2013194.","DOI":"10.1007\/3-540-61604-7_55"},{"key":"27_CR18","unstructured":"Conference Record of the 23rd ACM Symposium on Principles of Programming Languages, 1996."},{"key":"27_CR19","doi-asserted-by":"crossref","unstructured":"Benjamin Pierce and Davide Sangiorgi. Typing and subtyping for mobile processes. Mathematical Structures in Computer Science, 6(5), 1996.","DOI":"10.1017\/S096012950007002X"},{"key":"27_CR20","unstructured":"Benjamin C. Pierce and David N. Turner. Pict: A programming language based on the pi-calculus. Technical report, Computer Science Department, Indiana University, 1997. To appear in Milner festschrift, MIT Press."},{"key":"27_CR21","doi-asserted-by":"crossref","unstructured":"Anna Philippou and David Walker. On transformations of concurrent object programs. In Montanari and Sassone [MS96], pages 131\u2013146.","DOI":"10.1007\/3-540-61604-7_52"},{"key":"27_CR22","unstructured":"John Hamilton Reppy. Higher-Order Concurrency. PhD thesis, Cornell University, June 1992. Technical Report TR 92-1285."},{"key":"27_CR23","unstructured":"Davide Sangiorgi. Expressing Mobility in Process Algebras: First-Order and Higher-Order Paradigms. PhD thesis, University of Edinburgh, 1993."},{"key":"27_CR24","doi-asserted-by":"crossref","unstructured":"Bent Thomsen, Lone Leth, and Tsung-Min Kuo. A Facile tutorial. In Montanari and Sassone [MS96], pages 278\u2013298.","DOI":"10.1007\/3-540-61604-7_61"},{"key":"27_CR25","unstructured":"David N. Turner. The Polymorphic Pi-calculus: Theory and Implementation. PhD thesis, University of Edinburgh, 1996."},{"key":"27_CR26","doi-asserted-by":"crossref","unstructured":"D. J. Walker. Bisimulations and divergence. In Proc. 3rd IEEE Symposium on Logic in Computer Science, pages 186\u2013192, 1988.","DOI":"10.1109\/LICS.1988.5117"}],"container-title":["Lecture Notes in Computer Science","CONCUR '97: Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-63141-0_27.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T23:37:57Z","timestamp":1742600277000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-63141-0_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540631415","9783540691884"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/3-540-63141-0_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}