{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,23]],"date-time":"2026-07-23T20:10:01Z","timestamp":1784837401871,"version":"3.55.0"},"publisher-location":"Cham","reference-count":52,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030816872","type":"print"},{"value":"9783030816889","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>Being able to argue about the performance of self-adjusting data structures such as splay trees has been a main objective, when Sleator and Tarjan introduced the notion of<jats:italic>amortised<\/jats:italic>complexity.<\/jats:p><jats:p>Analysing these data structures requires sophisticated potential functions, which typically contain logarithmic expressions. Possibly for these reasons, and despite the recent progress in automated resource analysis, they have so far eluded automation. In this paper, we report on the first fully-automated amortised complexity analysis of self-adjusting data structures. Following earlier work, our analysis is based on potential function templates with unknown coefficients.<\/jats:p><jats:p>We make the following contributions: 1) We encode the search for concrete potential function coefficients as an optimisation problem over a suitable constraint system. Our target function steers the search towards coefficients that minimise the inferred amortised complexity. 2) Automation is achieved by using a linear constraint system in conjunction with suitable lemmata schemes that encapsulate the required non-linear facts about the logarithm. We discuss our choices that achieve a scalable analysis. 3) We present our tool<jats:inline-formula><jats:alternatives><jats:tex-math>$$\\mathsf {ATLAS}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"><mml:mi>ATLAS<\/mml:mi><\/mml:math><\/jats:alternatives><\/jats:inline-formula>and report on experimental results for<jats:italic>splay trees<\/jats:italic>,<jats:italic>splay heaps<\/jats:italic>and<jats:italic>pairing heaps<\/jats:italic>. We completely automatically infer complexity estimates that match previous results (obtained by sophisticated pen-and-paper proofs), and in some cases even infer better complexity estimates than previously published.<\/jats:p>","DOI":"10.1007\/978-3-030-81688-9_5","type":"book-chapter","created":{"date-parts":[[2021,7,16]],"date-time":"2021-07-16T16:20:47Z","timestamp":1626452447000},"page":"99-122","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["ATLAS: Automated Amortised Complexity Analysis of Self-adjusting Data Structures"],"prefix":"10.1007","author":[{"given":"Lorenz","family":"Leutgeb","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Georg","family":"Moser","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Florian","family":"Zuleger","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,7,15]]},"reference":[{"issue":"2","key":"5_CR1","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/s10817-010-9174-1","volume":"46","author":"E Albert","year":"2011","unstructured":"Albert, E., Arenas, P., Genaim, S., Puebla, G.: Closed-form upper bounds in static cost analysis. JAR 46(2), 161\u2013203 (2011)","journal-title":"JAR"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Alonso-Blas, D.E., Genaim, S.: On the limits of the classical approach to cost analysis. In: SAS, pp. 405\u2013421 (2012)","DOI":"10.1007\/978-3-642-33125-1_27"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Avanzini, M., Lago, U.D., Moser, G.: Analysing the complexity of functional programs: higher-order meets first-order. In: ICFP, pp. 152\u2013164. ACM (2015)","DOI":"10.1145\/2858949.2784753"},{"key":"5_CR4","first-page":"22","volume":"248","author":"M Avanzini","year":"2016","unstructured":"Avanzini, M., Moser, G.: A combination framework for complexity. IC 248, 22\u201355 (2016)","journal-title":"IC"},{"key":"5_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/978-3-662-49674-9_24","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"M Avanzini","year":"2016","unstructured":"Avanzini, M., Moser, G., Schaper, M.: TcT: Tyrolean complexity tool. In: Chechik, M., Raskin, J.-F. (eds.) TACAS 2016. LNCS, vol. 9636, pp. 407\u2013423. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49674-9_24"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Bauer, S., Jost, S., Hofmann, M.: Decidable inequalities over infinite trees. In: LPAR, vol. 57, pp. 111\u2013130 (2018)","DOI":"10.29007\/s21n"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Br\u00e1zdil, T., Chatterjee, K., Kucera, A., Novotn\u00fd, P., Velan, D., Zuleger, F.: Efficient algorithms for asymptotic bounds on termination time in VASS. In: LICS, pp. 185\u2013194 (2018)","DOI":"10.1145\/3209108.3209191"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Chatterjee, K., Fu, H., Goharshady, A.K.: Non-polynomial worst-case analysis of recursive programs. In: CAV, pp. 41\u201363 (2017)","DOI":"10.1007\/978-3-319-63390-9_3"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"Colcombet, T., Daviaud, L., Zuleger, F.: Size-change abstraction and max-plus automata. In: MFCS, pp. 208\u2013219 (2014)","DOI":"10.1007\/978-3-662-44522-8_18"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Fiedor, T., Hol\u00edk, L., Rogalewicz, A., Sinn, M., Vojnar, T., Zuleger, F.: From shapes to amortized complexity. In: VMCAI, pp. 205\u2013225 (2018)","DOI":"10.1007\/978-3-319-73721-8_10"},{"key":"5_CR11","unstructured":"Flores-Montoya, A.: Cost analysis of programs based on the refinement of cost relations. Ph.D. thesis, Darmstadt University of Technology, Germany (2017)"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Fuhs, C., Kop, C., Nishida, N.: Verifying procedural programs via constrained rewriting induction. TOCL 18(2), 14:1\u201314:50 (2017)","DOI":"10.1145\/3060143"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Gambin, A., Malinowski, A.: Randomized meldable priority queues. In: SOFSEM, pp. 344\u2013349 (1998)","DOI":"10.1007\/3-540-49477-4_26"},{"key":"5_CR14","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10817-016-9388-y","volume":"1","author":"J Giesl","year":"2017","unstructured":"Giesl, J., et al.: Analyzing program termination and complexity automatically with AProVE. JAR 1, 3\u201331 (2017)","journal-title":"JAR"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Gulwani, S., Zuleger, F.: The reachability-bound problem. In: PLDI, pp. 292\u2013304 (2010)","DOI":"10.1145\/1809028.1806630"},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"Harrison, J.: Verifying nonlinear real formulas via sums of squares. In: TPHOLs, pp. 102\u2013118 (2007)","DOI":"10.1007\/978-3-540-74591-4_9"},{"issue":"1\u20132","key":"5_CR17","first-page":"219","volume":"12","author":"M Hermenegildo","year":"2012","unstructured":"Hermenegildo, M., et al.: An overview of ciao and its design philosophy. TPLP 12(1\u20132), 219\u2013252 (2012)","journal-title":"TPLP"},{"key":"5_CR18","doi-asserted-by":"crossref","unstructured":"Hirokawa, N., Moser, G.: Automated complexity analysis based on the dependency pair method. In: IJCAR, pp. 364\u2013380 (2008)","DOI":"10.1007\/978-3-540-71070-7_32"},{"key":"5_CR19","doi-asserted-by":"crossref","unstructured":"Hoffmann, J., Aehlig, K., Hofmann, M.: Multivariate amortized resource analysis. In: Proceedings of 38th POPL, pp. 357\u2013370. ACM (2011)","DOI":"10.1145\/1925844.1926427"},{"issue":"3","key":"5_CR20","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1145\/2362389.2362393","volume":"34","author":"J Hoffmann","year":"2012","unstructured":"Hoffmann, J., Aehlig, K., Hofmann, M.: Multivariate amortized resource analysis. TOPLAS 34(3), 14 (2012)","journal-title":"TOPLAS"},{"key":"5_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"781","DOI":"10.1007\/978-3-642-31424-7_64","volume-title":"Computer Aided Verification","author":"J Hoffmann","year":"2012","unstructured":"Hoffmann, J., Aehlig, K., Hofmann, M.: Resource aware ML. In: Madhusudan, P., Seshia, S.A. (eds.) CAV 2012. LNCS, vol. 7358, pp. 781\u2013786. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31424-7_64"},{"key":"5_CR22","doi-asserted-by":"crossref","unstructured":"Hoffmann, J., Das, A., Weng, S.C.: Towards automatic resource bound analysis for OCaml. In: POPL, pp. 359\u2013373 (2017)","DOI":"10.1145\/3093333.3009842"},{"key":"5_CR23","doi-asserted-by":"crossref","unstructured":"Hofmann, M., Jost, S.: Static prediction of heap space usage for first-order functional programs. In: POPL, pp. 185\u2013197 (2003)","DOI":"10.1145\/640128.604148"},{"key":"5_CR24","doi-asserted-by":"crossref","unstructured":"Hofmann, M., Moser, G.: Amortised resource analysis and typed polynomial interpretations. In: Proceedings of Joint 25th RTA and 12th TLCA, pp. 272\u2013286 (2014)","DOI":"10.1007\/978-3-319-08918-8_19"},{"key":"5_CR25","unstructured":"Hofmann, M., Moser, G.: Multivariate amortised resource analysis for term rewrite systems. In: TLCA, pp. 241\u2013256 (2015)"},{"key":"5_CR26","unstructured":"Hofmann, M., Moser, G.: Analysis of logarithmic amortised complexity (2018)"},{"key":"5_CR27","doi-asserted-by":"crossref","unstructured":"Hofmann, M., Leutgeb, L., Moser, G., Obwaller, D., Zuleger, F.: Type-based analysis of logarithmic amortised complexity. MSCS (2021, to appear). https:\/\/arxiv.org\/abs\/2101.12029","DOI":"10.1017\/S0960129521000232"},{"key":"5_CR28","doi-asserted-by":"crossref","unstructured":"Hofmann, M., Rodriguez, D.: Automatic type inference for amortised heap-space analysis. In: ESOP, pp. 593\u2013613 (2013)","DOI":"10.1007\/978-3-642-37036-6_32"},{"key":"5_CR29","doi-asserted-by":"crossref","unstructured":"Iacono, J.: Improved upper bounds for pairing heaps. In: SWAT, pp. 32\u201345 (2000)","DOI":"10.1007\/3-540-44985-X_5"},{"key":"5_CR30","doi-asserted-by":"crossref","unstructured":"Iacono, J., Yagnatinsky, M.V.: A linear potential function for pairing heaps. In: COCOA, pp. 489\u2013504 (2016)","DOI":"10.1007\/978-3-319-48749-6_36"},{"issue":"1","key":"5_CR31","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s10817-016-9398-9","volume":"59","author":"S Jost","year":"2017","unstructured":"Jost, S., Vasconcelos, P., Florido, M., Hammond, K.: Type-based cost analysis for lazy functional languages. JAR 59(1), 87\u2013120 (2017)","journal-title":"JAR"},{"key":"5_CR32","doi-asserted-by":"publisher","unstructured":"Leutgeb, L.: ATLAS: Automated Amortised Complexity Analysis of Self-Adjusting Data Structures (2021). https:\/\/doi.org\/10.5281\/zenodo.4724917","DOI":"10.5281\/zenodo.4724917"},{"key":"5_CR33","doi-asserted-by":"publisher","unstructured":"Leutgeb, L.: ATLAS: Examples (2021). https:\/\/doi.org\/10.5281\/zenodo.4880499","DOI":"10.5281\/zenodo.4880499"},{"issue":"3\u20134","key":"5_CR34","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/s10472-011-9233-2","volume":"62","author":"J Marques-Silva","year":"2011","unstructured":"Marques-Silva, J., Argelich, J., Gra\u00e7a, A., Lynce, I.: Boolean lexicographic optimization: algorithms & applications. Ann. Math. Artif. Intell. 62(3\u20134), 317\u2013343 (2011)","journal-title":"Ann. Math. Artif. Intell."},{"key":"5_CR35","doi-asserted-by":"crossref","unstructured":"Moser, G., Schneckenreither, M.: Automated amortised resource analysis for term rewrite systems. Sci. Comput. Program. 185, 102306 (2020)","DOI":"10.1016\/j.scico.2019.102306"},{"key":"5_CR36","doi-asserted-by":"crossref","unstructured":"de Moura, L.M., Bj\u00f8rner, N.: Z3: an efficient SMT solver. In: TACAS, pp. 337\u2013340 (2008)","DOI":"10.1007\/978-3-540-78800-3_24"},{"issue":"3","key":"5_CR37","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/s10817-018-9459-3","volume":"62","author":"T Nipkow","year":"2019","unstructured":"Nipkow, T., Brinkop, H.: Amortized complexity verified. JAR 62(3), 367\u2013391 (2019)","journal-title":"JAR"},{"key":"5_CR38","volume-title":"Purely Functional Data Structures","author":"C Okasaki","year":"1999","unstructured":"Okasaki, C.: Purely Functional Data Structures. Cambridge University Press, Cambridge (1999)"},{"key":"5_CR39","doi-asserted-by":"crossref","unstructured":"Pani, T., Weissenbacher, G., Zuleger, F.: Rely-guarantee reasoning for automated bound analysis of lock-free algorithms. In: FMCAD, pp. 1\u20139 (2018)","DOI":"10.23919\/FMCAD.2018.8603020"},{"issue":"6","key":"5_CR40","doi-asserted-by":"publisher","first-page":"668","DOI":"10.1145\/78973.78977","volume":"33","author":"W Pugh","year":"1990","unstructured":"Pugh, W.: Skip lists: a probabilistic alternative to balanced trees. Commun. ACM 33(6), 668\u2013676 (1990)","journal-title":"Commun. ACM"},{"issue":"1","key":"5_CR41","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/0020-0190(93)90249-9","volume":"45","author":"B Schoenmakers","year":"1993","unstructured":"Schoenmakers, B.: A systematic analysis of splaying. IPL 45(1), 41\u201350 (1993)","journal-title":"IPL"},{"key":"5_CR42","unstructured":"Schoenmakers, B.: Data structures and amortized complexity in a functional setting. Ph.D. thesis, Eindhoven University of Technology (1992)"},{"key":"5_CR43","doi-asserted-by":"crossref","unstructured":"Sebastiani, R., Trentin, P.: Optimathsat: a tool for optimization modulo theories. In: CAV, pp. 447\u2013454 (2015)","DOI":"10.1007\/978-3-319-21690-4_27"},{"key":"5_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"745","DOI":"10.1007\/978-3-319-08867-9_50","volume-title":"Computer Aided Verification","author":"M Sinn","year":"2014","unstructured":"Sinn, M., Zuleger, F., Veith, H.: A simple and scalable static analysis for bound analysis and amortized complexity analysis. In: Biere, A., Bloem, R. (eds.) CAV 2014. LNCS, vol. 8559, pp. 745\u2013761. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-08867-9_50"},{"key":"5_CR45","doi-asserted-by":"crossref","unstructured":"Sinn, M., Zuleger, F., Veith, H.: Difference constraints: an adequate abstraction for complexity analysis of imperative programs. In: Kaivola, R., Wahl, T. (eds.) FMCAD, pp. 144\u2013151. IEEE (2015)","DOI":"10.1109\/FMCAD.2015.7542264"},{"issue":"1","key":"5_CR46","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10817-016-9402-4","volume":"59","author":"M Sinn","year":"2017","unstructured":"Sinn, M., Zuleger, F., Veith, H.: Complexity and resource bound analysis of imperative programs using difference constraints. JAR 59(1), 3\u201345 (2017)","journal-title":"JAR"},{"issue":"3","key":"5_CR47","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1145\/3828.3835","volume":"32","author":"D Sleator","year":"1985","unstructured":"Sleator, D., Tarjan, R.: Self-adjusting binary search trees. JACM 32(3), 652\u2013686 (1985)","journal-title":"JACM"},{"key":"5_CR48","doi-asserted-by":"crossref","unstructured":"Solar-Lezama, A.: The sketching approach to program synthesis. In: APLAS, pp. 4\u201313 (2009)","DOI":"10.1007\/978-3-642-10672-9_3"},{"issue":"2","key":"5_CR49","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1137\/0606031","volume":"6","author":"R Tarjan","year":"1985","unstructured":"Tarjan, R.: Amortized computational complexity. SIAM J. Alg. Disc. Meth 6(2), 306\u2013318 (1985)","journal-title":"SIAM J. Alg. Disc. Meth"},{"key":"5_CR50","doi-asserted-by":"crossref","unstructured":"Wang, P., Wang, D., Chlipala, A.: TiML: a functional language for practical complexity analysis with invariants. Proc. ACM Program. Lang. 1(OOPSLA), 1\u201326 (2017)","DOI":"10.1145\/3133903"},{"key":"5_CR51","doi-asserted-by":"crossref","unstructured":"Winkler, S., Moser, G.: Runtime complexity analysis of logically constrained rewriting. In: Proceedings of LOPSTR 2020 (2020)","DOI":"10.1007\/978-3-030-68446-4_2"},{"key":"5_CR52","doi-asserted-by":"crossref","unstructured":"Zuleger, F.: The polynomial complexity of vector addition systems with states. In: FOSSACS, pp. 622\u2013641 (2020)","DOI":"10.1007\/978-3-030-45231-5_32"}],"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-81688-9_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T10:10:07Z","timestamp":1725444607000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-81688-9_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030816872","9783030816889"],"references-count":52,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-81688-9_5","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)"}}]}}