{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T07:18:28Z","timestamp":1781075908135,"version":"3.54.1"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319153162","type":"print"},{"value":"9783319153179","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-15317-9_9","type":"book-chapter","created":{"date-parts":[[2015,1,29]],"date-time":"2015-01-29T06:05:37Z","timestamp":1422511537000},"page":"145-161","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Solving Parity Games in Scala"],"prefix":"10.1007","author":[{"given":"Antonio","family":"Di Stasio","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Aniello","family":"Murano","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vincenzo","family":"Prignano","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Loredana","family":"Sorrentino","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2015,1,30]]},"reference":[{"key":"9_CR1","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1016\/j.scico.2013.07.001","volume":"83","author":"B Aminof","year":"2013","unstructured":"Aminof, B., Mogavero, F., Murano, A.: Synthesis of hierarchical systems. Sci. Comp. Program. 83, 56\u201379 (2013)","journal-title":"Sci. Comp. Program."},{"key":"9_CR2","first-page":"115","volume":"225","author":"A Antonik","year":"2009","unstructured":"Antonik, A., Charlton, N., Huth, M.: Polynomial-time under-approximation of winning regions in parity games. ENTCS 225, 115\u2013139 (2009)","journal-title":"ENTCS"},{"key":"9_CR3","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/j.ic.2011.10.008","volume":"210","author":"B Aminof","year":"2012","unstructured":"Aminof, B., Kupferman, O., Murano, A.: Improved model checking of hierarchical systems. Inf. Comput. 210, 68\u201386 (2012)","journal-title":"Inf. Comput."},{"key":"9_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/978-3-642-21437-0_7","volume-title":"FM 2011: Formal Methods","author":"H Barringer","year":"2011","unstructured":"Barringer, H., Havelund, K.: TraceContract: a scala DSL for trace analysis. In: Butler, M., Schulte, W. (eds.) FM 2011. LNCS, vol. 6664, pp. 57\u201372. Springer, Heidelberg (2011)"},{"key":"9_CR5","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1145\/381694.378821","volume":"36","author":"ED Berger","year":"2001","unstructured":"Berger, E.D., Zorn, B.G., McKinley, K.S.: Composing high-performance memory allocators. ACM SIGPLAN Not. 36, 114\u2013124 (2001)","journal-title":"ACM SIGPLAN Not."},{"issue":"4","key":"9_CR6","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1145\/2502508.2502522","volume":"48","author":"ED Berger","year":"2013","unstructured":"Berger, E.D., Zorn, B.G., McKinley, K.S.: OOPSLA 2002: reconsidering custom memory allocation. ACM SIGPLAN Not. 48(4), 46\u201357 (2013)","journal-title":"ACM SIGPLAN Not."},{"key":"9_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/978-3-540-70918-3_17","volume-title":"STACS 2007","author":"D Berwanger","year":"2007","unstructured":"Berwanger, D.: Admissibility in infinite games. In: Thomas, W., Weil, P. (eds.) STACS 2007. LNCS, vol. 4393, pp. 188\u2013199. Springer, Heidelberg (2007)"},{"key":"9_CR8","unstructured":"Chatterjee, K., Doyen, L., Henzinger, T.A., Raskin, J.-F.: Generalized mean-payoff and energy games. In: FSTTCS\u201910, LIPIcs 8, pp. 505\u2013516 (2010)"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Chatterjee, K., Henzinger, T.A., Jurdzinski, M.: Mean-payoff parity games. In: LICS\u201905, pp. 178\u2013187 (2005)","DOI":"10.1109\/LICS.2005.26"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Chatterjee, K., Jurdzinski, M., Henzinger, T.A.: Quantitative stochastic parity games. In: SODA\u201904, pp. 121\u2013130 (2004)","DOI":"10.21236\/ADA603293"},{"key":"9_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/BFb0025774","volume-title":"Logics of Programs","author":"EM Clarke","year":"1982","unstructured":"Clarke, E.M., Emerson, E.A.: Design and synthesis of synchronization skeletons using branching time temporal logic. In: Kozen, D. (ed.) Logic of Programs 1981. LNCS, vol. 131, pp. 52\u201371. Springer, Heidelberg (1982)"},{"key":"9_CR12","volume-title":"Model Checking","author":"E Clarke","year":"2002","unstructured":"Clarke, E., Grumberg, O., Peled, D.: Model Checking. MIT Press, Cambridge (2002)"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Emerson, E., Jutla, C.: Tree automata, $$\\mu $$-calculus and determinacy. In: FOCS\u201991, pp. 368\u2013377 (1991)","DOI":"10.1109\/SFCS.1991.185392"},{"issue":"04","key":"9_CR14","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1051\/ita\/2011124","volume":"45","author":"O Friedmann","year":"2011","unstructured":"Friedmann, O.: Recursive algorithm for parity games requires exponential time. RAIRO-Theor. Inform. Appl. 45(04), 449\u2013457 (2011)","journal-title":"RAIRO-Theor. Inform. Appl."},{"key":"9_CR15","unstructured":"Friedmann, O., Lange, M.: The pgsolver collection of parity game solvers. University of Munich (2009)"},{"key":"9_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/978-3-642-04761-9_15","volume-title":"Automated Technology for Verification and Analysis","author":"O Friedmann","year":"2009","unstructured":"Friedmann, O., Lange, M.: Solving parity games in practice. In: Liu, Z., Ravn, A.P. (eds.) ATVA 2009. LNCS, vol. 5799, pp. 182\u2013196. Springer, Heidelberg (2009)"},{"key":"9_CR17","volume-title":"Design Patterns: Elements of Reusable Object-Oriented Software","author":"E Gamma","year":"1994","unstructured":"Gamma, E., Helm, R., Johnson, R., Vlissides, J.: Design Patterns: Elements of Reusable Object-Oriented Software. Pearson Education, New Jersey (1994)"},{"key":"9_CR18","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1145\/277652.277748","volume":"33","author":"D Gay","year":"1998","unstructured":"Gay, D., Aiken, A.: Memory management with explicit regions. ACM Sigplan Not. 33, 313\u2013323 (1998)","journal-title":"ACM Sigplan Not."},{"key":"9_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1007\/978-3-319-02444-8_34","volume-title":"Automated Technology for Verification and Analysis","author":"P Hoffmann","year":"2013","unstructured":"Hoffmann, P., Luttenberger, M.: Solving parity games on the GPU. In: Van Hung, D., Ogawa, M. (eds.) ATVA 2013. LNCS, vol. 8172, pp. 455\u2013459. Springer, Heidelberg (2013)"},{"key":"9_CR20","unstructured":"Hundt, R.: Loop recognition in c++\/java\/go\/scala. In: 2011 Proceedings of Scala Days (2011)"},{"issue":"3","key":"9_CR21","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/S0020-0190(98)00150-1","volume":"68","author":"M Jurdzinski","year":"1998","unstructured":"Jurdzinski, M.: Deciding the winner in parity games is in up $$\\cap $$ co-up. Inf. Process. Lett. 68(3), 119\u2013124 (1998)","journal-title":"Inf. Process. Lett."},{"key":"9_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/3-540-46541-3_24","volume-title":"STACS 2000","author":"M Jurdzi\u0144ski","year":"2000","unstructured":"Jurdzi\u0144ski, M.: Small progress measures for solving parity games. In: Reichel, H., Tison, S. (eds.) STACS 2000. LNCS, vol. 1770, pp. 290\u2013301. Springer, Heidelberg (2000)"},{"issue":"4","key":"9_CR23","doi-asserted-by":"publisher","first-page":"1519","DOI":"10.1137\/070686652","volume":"38","author":"M Jurdzinski","year":"2008","unstructured":"Jurdzinski, M., Paterson, M., Zwick, U.: A deterministic subexponential algorithm for solving parity games. SIAM J. Comput. 38(4), 1519\u20131532 (2008)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"9_CR24","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/0304-3975(82)90125-6","volume":"27","author":"D Kozen","year":"1983","unstructured":"Kozen, D.: Results on the propositional mu-calculus. TCS 27(3), 333\u2013354 (1983)","journal-title":"TCS"},{"issue":"2","key":"9_CR25","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1145\/333979.333987","volume":"47","author":"O Kupferman","year":"2000","unstructured":"Kupferman, O., Vardi, M., Wolper, P.: An automata theoretic approach to branching-time model checking. JACM 47(2), 312\u2013360 (2000)","journal-title":"JACM"},{"issue":"2","key":"9_CR26","first-page":"322","volume":"164","author":"O Kupferman","year":"2001","unstructured":"Kupferman, O., Vardi, M., Wolper, P.: Module checking. IC 164(2), 322\u2013344 (2001)","journal-title":"IC"},{"issue":"2","key":"9_CR27","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0168-0072(93)90036-D","volume":"65","author":"R McNaughton","year":"1993","unstructured":"McNaughton, R.: Infinite games played on finite graphs. Ann. Pure Appl. Log. 65(2), 149\u2013184 (1993)","journal-title":"Ann. Pure Appl. Log."},{"key":"9_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1007\/978-3-642-45221-5_40","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"F Mogavero","year":"2013","unstructured":"Mogavero, F., Murano, A., Sorrentino, L.: On promptness in parity games. In: McMillan, K., Middeldorp, A., Voronkov, A. (eds.) LPAR-19 2013. LNCS, vol. 8312, pp. 601\u2013618. Springer, Heidelberg (2013)"},{"key":"9_CR29","unstructured":"Odersky, M., Altherr, P., Cremet, V., Emir, B., Maneth, S., Micheloud, S., Mihaylov, N., Schinz, M., Stenman, E., Zenger, M.: An overview of the scala programming language (2004)"},{"key":"9_CR30","volume-title":"Programming in Scala","author":"M Odersky","year":"2008","unstructured":"Odersky, M., Spoon, L., Venners, B.: Programming in Scala. Artima Inc, Sunnyvale (2008)"},{"key":"9_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/3-540-11494-7_22","volume-title":"International Symposium on Programming","author":"J Queille","year":"1982","unstructured":"Queille, J., Sifakis, J.: Specification and verification of concurrent programs in CESAR. In: Dezani-Ciancaglini, M., Montanari, U. (eds.) International Symposium on Programming. LNCS, vol. 137, pp. 337\u2013351. Springer, Heidelberg (1982)"},{"key":"9_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/978-3-540-77050-3_37","volume-title":"FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science","author":"S Schewe","year":"2007","unstructured":"Schewe, S.: Solving parity games in big steps. In: Arvind, V., Prasad, S. (eds.) FSTTCS 2007. LNCS, vol. 4855, pp. 449\u2013460. Springer, Heidelberg (2007)"},{"key":"9_CR33","first-page":"133","volume-title":"Handbook of Theoretical Computer Science","author":"W Thomas","year":"1990","unstructured":"Thomas, W.: Automata on infinite objects. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, vol. B, pp. 133\u2013191. MIT Press, Cambridge (1990)"},{"key":"9_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/10722167_18","volume-title":"Computer Aided Verification","author":"J V\u00f6ge","year":"2000","unstructured":"V\u00f6ge, J., Jurdzinski, M.: A discrete strategy improvement algorithm for solving parity games. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol. 1855, pp. 202\u2013215. Springer, Heidelberg (2000)"},{"issue":"1\u20132","key":"9_CR35","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/S0304-3975(98)00009-7","volume":"200","author":"W Zielonka","year":"1998","unstructured":"Zielonka, W.: Infinite games on finitely coloured graphs with applications to automata on infinite trees. Theor. Comput. Sci. 200(1\u20132), 135\u2013183 (1998)","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Formal Aspects of Component Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-15317-9_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,17]],"date-time":"2025-05-17T23:23:42Z","timestamp":1747524222000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-15317-9_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319153162","9783319153179"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-15317-9_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"30 January 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}