{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:14:10Z","timestamp":1725549250451},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540238416"},{"type":"electronic","value":"9783540304821"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30482-1_18","type":"book-chapter","created":{"date-parts":[[2010,3,1]],"date-time":"2010-03-01T16:27:38Z","timestamp":1267460858000},"page":"146-161","source":"Crossref","is-referenced-by-count":7,"title":["CSP Representation of Game Semantics for Second-Order Idealized Algol"],"prefix":"10.1007","author":[{"given":"Aleksandar","family":"Dimovski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ranko","family":"Lazi\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"Abramsky, S., McCusker, G.: Linearity, sharing and state: a fully abstract game semantics for Idealized Algol with active expressions. In: O\u2019Hearn, P.W., Tennent, R.D. (eds.) Algol-like languages, Birkha\u00fcser (1997)","DOI":"10.1007\/978-1-4757-3851-3_10"},{"key":"18_CR2","unstructured":"Abramsky, S.: Algorithmic game semantics: A tutorial introduction. Lecture notes, Marktoberdorf International Summer School\u00a02001 (2001)"},{"key":"18_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/978-3-540-24730-2_32","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"S. Abramsky","year":"2004","unstructured":"Abramsky, S., Ghica, D., Murawski, A., Ong, C.-H.L.: Applying Game Semantics to Compositional Software Modeling and Verification. In: Jensen, K., Podelski, A. (eds.) TACAS 2004. LNCS, vol.\u00a02988, pp. 421\u2013435. Springer, Heidelberg (2004)"},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"Ball, T., Rajamani, S.K.: The SLAM Project: Debugging System Software via Static Analysis. In: Proceedings of POPL, ACM SIGPLAN Notices, January 2002, vol.\u00a037(1) (2002)","DOI":"10.1145\/565816.503274"},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"Dimovski, A., Lazi\u0107, R.: CSP Representation of Game Semantics for Second-order Idealized Algol. Research Report, Department of Computer Science, University of Warwick (May 2004)","DOI":"10.1007\/978-3-540-30482-1_18"},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"Farias, A., Mota, A., Sampaio, A.: Efficient CSP_Z Data Abstraction. In: Boiten, E.A., Derrick, J., Smith, G.P. (eds.) IFM 2004. LNCS, vol.\u00a02999, pp. 108\u2013127. Springer, Heidelberg (2004)","DOI":"10.1007\/978-3-540-24756-2_7"},{"key":"18_CR7","unstructured":"Formal Systems (Europe) Ltd. Failures-Divergence Refinement: FDR2 Manual (2000)"},{"key":"18_CR8","unstructured":"Ghica, D.: Game-based Software Model Checking: Case Studies and Methodological Considerations. Oxford University Computing Lab, Technical Report PRG-RR-03-11 (May 2003)"},{"issue":"1\u20133","key":"18_CR9","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1016\/S0304-3975(03)00315-3","volume":"309","author":"D. Ghica","year":"2003","unstructured":"Ghica, D., McCusker, G.: The Regular-Language Semantics of Second-order Idealized Algol. Theoretical Computer Science\u00a0309(1\u20133), 469\u2013502 (2003)","journal-title":"Theoretical Computer Science"},{"key":"18_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"683","DOI":"10.1007\/978-3-540-27836-8_58","volume-title":"Automata, Languages and Programming","author":"D. Ghica","year":"2004","unstructured":"Ghica, D., Murawski, A., Ong, C.-H.L.: Syntactic Control of Concurrency. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142, pp. 683\u2013694. Springer, Heidelberg (2004)"},{"key":"18_CR11","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1006\/inco.2000.2917","volume":"163","author":"J.M.E. Hyland","year":"2000","unstructured":"Hyland, J.M.E., Ong, C.-H.L.: On full abstraction for PCF: I, II and III. Information and Computation\u00a0163, 285\u2013408 (2000)","journal-title":"Information and Computation"},{"key":"18_CR12","unstructured":"Lazi\u0107, R.: A Semantic Study of Data Independence with Applications to Model Checking. DPhil thesis, Computing Laboratory, Oxford University (1999)"},{"key":"18_CR13","volume-title":"Proceedings of LICS","author":"C.-H.L. Ong","year":"2002","unstructured":"Ong, C.-H.L.: Observational equivalence of 3rd-order Idealised Algol is Decidable. In: Proceedings of LICS, July 2002. IEEE, Los Alamitos (2002)"},{"key":"18_CR14","unstructured":"Reynolds, J.C.: The essence of Algol. In: Proceedings of ISAL, Amsterdam, Holland, pp. 345\u2013372 (1981)"},{"key":"18_CR15","unstructured":"Roggenbach, M.: CSP-CASL \u2014 A new Integration of Process Algebra and Algebraic Specification. In: Proceedings of AMiLP, TWLT 21, Universiteit Twente (2003)"},{"key":"18_CR16","series-title":"Lecture Notes in Computer Science","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"A.W. Roscoe","year":"1995","unstructured":"Roscoe, A.W., Gardiner, P.H.B., Goldsmith, M.H., Hulance, J.R., Jackson, D.M., Scattergod, J.B.: Hierarchical compression for model-checking CSP or how to check 1020 dining philosophers for deadlock. In: Brinksma, E., Steffen, B., Cleaveland, W.R., Larsen, K.G., Margaria, T. (eds.) TACAS 1995. LNCS, vol.\u00a01019. Springer, Heidelberg (1995)"},{"key":"18_CR17","volume-title":"The Theory and Practice of Concurrency","author":"A.W. Roscoe","year":"1998","unstructured":"Roscoe, A.W.: The Theory and Practice of Concurrency. Prentice-Hall, Englewood Cliffs (1998)"}],"container-title":["Lecture Notes in Computer Science","Formal Methods and Software Engineering"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30482-1_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:54:30Z","timestamp":1605761670000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30482-1_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540238416","9783540304821"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30482-1_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}