{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T17:51:52Z","timestamp":1725731512765},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642396137"},{"type":"electronic","value":"9783642396144"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-39614-4_9","type":"book-chapter","created":{"date-parts":[[2013,6,12]],"date-time":"2013-06-12T20:02:56Z","timestamp":1371067376000},"page":"128-143","source":"Crossref","is-referenced-by-count":0,"title":["Verifying Data Independent Programs Using Game Semantics"],"prefix":"10.1007","author":[{"given":"Aleksandar S.","family":"Dimovski","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","volume-title":"Algol-like languages","author":"S. Abramsky","year":"1997","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, Boston (1997)"},{"key":"9_CR2","first-page":"1","volume-title":"Proceedings of the 1997 Marktoberdorf Summer School: Computational Logic","author":"S. Abramsky","year":"1998","unstructured":"Abramsky, S., McCusker, G.: Game Semantics. In: Proceedings of the 1997 Marktoberdorf Summer School: Computational Logic, pp. 1\u201356. Springer, Heidelberg (1998)"},{"key":"9_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/11547662_9","volume-title":"Static Analysis","author":"A. Dimovski","year":"2005","unstructured":"Dimovski, A., Ghica, D.R., Lazi\u0107, R.: Data-Abstraction Refinement: A Game Semantic Approach. In: Hankin, C., Siveroni, I. (eds.) SAS 2005. LNCS, vol.\u00a03672, pp. 102\u2013117. Springer, Heidelberg (2005)"},{"issue":"1","key":"9_CR4","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/s10009-006-0005-y","volume":"9","author":"A. Dimovski","year":"2007","unstructured":"Dimovski, A., Lazi\u0107, R.: Compositional Software Verification Based on Game Semantics and Process Algebras. Int. Journal on STTT\u00a09(1), 37\u201351 (2007)","journal-title":"Int. Journal on STTT"},{"key":"9_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/978-3-642-16265-7_10","volume-title":"Integrated Formal Methods","author":"A. Dimovski","year":"2010","unstructured":"Dimovski, A.: A Compositional Method for Deciding Equivalence and Termination of Nondeterministic Programs. In: M\u00e9ry, D., Merz, S. (eds.) IFM 2010. LNCS, vol.\u00a06396, pp. 121\u2013135. Springer, Heidelberg (2010)"},{"issue":"1\u20133","key":"9_CR6","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1016\/S0304-3975(03)00315-3","volume":"309","author":"D.R. Ghica","year":"2003","unstructured":"Ghica, D.R., 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":"9_CR7","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.R. Ghica","year":"2004","unstructured":"Ghica, D.R., Murawski, A.S., 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)"},{"unstructured":"Hughes, D.J.D.: Hypergame Semantics: Full Completness for System F. D. Phil. Thesis, Oxford University (1999)","key":"9_CR8"},{"key":"9_CR9","first-page":"41","volume-title":"Proceedings of LICS 2010. IEEE","author":"J. Laird","year":"2010","unstructured":"Laird, J.: Game Semantics for a Polymorphic Programming Language. In: Proceedings of LICS 2010. IEEE, pp. 41\u201349. IEEE, Los Alamitos (2010)"},{"unstructured":"Lazi\u0107, R.: A Semantic Study of Data Independence with Applications to Model Checking. D. Phil. Thesis, Oxford University (1999)","key":"9_CR10"},{"key":"9_CR11","series-title":"Lecture Notes in Artificial Intelligence","first-page":"581","volume-title":"Infrastructure for Agents, Multi-Agent Systems, and Scalable Multi-Agent Systems","author":"R. Lazi\u0107","year":"2001","unstructured":"Lazi\u0107, R., Nowak, D.: A Unifying Approach to Data-Independence. In: Wagner, T.A., Rana, O.F. (eds.) AA-WS 2000. LNCS (LNAI), vol.\u00a01887, pp. 581\u2013595. Springer, Heidelberg (2001)"},{"key":"9_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/11539452_15","volume-title":"CONCUR 2005 \u2013 Concurrency Theory","author":"A.S. Murawski","year":"2005","unstructured":"Murawski, A.S., Ouaknine, J.: On Probabilistic Program Equivalence and Refinement. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol.\u00a03653, pp. 156\u2013170. Springer, Heidelberg (2005)"},{"key":"9_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-55511-0_1","volume-title":"Mathematical Foundations of Programming Semantics","author":"Q. Ma","year":"1992","unstructured":"Ma, Q., Reynolds, J.C.: Types, Abstraction, and Parametric Polymorphism, Part 2. In: Schmidt, D., Main, M.G., Melton, A.C., Mislove, M.W., Brookes, S.D. (eds.) MFPS 1991. LNCS, vol.\u00a0598, pp. 1\u201340. Springer, Heidelberg (1992)"},{"issue":"3","key":"9_CR14","doi-asserted-by":"publisher","first-page":"658","DOI":"10.1145\/210346.210425","volume":"42","author":"P.W. O\u2019Hearn","year":"1995","unstructured":"O\u2019Hearn, P.W., Tennent, R.D.: Parametricity and Local Variables. Journal of the ACM\u00a042(3), 658\u2013709 (1995)","journal-title":"Journal of the ACM"},{"key":"9_CR15","volume-title":"Theory and Practice of Concurrency","author":"W.A. Roscoe","year":"1998","unstructured":"Roscoe, W.A.: Theory and Practice of Concurrency. Prentice-Hall, Englewood Cliffs (1998)"},{"key":"9_CR16","first-page":"347","volume-title":"FPCA 1989","author":"P. Wadler","year":"1989","unstructured":"Wadler, P.: Theorems for Free! In: FPCA 1989, pp. 347\u2013379. ACM, New York (1989)"}],"container-title":["Lecture Notes in Computer Science","Software Composition"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-39614-4_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T23:23:26Z","timestamp":1557789806000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-39614-4_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642396137","9783642396144"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39614-4_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}