{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,14]],"date-time":"2025-05-14T18:43:20Z","timestamp":1747248200735},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540285847"},{"type":"electronic","value":"9783540319719"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11547662_9","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T14:36:20Z","timestamp":1127831780000},"page":"102-117","source":"Crossref","is-referenced-by-count":25,"title":["Data-Abstraction Refinement: A Game Semantic Approach"],"prefix":"10.1007","author":[{"given":"Aleksandar","family":"Dimovski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dan R.","family":"Ghica","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ranko","family":"Lazi\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","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.R., Murawski, A.S., 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":"9_CR2","doi-asserted-by":"crossref","unstructured":"Abramsky, S., Jagadeesan, R., Malacaria, P.: Full abstraction for PCF. Information and Computation\u00a0163(2) (2000)","DOI":"10.1006\/inco.2000.2930"},{"key":"9_CR3","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":"9_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/3-540-46002-0_12","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"T. Ball","year":"2002","unstructured":"Ball, T., Podelski, A., Rajamani, S.K.: Relative completeness of abstraction refinement for software model checking. In: Katoen, J.-P., Stevens, P. (eds.) TACAS 2002. LNCS, vol.\u00a02280, pp. 158\u2013172. Springer, Heidelberg (2002)"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Ball, T., Rajamani, S.K.: Debugging System Software via Static Analysis. In: Proceedings of POPL, ACM SIGPLAN Notices, vol.\u00a037(1), pp. 1\u20133 (2002)","DOI":"10.1145\/565816.503274"},{"key":"9_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/10722167_15","volume-title":"Computer Aided Verification","author":"E.M. Clarke","year":"2000","unstructured":"Clarke, E.M., Grumberg, O., Jha, S., Lu, Y., Veith, H.: Counterexample-guided abstraction refinement. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol.\u00a01855, pp. 154\u2013169. Springer, Heidelberg (2000)"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Cousot, P., Cousot, R.: Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: Proceedings of POPL, pp. 238\u2013252 (1977)","DOI":"10.1145\/512950.512973"},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/3-540-45937-5_13","volume-title":"Compiler Construction","author":"P. Cousot","year":"2002","unstructured":"Cousot, P., Cousot, R.: Modular static program analysis. In: Horspool, R.N. (ed.) CC 2002. LNCS, vol.\u00a02304, p. 159. Springer, Heidelberg (2002)"},{"key":"9_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/978-3-540-30482-1_18","volume-title":"Formal Methods and Software Engineering","author":"A. Dimovski","year":"2004","unstructured":"Dimovski, A., Lazic, R.: CSP representation of game semantics for second-order idealized algol. In: Davies, J., Schulte, W., Barnett, M. (eds.) ICFEM 2004. LNCS, vol.\u00a03308, pp. 146\u2013161. Springer, Heidelberg (2004)"},{"issue":"1-3","key":"9_CR10","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-3), 469\u2013502 (2003)","journal-title":"Theoretical Computer Science"},{"key":"9_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/978-3-540-24727-2_16","volume-title":"Foundations of Software Science and Computation Structures","author":"D.R. Ghica","year":"2004","unstructured":"Ghica, D.R., Murawski, A.S.: Angelic semantics of fine-grained concurrency. In: Walukiewicz, I. (ed.) FOSSACS 2004. LNCS, vol.\u00a02987, pp. 211\u2013225. Springer, Heidelberg (2004)"},{"key":"9_CR12","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)"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Hankin, C., Malacaria, P.: Program analysis games. ACM Comput. Surv.\u00a031(3) (1999)","DOI":"10.1145\/333580.333584"},{"key":"9_CR14","unstructured":"Harmer, R.: Games and Full Abstraction for Nondeterministic Languages. Ph. D. Thesis Imperial College (1999)"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Harmer, R., McCusker, G.: A fully abstract game semantics for finite nondeterminism. In: Proceedings of LICS (1999)","DOI":"10.1109\/LICS.1999.782637"},{"key":"9_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/3-540-44829-2_17","volume-title":"Model Checking Software","author":"T.A. Henzinger","year":"2003","unstructured":"Henzinger, T.A., Jhala, R., Majumdar, R., Sutre, G.: Software verification with BLAST. In: Ball, T., Rajamani, S.K. (eds.) SPIN 2003. LNCS, vol.\u00a02648, pp. 235\u2013239. Springer, Heidelberg (2003)"},{"key":"9_CR17","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\u2013400 (2000)","journal-title":"Information and Computation"},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"Laird, J.: A fully abstract game semantics of local exceptions. In: Proceedings of LICS (2001)","DOI":"10.1109\/LICS.2001.932487"},{"key":"9_CR19","doi-asserted-by":"crossref","unstructured":"Malacaria, P., Hankin, C.: Generalised flowcharts and games. In: Proceedings of ICALP (1998)","DOI":"10.1007\/BFb0055067"},{"key":"9_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/BFb0026425","volume-title":"Compiler Construction","author":"P. Malacaria","year":"1998","unstructured":"Malacaria, P., Hankin, C.: A new approach to control flow analysis. In: Koskimies, K. (ed.) CC 1998. LNCS, vol.\u00a01383, pp. 95\u2013108. Springer, Heidelberg (1998)"},{"key":"9_CR21","doi-asserted-by":"crossref","unstructured":"Malacaria, P., Hankin, C.: Non-deterministic games and program analysis: An application to security. In: Proceedings of LICS (1999)","DOI":"10.1109\/LICS.1999.782639"},{"key":"9_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/978-3-540-31871-2_18","volume-title":"Information Retrieval Technology","author":"A. Murawski","year":"2005","unstructured":"Murawski, A., Walukiewicz, I.: Third-Order Idealized Algol with Iteration Is Decidable. In: Myaeng, S.-H., Zhou, M., Wong, K.-F., Zhang, H.-J. (eds.) AIRS 2004. LNCS, vol.\u00a03411, pp. 202\u2013218. Springer, Heidelberg (2005)"},{"key":"9_CR23","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)"}],"container-title":["Lecture Notes in Computer Science","Static Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11547662_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:57:54Z","timestamp":1619506674000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11547662_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540285847","9783540319719"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/11547662_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}