{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,2]],"date-time":"2026-08-02T19:38:12Z","timestamp":1785699492545,"version":"3.56.0"},"publisher-location":"Cham","reference-count":39,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030816841","type":"print"},{"value":"9783030816858","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,7,15]],"date-time":"2021-07-15T00:00:00Z","timestamp":1626307200000},"content-version":"vor","delay-in-days":195,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We present a causality-based algorithm for solving two-player reachability games represented by logical constraints. These games are a useful formalism to model a wide array of problems arising, e.g., in program synthesis. Our technique for solving these games is based on the notion of <jats:italic>subgoals<\/jats:italic>, which are slices of the game that the reachability player necessarily needs to pass through in order to reach the goal. We use Craig interpolation to identify these necessary sets of moves and recursively slice the game along these subgoals. Our approach allows us to infer winning strategies that are structured along the subgoals. If the game is won by the reachability player, this is a strategy that progresses through the subgoals towards the final goal; if the game is won by the safety player, it is a permissive strategy that completely avoids a single subgoal. We evaluate our prototype implementation on a range of different games. On multiple benchmark families, our prototype scales dramatically better than previously available tools.<\/jats:p>","DOI":"10.1007\/978-3-030-81685-8_42","type":"book-chapter","created":{"date-parts":[[2021,7,17]],"date-time":"2021-07-17T00:02:35Z","timestamp":1626480155000},"page":"894-917","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["Causality-Based Game Solving"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5321-9343","authenticated-orcid":false,"given":"Christel","family":"Baier","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2066-1511","authenticated-orcid":false,"given":"Norine","family":"Coenen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4280-8441","authenticated-orcid":false,"given":"Bernd","family":"Finkbeiner","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7301-1550","authenticated-orcid":false,"given":"Florian","family":"Funke","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1692-2408","authenticated-orcid":false,"given":"Simon","family":"Jantsch","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0842-0029","authenticated-orcid":false,"given":"Julian","family":"Siber","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,7,15]]},"reference":[{"key":"42_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/978-3-662-46681-0_49","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"R Alur","year":"2015","unstructured":"Alur, R., Moarref, S., Topcu, U.: Pattern-based refinement of assume-guarantee specifications in reactive synthesis. In: Baier, C., Tinelli, C. (eds.) TACAS 2015. LNCS, vol. 9035, pp. 501\u2013516. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46681-0_49"},{"key":"42_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/978-3-319-41540-6_14","volume-title":"Computer Aided Verification","author":"R Alur","year":"2016","unstructured":"Alur, R., Moarref, S., Topcu, U.: Compositional synthesis of reactive controllers for multi-agent systems. In: Chaudhuri, S., Farzan, A. (eds.) CAV 2016. LNCS, vol. 9780, pp. 251\u2013269. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-41540-6_14"},{"key":"42_CR3","unstructured":"Baier, C., Coenen, N., Finkbeiner, B., Funke, F., Jantsch, S., Siber, J.: Causality-based game solving. CoRR (2021). https:\/\/arxiv.org\/abs\/2105.14247, long version with appendix"},{"key":"42_CR4","doi-asserted-by":"publisher","unstructured":"Beyene, T., Chaudhuri, S., Popeea, C., Rybalchenko, A.: A constraint-based approach to solving games on infinite graphs. In: Principles of Programming Languages (POPL). ACM, New York (2014). https:\/\/doi.org\/10.1145\/2535838.2535860","DOI":"10.1145\/2535838.2535860"},{"key":"42_CR5","doi-asserted-by":"publisher","unstructured":"Bloem, R., Egly, U., Klampfl, P., K\u00f6nighofer, R., Lonsing, F.: SAT-based methods for circuit synthesis. In: Formal Methods in Computer-Aided Design (FMCAD). IEEE (2014). https:\/\/doi.org\/10.1109\/FMCAD.2014.6987592","DOI":"10.1109\/FMCAD.2014.6987592"},{"issue":"4","key":"42_CR6","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.entcs.2007.09.004","volume":"190","author":"R Bloem","year":"2007","unstructured":"Bloem, R., Galler, S., Jobstmann, B., Piterman, N., Pnueli, A., Weiglhofer, M.: Specify, compile, run: hardware from PSL. Electron. Notes Theor. Comput. Sci. 190(4), 3\u201316 (2007). https:\/\/doi.org\/10.1016\/j.entcs.2007.09.004","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"42_CR7","doi-asserted-by":"publisher","unstructured":"Bloem, R., Jobstmann, B., Piterman, N., Pnueli, A., Sa\u2019ar, Y.: Synthesis of reactive(1) designs. J. Comput. Syst. Sci. 78(3), 911\u2013938 (2012). https:\/\/doi.org\/10.1016\/j.jcss.2011.08.007. In Commemoration of Amir Pnueli","DOI":"10.1016\/j.jcss.2011.08.007"},{"issue":"1\/4","key":"42_CR8","doi-asserted-by":"publisher","first-page":"35","DOI":"10.2307\/1967631","volume":"3","author":"CL Bouton","year":"1901","unstructured":"Bouton, C.L.: Nim, a game with a complete mathematical theory. Ann. Math. 3(1\/4), 35\u201339 (1901). https:\/\/doi.org\/10.2307\/1967631","journal-title":"Ann. Math."},{"key":"42_CR9","doi-asserted-by":"publisher","unstructured":"Bradfield, J.C., Stirling, C.: Modal mu-calculi. In: Blackburn, P., van Benthem, J.F.A.K., Wolter, F. (eds.) Handbook of Modal Logic, Studies in Logic and Practical Reasoning, vol. 3, pp. 721\u2013756, North-Holland (2007). https:\/\/doi.org\/10.1016\/s1570-2464(07)80015-2","DOI":"10.1016\/s1570-2464(07)80015-2"},{"key":"42_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/978-3-540-75698-9_2","volume-title":"International Symposium on Fundamentals of Software Engineering","author":"I Br\u00fcckner","year":"2007","unstructured":"Br\u00fcckner, I., Dr\u00e4ger, K., Finkbeiner, B., Wehrheim, H.: Slicing abstractions. In: Arbab, F., Sirjani, M. (eds.) FSEN 2007. LNCS, vol. 4767, pp. 17\u201332. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-75698-9_2"},{"key":"42_CR11","doi-asserted-by":"publisher","unstructured":"Chen, Y., T\u00e5mov\u016f, J., Belta, C.: LTL Robot Motion Control based on Automata Learning of Environmental Dynamics. In: International Conference on Robotics and Automation. IEEE (2012). https:\/\/doi.org\/10.1109\/ICRA.2012.6225075","DOI":"10.1109\/ICRA.2012.6225075"},{"key":"42_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/978-3-642-36742-7_7","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"A Cimatti","year":"2013","unstructured":"Cimatti, A., Griggio, A., Schaafsma, B.J., Sebastiani, R.: The MathSAT5 SMT solver. In: Piterman, N., Smolka, S.A. (eds.) TACAS 2013. LNCS, vol. 7795, pp. 93\u2013107. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36742-7_7"},{"issue":"3","key":"42_CR13","doi-asserted-by":"publisher","first-page":"269","DOI":"10.2307\/2963594","volume":"22","author":"W Craig","year":"1957","unstructured":"Craig, W.: Three uses of the Herbrand-Gentzen theorem in relating model theory and proof theory. J. Symbolic Logic 22(3), 269\u2013285 (1957). https:\/\/doi.org\/10.2307\/2963594","journal-title":"J. Symbolic Logic"},{"key":"42_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"536","DOI":"10.1007\/3-540-44685-0_36","volume-title":"CONCUR 2001 \u2014 Concurrency Theory","author":"L de Alfaro","year":"2001","unstructured":"de Alfaro, L., Henzinger, T.A., Majumdar, R.: Symbolic algorithms for infinite-state games. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol. 2154, pp. 536\u2013550. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44685-0_36"},{"key":"42_CR15","unstructured":"Edelkamp, S.: Symbolic exploration in two-player games: preliminary results. In: The International Conference on AI Planning & Scheduling (AIPS), Workshop on Model Checking (2002)"},{"key":"42_CR16","unstructured":"E\u00e9n, N., Legg, A., Narodytska, N., Ryzhyk, L.: SAT-based strategy extraction in reachability games. In: Conference on Artificial Intelligence (AAAI) (2015). https:\/\/ojs.aaai.org\/index.php\/AAAI\/article\/view\/9752"},{"key":"42_CR17","doi-asserted-by":"publisher","unstructured":"Ehlers, R., Moldovan, D.: Sparse positional strategies for safety games. In: Workshop on Synthesis (SYNT), EPTCS (2012). https:\/\/doi.org\/10.4204\/EPTCS.84.1","DOI":"10.4204\/EPTCS.84.1"},{"key":"42_CR18","doi-asserted-by":"publisher","unstructured":"Farzan, A., Kincaid, Z.: Strategy synthesis for linear arithmetic games. Proc. ACM Program. Lang. 2(POPL) (2017). https:\/\/doi.org\/10.1145\/3158149","DOI":"10.1145\/3158149"},{"key":"42_CR19","unstructured":"Gario, M., Micheli, A.: PySMT: a solver-agnostic library for fast prototyping of SMT-based algorithms. In: SMT Workshop 2015 (2015)"},{"key":"42_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36387-4","volume-title":"Automata Logics, and Infinite Games","year":"2002","unstructured":"Gr\u00e4del, E., Thomas, W., Wilke, T. (eds.): Automata Logics, and Infinite Games. LNCS, vol. 2500. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-36387-4"},{"key":"42_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1007\/978-3-540-31980-1_31","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"A Harding","year":"2005","unstructured":"Harding, A., Ryan, M., Schobbens, P.-Y.: A new algorithm for strategy synthesis in LTL games. In: Halbwachs, N., Zuck, L.D. (eds.) TACAS 2005. LNCS, vol. 3440, pp. 477\u2013492. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-31980-1_31"},{"issue":"1","key":"42_CR22","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1613\/jair.1492","volume":"22","author":"J Hoffmann","year":"2004","unstructured":"Hoffmann, J., Porteous, J., Sebastia, L.: Ordered landmarks in planning. J. Artif. Intell. Res. 22(1), 215\u2013278 (2004)","journal-title":"J. Artif. Intell. Res."},{"key":"42_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/978-3-540-75454-1_17","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"JJ Jessen","year":"2007","unstructured":"Jessen, J.J., Rasmussen, J.I., Larsen, K.G., David, A.: Guided controller synthesis for climate controller using Uppaal Tiga. In: Raskin, J.-F., Thiagarajan, P.S. (eds.) FORMATS 2007. LNCS, vol. 4763, pp. 227\u2013240. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-75454-1_17"},{"key":"42_CR24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40184-8_19","author":"A Kupriyanov","year":"2013","unstructured":"Kupriyanov, A., Finkbeiner, B.: Causality-based verification of multi-threaded programs. Concur. Theory (CONCUR) (2013). https:\/\/doi.org\/10.1007\/978-3-642-40184-8_19","journal-title":"Concur. Theory (CONCUR)"},{"key":"42_CR25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-08867-9\\_54","author":"A Kupriyanov","year":"2014","unstructured":"Kupriyanov, A., Finkbeiner, B.: Causal termination of multi-threaded programs. Comput. Aided Verification (CAV) (2014). https:\/\/doi.org\/10.1007\/978-3-319-08867-9_54","journal-title":"Comput. Aided Verification (CAV)"},{"issue":"8","key":"42_CR26","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1145\/361082.361093","volume":"17","author":"L Lamport","year":"1974","unstructured":"Lamport, L.: A new solution of Dijkstra\u2019s concurrent programming problem. Commun. ACM 17(8), 453\u2013455 (1974). https:\/\/doi.org\/10.1145\/361082.361093","journal-title":"Commun. ACM"},{"issue":"4","key":"42_CR27","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/s00236-015-0236-z","volume":"53","author":"J Leroux","year":"2016","unstructured":"Leroux, J., R\u00fcmmer, P., Suboti\u0107, P.: Guiding Craig interpolation with domain-specific abstractions. Acta Informatica 53(4), 387\u2013424 (2016). https:\/\/doi.org\/10.1007\/s00236-015-0236-z","journal-title":"Acta Informatica"},{"key":"42_CR28","unstructured":"Menzies, P., Beebee, H.: Counterfactual theories of causation. In: Zalta, E.N. (ed.) The Stanford Encyclopedia of Philosophy. Stanford University, Metaphysics Research Lab (2020)"},{"key":"42_CR29","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/978-3-540-89439-1_18","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"D Monniaux","year":"2008","unstructured":"Monniaux, D.: A quantifier elimination algorithm for linear real arithmetic. In: Cervesato, I., Veith, H., Voronkov, A. (eds.) LPAR 2008. LNCS (LNAI), vol. 5330, pp. 243\u2013257. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-89439-1_18"},{"key":"42_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-540-78800-3_24","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"L de Moura","year":"2008","unstructured":"de Moura, L., Bj\u00f8rner, N.: Z3: an efficient SMT solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 337\u2013340. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78800-3_24"},{"key":"42_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1007\/978-3-319-08867-9_35","volume-title":"Computer Aided Verification","author":"N Narodytska","year":"2014","unstructured":"Narodytska, N., Legg, A., Bacchus, F., Ryzhyk, L., Walker, A.: Solving games without controllable predecessor. In: Biere, A., Bloem, R. (eds.) CAV 2014. LNCS, vol. 8559, pp. 533\u2013540. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-08867-9_35"},{"key":"42_CR32","doi-asserted-by":"publisher","unstructured":"Pozanco, A., E-Mart\u00edn, Y., Fern\u00e1ndez, S., Borrajo, D.: Counterplanning using goal recognition and landmarks. In: International Joint Conference on Artificial Intelligence (IJCAI) (2018). https:\/\/doi.org\/10.24963\/ijcai.2018\/668","DOI":"10.24963\/ijcai.2018\/668"},{"key":"42_CR33","unstructured":"Presburger, M.: \u00dcber die Vollst\u00e4ndigkeit eines gewissen Systems der Arithmetik ganzer Zahlen, in welchem die Addition als einzige Operation hervortritt. Comptes Rendus du I congres de Math\u00e9maticiens des Pays Slaves (1929)"},{"key":"42_CR34","doi-asserted-by":"publisher","unstructured":"Ryzhyk, L., Chubb, P., Kuz, I., Le Sueur, E., Heiser, G.: Automatic device driver synthesis with termite. In: Symposium on Operating Systems Principles (SOSP). Association for Computing Machinery (ACM) (2009). https:\/\/doi.org\/10.1145\/1629575.1629583","DOI":"10.1145\/1629575.1629583"},{"key":"42_CR35","doi-asserted-by":"publisher","unstructured":"Siber, J.: The Virtual Machine containing CabPy (2021). https:\/\/doi.org\/10.6084\/m9.figshare.14493804.v3","DOI":"10.6084\/m9.figshare.14493804.v3"},{"key":"42_CR36","doi-asserted-by":"publisher","unstructured":"Sreedharan, S., Srivastava, S., Smith, D.E., Kambhampati, S.: Why can\u2019t you do that HAL? Explaining unsolvability of planning tasks. In: International Joint Conference on Artificial Intelligence (IJCAI) (2019). https:\/\/doi.org\/10.24963\/ijcai.2019\/197","DOI":"10.24963\/ijcai.2019\/197"},{"key":"42_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-59042-0_57","volume-title":"STACS 1995","author":"W Thomas","year":"1995","unstructured":"Thomas, W.: On the synthesis of strategies in infinite games. In: Mayr, E.W., Puech, C. (eds.) STACS 1995. LNCS, vol. 900, pp. 1\u201313. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-59042-0_57"},{"key":"42_CR38","doi-asserted-by":"publisher","DOI":"10.1109\/FMCAD.2014.6987617","author":"A Walker","year":"2014","unstructured":"Walker, A., Ryzhyk, L.: Predicate abstraction for reactive synthesis. Formal Meth. Comput. Aided Des. (FMCAD) (2014). https:\/\/doi.org\/10.1109\/FMCAD.2014.6987617","journal-title":"Formal Meth. Comput. Aided Des. (FMCAD)"},{"key":"42_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/3-540-36387-4_10","volume-title":"Automata Logics, and Infinite Games","author":"J Zappe","year":"2002","unstructured":"Zappe, J.: Modal $${\\mu } $$-calculus and alternating tree automata. In: Gr\u00e4del, E., Thomas, W., Wilke, T. (eds.) Automata Logics, and Infinite Games. LNCS, vol. 2500, pp. 171\u2013184. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-36387-4_10"}],"container-title":["Lecture Notes in Computer Science","Computer Aided Verification"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-81685-8_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,17]],"date-time":"2021-07-17T00:11:40Z","timestamp":1626480700000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-81685-8_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030816841","9783030816858"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-81685-8_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"15 July 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CAV","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computer Aided Verification","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 July 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 July 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"33","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cav2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/i-cav.org\/2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"290","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"63","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"22% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"12","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"16 tool papers and 5 invited papers are also included.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}