{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:35:40Z","timestamp":1742913340242,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642162640"},{"type":"electronic","value":"9783642162657"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-16265-7_10","type":"book-chapter","created":{"date-parts":[[2010,9,30]],"date-time":"2010-09-30T21:45:41Z","timestamp":1285883141000},"page":"121-135","source":"Crossref","is-referenced-by-count":3,"title":["A Compositional Method for Deciding Equivalence and Termination of Nondeterministic Programs"],"prefix":"10.1007","author":[{"given":"Aleksandar","family":"Dimovski","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"10_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, Basel (1997)"},{"key":"10_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/978-3-540-78800-3_7","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"A. Bakewell","year":"2008","unstructured":"Bakewell, A., Ghica, D.R.: On-the-fly techniques for game-based software model checking. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol.\u00a04963, pp. 78\u201392. Springer, Heidelberg (2008)"},{"key":"10_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1007\/3-540-45657-0_36","volume-title":"Computer Aided Verification","author":"M.A. Colon","year":"2002","unstructured":"Colon, M.A., Sipma, H.B.: Practical Methods for Proving Program Termination. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol.\u00a02404, pp. 442\u2013454. Springer, Heidelberg (2002)"},{"key":"10_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/3-540-45319-9_6","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"M.A. Colon","year":"2001","unstructured":"Colon, M.A., Sipma, H.B.: Synthesis of linear ranking functions. In: Margaria, T., Yi, W. (eds.) TACAS 2001. LNCS, vol.\u00a02031, pp. 67\u201381. Springer, Heidelberg (2001)"},{"key":"10_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/11547662_8","volume-title":"Static Analysis","author":"B. Cook","year":"2005","unstructured":"Cook, B., Podelski, A., Rybalchenko, A.: Abstraction Refinement for Termination. In: Hankin, C., Siveroni, I. (eds.) SAS 2005. LNCS, vol.\u00a03672, pp. 87\u2013101. Springer, Heidelberg (2005)"},{"key":"10_CR6","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., Lazi\u0107, 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)"},{"key":"10_CR7","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)"},{"key":"10_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1007\/11691617_17","volume-title":"Model Checking Software","author":"A. Dimovski","year":"2006","unstructured":"Dimovski, A., Ghica, D.R., Lazi\u0107, R.: A Counterexample-Guided Refinement Tool for Open Procedural Programs. In: Valmari, A. (ed.) SPIN 2006. LNCS, vol.\u00a03925, pp. 288\u2013292. Springer, Heidelberg (2006)"},{"issue":"1","key":"10_CR9","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":"10_CR10","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":"10_CR11","first-page":"422","volume-title":"Proceedings of LICS","author":"R. Harmer","year":"1999","unstructured":"Harmer, R., McCusker, G.: A fully abstract game semantics for finite nondeterminism. In: Proceedings of LICS, pp. 422\u2013430. IEEE, Los Alamitos (1999)"},{"key":"10_CR12","unstructured":"Harmer, R.: Games and Full Abstraction for Nondeterministic Languages. Ph. D. Thesis Imperial College (1999)"},{"key":"10_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/978-3-540-78800-3_13","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"A. Legay","year":"2008","unstructured":"Legay, A., Murawski, A., Ouaknine, J., Worrell, J.: On Automated Verification of Probabilistic Programs. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol.\u00a04963, pp. 173\u2013187. Springer, Heidelberg (2008)"},{"key":"10_CR14","first-page":"173","volume-title":"Proceedings of LICS","author":"A. Murawski","year":"2008","unstructured":"Murawski, A.: Reachability Games and Game Semantics: Comparing Nondeterministic Programs. In: Proceedings of LICS, pp. 173\u2013183. IEEE, Los Alamitos (2008)"},{"key":"10_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)"}],"container-title":["Lecture Notes in Computer Science","Integrated Formal Methods"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16265-7_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T07:31:09Z","timestamp":1553153469000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16265-7_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642162640","9783642162657"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16265-7_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}