{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T14:16:02Z","timestamp":1726409762362},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319522272"},{"type":"electronic","value":"9783319522289"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-52228-9_6","type":"book-chapter","created":{"date-parts":[[2017,1,10]],"date-time":"2017-01-10T04:23:43Z","timestamp":1484022223000},"page":"114-133","source":"Crossref","is-referenced-by-count":0,"title":["UTP Semantics of Reactive Processes with Continuations"],"prefix":"10.1007","author":[{"given":"Gerard Ekembe","family":"Ngondi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jim","family":"Woodcock","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,1,11]]},"reference":[{"key":"6_CR1","volume-title":"Unifying Theories of Programming","author":"CAR Hoare","year":"1998","unstructured":"Hoare, C.A.R., He, J.: Unifying Theories of Programming. Prentice-Hall, Upper Saddle River (1998)"},{"key":"6_CR2","volume-title":"Communicating Sequential Processes","author":"CAR Hoare","year":"1985","unstructured":"Hoare, C.A.R.: Communicating Sequential Processes. Prentice-Hall, Upper Saddle River (1985)"},{"key":"6_CR3","volume-title":"The Theory and Practice of Concurrency","author":"AW Roscoe","year":"1998","unstructured":"Roscoe, A.W.: The Theory and Practice of Concurrency. Prentice-Hall, Upper Saddle River (1998)"},{"key":"6_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1007\/11889229_6","volume-title":"Refinement Techniques in Software Engineering","author":"A Cavalcanti","year":"2006","unstructured":"Cavalcanti, A., Woodcock, J.: A tutorial introduction to CSP in unifying theories of programming. In: Cavalcanti, A., Sampaio, A., Woodcock, J. (eds.) PSSE 2004. LNCS, vol. 3167, pp. 220\u2013268. Springer, Heidelberg (2006). doi: 10.1007\/11889229_6"},{"key":"6_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/978-3-540-27764-4_20","volume-title":"Mathematics of Program Construction","author":"X Tang","year":"2004","unstructured":"Tang, X., Woodcock, J.: Travelling processes. In: Kozen, D. (ed.) MPC 2004. LNCS, vol. 3125, pp. 381\u2013399. Springer, Heidelberg (2004). doi: 10.1007\/978-3-540-27764-4_20"},{"key":"6_CR6","unstructured":"Tang, X., Woodcock, J.: Towards mobile processes in UTP. In: SEFM 2004, pp. 44\u201353. IEEE (2004)"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Fuggetta, A., Picco, G.P., Vigna, G.: Understanding code mobility. In: TSE 1998, vol. 24, pp. 342\u2013361. IEEE (1998)","DOI":"10.1109\/32.685258"},{"key":"6_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/3-540-36103-0_5","volume-title":"Formal Methods and Software Engineering","author":"J Woodcock","year":"2002","unstructured":"Woodcock, J., Hughes, A.: Unifying theories of parallel programming. In: George, C., Miao, H. (eds.) ICFEM 2002. LNCS, vol. 2495, pp. 24\u201337. Springer, Heidelberg (2002). doi: 10.1007\/3-540-36103-0_5"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"Jahnig, N., Gothel, T., Glesner, S.: A denotational semantics for communicating unstructured code. In: FESCA 2015, EPTCS, vol. 178, pp. 9\u201321 (2015)","DOI":"10.4204\/EPTCS.178.2"},{"key":"6_CR10","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/BF01019459","volume":"6","author":"JC Reynolds","year":"1993","unstructured":"Reynolds, J.C.: The discoveries of continuations. LISP Symbolic Comput. 6, 233\u2013247 (1993)","journal-title":"LISP Symbolic Comput."},{"key":"6_CR11","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1023\/A:1010026413531","volume":"13","author":"C Strachey","year":"2000","unstructured":"Strachey, C., Wadsworth, C.P.: Continuations: a mathematical semantics for handling full jumps. Higher-Order Symbolic Comput. 13, 135\u2013152 (2000)","journal-title":"Higher-Order Symbolic Comput."},{"key":"6_CR12","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1017\/S0960129500001535","volume":"2","author":"O Danvy","year":"1992","unstructured":"Danvy, O., Filinski, A.: Representing control: a study of the CPS transformation. Math. Struct. Comp. Sci. 2, 361\u2013391 (1992)","journal-title":"Math. Struct. Comp. Sci."},{"key":"6_CR13","unstructured":"Felleisen, M., Friedman, D.P., Duba, B.F., Merrill, J.: Beyond continuations. Technical report, Indiana University Computer Science Department (1987)"},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"Giorgi, J.F., LeMetayer, D.: Continuation-based parallel implementations of functional languages. In: LFP 1990, pp. 209\u2013217. ACM (1990)","DOI":"10.1145\/91556.91648"},{"key":"6_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/3-540-58402-1_14","volume-title":"Programming Language Implementation and Logic Programming","author":"L Moreau","year":"1994","unstructured":"Moreau, L., Queinnec, C.: Partial continuations as the difference of continuations a duumvirate of control operators. In: Hermenegildo, M., Penjam, J. (eds.) PLILP 1994. LNCS, vol. 844, pp. 182\u2013197. Springer, Heidelberg (1994). doi: 10.1007\/3-540-58402-1_14"},{"key":"6_CR16","doi-asserted-by":"crossref","unstructured":"Todoran, E., Papaspyrou, N.S.: Continuations for parallel logic programming. In: PPDP 2000, pp. 257\u2013267. ACM (2000)","DOI":"10.1145\/351268.351297"}],"container-title":["Lecture Notes in Computer Science","Unifying Theories of Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-52228-9_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,25]],"date-time":"2017-06-25T07:45:57Z","timestamp":1498376757000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-52228-9_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319522272","9783319522289"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-52228-9_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}