{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,20]],"date-time":"2025-02-20T05:14:50Z","timestamp":1740028490534,"version":"3.37.3"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2010,3,14]],"date-time":"2010-03-14T00:00:00Z","timestamp":1268524800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int J Softw Tools Technol Transfer"],"published-print":{"date-parts":[[2010,9]]},"DOI":"10.1007\/s10009-010-0143-0","type":"journal-article","created":{"date-parts":[[2010,3,13]],"date-time":"2010-03-13T00:03:07Z","timestamp":1268438587000},"page":"373-389","source":"Crossref","is-referenced-by-count":0,"title":["Data-abstraction refinement: a game semantic approach"],"prefix":"10.1007","volume":"12","author":[{"given":"Adam","family":"Bakewell","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aleksandar","family":"Dimovski","sequence":"additional","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","published-online":{"date-parts":[[2010,3,14]]},"reference":[{"key":"143_CR1","doi-asserted-by":"crossref","unstructured":"Abramsky, S., Ghica, D.R., Murawski, A.S., Luke Ong, C.-H.: Applying game semantics to compositional software modeling and verification. In: TACAS, pp. 421\u2013435 (2004)","DOI":"10.1007\/978-3-540-24730-2_32"},{"key":"143_CR2","doi-asserted-by":"crossref","unstructured":"Abramsky, S., McCusker, G.: Linearity, sharing and state: a fully abstract game semantics for Idealized Algol with active expressions. Electr. Notes Theor. Comput. Sci. 3 (1996)","DOI":"10.1016\/S1571-0661(05)80398-6"},{"key":"143_CR3","doi-asserted-by":"crossref","unstructured":"Bakewell, A., Ghica, D.R.: On-the-fly techniques for game-based software model checking. In: TACAS, pp. 78\u201392 (2008)","DOI":"10.1007\/978-3-540-78800-3_7"},{"key":"143_CR4","doi-asserted-by":"crossref","unstructured":"Ball, T., Rajamani, S.K.: The SLAM toolkit. In: CAV, pp. 260\u2013264 (2001)","DOI":"10.1007\/3-540-44585-4_25"},{"key":"143_CR5","doi-asserted-by":"crossref","unstructured":"Cousot, P., Cousot, R.: Modular static program analysis. In: CC, pp.159\u2013178 (2002)","DOI":"10.1007\/3-540-45937-5_13"},{"issue":"2","key":"143_CR6","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1145\/234528.234740","volume":"28","author":"P. Cousot","year":"1996","unstructured":"Cousot P.: Abstract interpretation. ACM Comput. Surv. 28(2), 324\u2013328 (1996)","journal-title":"ACM Comput. Surv."},{"key":"143_CR7","doi-asserted-by":"crossref","unstructured":"Dimovski, A., Ghica, D.R., Lazi\u0107, R.: Data-abstraction refinement: a game semantic approach. In: SAS, pp. 102\u2013117 (2005)","DOI":"10.1007\/11547662_9"},{"key":"143_CR8","doi-asserted-by":"crossref","unstructured":"Dimovski, A., Ghica, D.R., Lazi\u0107, R.: A counterexample-guided refinement tool for open procedural programs. In: SPIN, pp. 288\u2013292 (2006)","DOI":"10.1007\/11691617_17"},{"key":"143_CR9","doi-asserted-by":"crossref","unstructured":"Dimovski, A., Lazi\u0107 R.: Assume-guarantee software verification based on game semantics. In: ICFEM. pp. 529\u2013548 (2006)","DOI":"10.1007\/11901433_29"},{"key":"143_CR10","doi-asserted-by":"crossref","unstructured":"Ghica, D.R., Bakewell, A.: Clipping: a semantics-directed syntactic approximation. In: LICS (2009, forthcoming)","DOI":"10.1109\/LICS.2009.25"},{"key":"143_CR11","doi-asserted-by":"crossref","unstructured":"Ghica, D.R.: Applications of game semantics: from software analysis to hardware synthesis. In: LICS, pp. 17\u201326 (2009)","DOI":"10.1109\/LICS.2009.26"},{"key":"143_CR12","doi-asserted-by":"crossref","unstructured":"Ghica, D.R., McCusker, G.: Reasoning about Idealized Algol using regular languages. In: ICALP, pp. 103\u2013115 (2000)","DOI":"10.1007\/3-540-45022-X_10"},{"issue":"1\u20133","key":"143_CR13","doi-asserted-by":"crossref","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. Theor. Comput. Sci 309(1\u20133), 469\u2013502 (2003)","journal-title":"Theor. Comput. Sci"},{"key":"143_CR14","doi-asserted-by":"crossref","unstructured":"Ghica, D.R., Murawski, A.S.: Compositional model extraction for higher-order concurrent programs. In: TACAS, pp. 303\u2013317 (2006)","DOI":"10.1007\/11691372_20"},{"issue":"2\u20133","key":"143_CR15","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/j.apal.2007.10.005","volume":"151","author":"D.R. Ghica","year":"2008","unstructured":"Ghica D.R., Murawski A.: Angelic semantics of fine-grained concurrency. Ann. Pure Appl. Logic 151(2\u20133), 89\u2013114 (2008)","journal-title":"Ann. Pure Appl. Logic"},{"issue":"2\u20133","key":"143_CR16","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1016\/j.tcs.2005.10.032","volume":"350","author":"D.R. Ghica","year":"2006","unstructured":"Ghica D.R., Murawski A.S., Luke Ong C.-H.: Syntactic control of concurrency. Theor. Comput. Sci. 350(2\u20133), 234\u2013251 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"143_CR17","doi-asserted-by":"crossref","unstructured":"Henzinger, T.A., Jhala, R., Majumdar, R.: The BLAST software verification system. In: SPIN, pp. 25\u201326 (2005)","DOI":"10.1007\/11537328_4"},{"key":"143_CR18","doi-asserted-by":"crossref","unstructured":"Henzinger, T.A., Jhala, R., Majumdar, R., Sutre, G.: Software verification with BLAST. In: SPIN, pp. 235\u2013239 (2003)","DOI":"10.1007\/3-540-44829-2_17"},{"key":"143_CR19","doi-asserted-by":"crossref","unstructured":"Hyland, J.M.E., Luke Ong, C.-H.: Pi-calculus, dialogue games and PCF. In: FPCA, pp. 96\u2013107 (1995)","DOI":"10.1145\/224164.224189"},{"key":"143_CR20","doi-asserted-by":"crossref","unstructured":"Hopkins, D., Luke Ong, C.-H.: Homer: a higher-order observational equivalence model checker. In: CAV, pp. 654\u2013660 (2009)","DOI":"10.1007\/978-3-642-02658-4_51"},{"key":"143_CR21","volume-title":"Introduction to Automata Theory, Languages and Computation","author":"J.E. Hopcroft","year":"1979","unstructured":"Hopcroft J.E., Ullman J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading (1979)"},{"key":"143_CR22","doi-asserted-by":"crossref","unstructured":"Laird, J.: Full abstraction for functional languages with control. In: LICS, pp. 58\u201367 (1997)","DOI":"10.1109\/LICS.1997.614931"},{"key":"143_CR23","doi-asserted-by":"crossref","unstructured":"Malacaria, P., Hankin, C.: Generalised flowcharts and games. In: ICALP, pp. 363\u2013374 (1998)","DOI":"10.1007\/BFb0055067"},{"key":"143_CR24","doi-asserted-by":"crossref","unstructured":"Luke Ong, C.-H.: Observational equivalence of 3rd-order Idealized Algol is decidable. In: LICS, pp. 245\u2013256 (2002)","DOI":"10.1109\/LICS.2002.1029833"},{"key":"143_CR25","unstructured":"Reynolds, J.C.: The essence of Algol. In: Proceedings of the 1981 International Symposium on Algorithmic Languages, pp. 345\u2013372. North-Holland, Amsterdam (1981)"},{"key":"143_CR26","volume-title":"Theory and Practice of Concurrency","author":"A.W. Roscoe","year":"1998","unstructured":"Roscoe A.W.: Theory and Practice of Concurrency. Prentice-Hall, Englewood Cliffs (1998)"}],"container-title":["International Journal on Software Tools for Technology Transfer"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10009-010-0143-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10009-010-0143-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10009-010-0143-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,19]],"date-time":"2025-02-19T12:41:44Z","timestamp":1739968904000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10009-010-0143-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,3,14]]},"references-count":26,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2010,9]]}},"alternative-id":["143"],"URL":"https:\/\/doi.org\/10.1007\/s10009-010-0143-0","relation":{},"ISSN":["1433-2779","1433-2787"],"issn-type":[{"type":"print","value":"1433-2779"},{"type":"electronic","value":"1433-2787"}],"subject":[],"published":{"date-parts":[[2010,3,14]]}}}