{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,8]],"date-time":"2025-11-08T18:07:32Z","timestamp":1762625252385,"version":"3.40.3"},"publisher-location":"Cham","reference-count":46,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031572302"},{"type":"electronic","value":"9783031572319"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,4,6]],"date-time":"2024-04-06T00:00:00Z","timestamp":1712361600000},"content-version":"vor","delay-in-days":96,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>There are many evaluation strategies for term rewrite systems, but proving termination automatically is usually easiest for innermost rewriting. Several syntactic criteria exist when innermost termination implies full termination. We adapt these criteria to the probabilistic setting, e.g., we show when it suffices to analyze almost-sure termination (AST) w.r.t. innermost rewriting to prove full AST of probabilistic term rewrite systems. These criteria also apply to other notions of termination like positive AST. We implemented and evaluated our new contributions in the tool .<\/jats:p>","DOI":"10.1007\/978-3-031-57231-9_10","type":"book-chapter","created":{"date-parts":[[2024,4,5]],"date-time":"2024-04-05T18:01:54Z","timestamp":1712340114000},"page":"206-228","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["From Innermost to Full Almost-Sure Termination of Probabilistic Term Rewriting"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-9972-2470","authenticated-orcid":false,"given":"Jan-Christoph","family":"Kassing","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0902-1994","authenticated-orcid":false,"given":"Florian","family":"Frohn","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0283-8520","authenticated-orcid":false,"given":"J\u00fcrgen","family":"Giesl","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,4,6]]},"reference":[{"key":"10_CR1","doi-asserted-by":"publisher","unstructured":"G. Agha, J. Meseguer, and K. Sen. \u201cPMaude: Rewrite-based Specification Language for Probabilistic Object Systems\u201d. In: Proc. QAPL \u201905. ENTCS 153. 2006, pp. 213\u2013239. https:\/\/doi.org\/10.1016\/j.entcs.2005.10.040.","DOI":"10.1016\/j.entcs.2005.10.040"},{"key":"10_CR2","doi-asserted-by":"publisher","unstructured":"S. Agrawal, K. Chatterjee, and P. Novotn\u00fd. \u201cLexicographic Ranking Supermartingales: An Efficient Approach to Termination of Probabilistic Programs\u201d. In: Proc. ACM Program. Lang. 2.POPL (2017). https:\/\/doi.org\/10.1145\/3158122.","DOI":"10.1145\/3158122"},{"key":"10_CR3","doi-asserted-by":"publisher","unstructured":"T. Arts and J. Giesl. \u201cTermination of Term Rewriting Using Dependency Pairs\u201d. In: Theor. Comput. Sc. 236.1-2 (2000), pp. 133\u2013178. https:\/\/doi.org\/10.1016\/S0304-3975(99)00207-8.","DOI":"10.1016\/S0304-3975(99)00207-8"},{"key":"10_CR4","doi-asserted-by":"publisher","unstructured":"M. Avanzini, U. Dal Lago, and A. Yamada. \u201cOn Probabilistic Term Rewriting\u201d. In: Sci. Comput. Program. 185 (2020). https:\/\/doi.org\/10.1016\/j.scico.2019.102338.","DOI":"10.1016\/j.scico.2019.102338"},{"key":"10_CR5","doi-asserted-by":"publisher","unstructured":"M. Avanzini, G. Moser, and M. Schaper. \u201cA Modular Cost Analysis for Probabilistic Programs\u201d. In: Proc. ACM Program. Lang. 4.OOPSLA (2020). https:\/\/doi.org\/10.1145\/3428240.","DOI":"10.1145\/3428240"},{"key":"10_CR6","doi-asserted-by":"publisher","unstructured":"F. Baader and T. Nipkow. Term Rewriting and All That. Cambridge University Press, 1998. https:\/\/doi.org\/10.1017\/CBO9781139172752.","DOI":"10.1017\/CBO9781139172752"},{"key":"10_CR7","doi-asserted-by":"publisher","unstructured":"K. Batz, B. L. Kaminski, J.-P. Katoen, C. Matheja, and L. Verscht. \u201cA Calculus for Amortized Expected Runtimes\u201d. In: Proc. ACM Program. Lang. 7.POPL (2023). https:\/\/doi.org\/10.1145\/3571260.","DOI":"10.1145\/3571260"},{"key":"10_CR8","doi-asserted-by":"publisher","unstructured":"R. Beutner and L. Ong. \u201cOn Probabilistic Termination of Functional Programs with Continuous Distributions\u201d. In: Proc. PLDI \u201921. 2021, pp. 1312\u20131326. https:\/\/doi.org\/10.1145\/3453483.3454111.","DOI":"10.1145\/3453483.3454111"},{"key":"10_CR9","doi-asserted-by":"publisher","unstructured":"O. Bournez and C. Kirchner. \u201cProbabilistic Rewrite Strategies. Applications to ELAN\u201d. In: Proc. RTA \u201902. LNCS 2378. 2002, pp. 252\u2013266. https:\/\/doi.org\/10.1007\/3-540-45610-4_18.","DOI":"10.1007\/3-540-45610-4_18"},{"key":"10_CR10","doi-asserted-by":"publisher","unstructured":"O. Bournez and F. Garnier. \u201cProving Positive Almost-Sure Termination\u201d. In: Proc. RTA \u201905. LNCS 3467. 2005, pp. 323\u2013337. https:\/\/doi.org\/10.1007\/978-3-540-32033-3_24.","DOI":"10.1007\/978-3-540-32033-3_24"},{"key":"10_CR11","doi-asserted-by":"publisher","unstructured":"K. Chatterjee, H. Fu, and P. Novotn\u00fd;. \u201cTermination Analysis of Probabilistic Programs with Martingales\u201d. In: Foundations of Probabilistic Programming. Ed. by G. Barthe, J. Katoen, and A. Silva. Cambridge University Press, 2020, 221\u2013258. https:\/\/doi.org\/10.1017\/9781108770750.008.","DOI":"10.1017\/9781108770750.008"},{"key":"10_CR12","doi-asserted-by":"publisher","unstructured":"U. Dal Lago and C. Grellois. \u201cProbabilistic Termination by Monadic Affine Sized Typing\u201d. In: Proc. ESOP \u201917. LNCS 10201. 2017, pp. 393\u2013419. https:\/\/doi.org\/10.1007\/978-3-662-54434-1_15.","DOI":"10.1007\/978-3-662-54434-1_15"},{"key":"10_CR13","doi-asserted-by":"publisher","unstructured":"U. Dal Lago, C. Faggian, and S. R. Della Rocca. \u201cIntersection Types and (Positive) Almost-Sure Termination\u201d. In: Proc. ACM Program. Lang. 5.POPL (2021). https:\/\/doi.org\/10.1145\/3434313.","DOI":"10.1145\/3434313"},{"key":"10_CR14","doi-asserted-by":"publisher","unstructured":"A. D\u00edaz-Caro and G. Mart\u00ednez. \u201cConfluence in Probabilistic Rewriting\u201d. In: Proc. LSFA \u201917. ENTCS 338. 2018, pp. 115\u2013131. https:\/\/doi.org\/10.1016\/j.entcs.2018.10.008.","DOI":"10.1016\/j.entcs.2018.10.008"},{"key":"10_CR15","doi-asserted-by":"publisher","unstructured":"C. Faggian. \u201cProbabilistic Rewriting and Asymptotic Behaviour: On Termination and Unique Normal Forms\u201d. In: Log. Methods in Comput. Sci. 18.2 (2022). https:\/\/doi.org\/10.46298\/lmcs-18(2:5)2022.","DOI":"10.46298\/lmcs-18(2:5)2022"},{"key":"10_CR16","doi-asserted-by":"publisher","unstructured":"L. M. Ferrer Fioriti and H. Hermanns. \u201cProbabilistic Termination: Soundness, Completeness, and Compositionality\u201d. In: Proc. POPL \u201915. 2015, pp. 489\u2013501. https:\/\/doi.org\/10.1145\/2676726.2677001.","DOI":"10.1145\/2676726.2677001"},{"key":"10_CR17","doi-asserted-by":"publisher","unstructured":"F. Frohn and J. Giesl. \u201cAnalyzing Runtime Complexity via Innermost Runtime Complexity\u201d. In: Proc. LPAR \u201917. EPiC 46. 2017, pp. 249\u2013228. https:\/\/doi.org\/10.29007\/1nbh.","DOI":"10.29007\/1nbh"},{"key":"10_CR18","doi-asserted-by":"publisher","unstructured":"H. Fu and K. Chatterjee. \u201cTermination of Nondeterministic Probabilistic Programs\u201d. In: Proc. VMCAI \u201919. LNCS 11388. 2019, pp. 468\u2013490. https:\/\/doi.org\/10.1007\/978-3-030-11245-5_22.","DOI":"10.1007\/978-3-030-11245-5_22"},{"key":"10_CR19","doi-asserted-by":"publisher","unstructured":"C. Fuhs. \u201cTransforming Derivational Complexity of Term Rewriting to Runtime Complexity\u201d. In: Proc. FroCoS \u201919. LNCS 11715. 2019, pp. 348\u2013364. https:\/\/doi.org\/10.1007\/978-3-030-29007-8_20.","DOI":"10.1007\/978-3-030-29007-8_20"},{"key":"10_CR20","doi-asserted-by":"publisher","unstructured":"J. Giesl, R. Thiemann, P. Schneider-Kamp, and S. Falke. \u201cMechanizing and Improving Dependency Pairs\u201d. In: J. Autom. Reason. 37.3 (2006), pp. 155\u2013203. https:\/\/doi.org\/10.1007\/s10817-006-9057-7.","DOI":"10.1007\/s10817-006-9057-7"},{"key":"10_CR21","doi-asserted-by":"publisher","unstructured":"J. Giesl, C. Aschermann, M. Brockschmidt, F. Emmes, F. Frohn, C. Fuhs, J. Hensel, C. Otto, M. Pl\u00fccker, P. Schneider-Kamp, T. Str\u00f6der, S. Swiderski, and R. Thiemann. \u201cAnalyzing Program Termination and Complexity Automatically with AProVE\u201d. In: J. Autom. Reason. 58.1 (2017), pp. 3\u201331. https:\/\/doi.org\/10.1007\/s10817-016-9388-y.","DOI":"10.1007\/s10817-016-9388-y"},{"key":"10_CR22","doi-asserted-by":"publisher","unstructured":"J. Giesl, P. Giesl, and M. Hark. \u201cComputing Expected Runtimes for Constant Probability Programs\u201d. In: Proc. CADE \u201919. LNCS 11716. 2019, pp. 269\u2013286. https:\/\/doi.org\/10.1007\/978-3-030-29436-6_16.","DOI":"10.1007\/978-3-030-29436-6_16"},{"key":"10_CR23","doi-asserted-by":"publisher","unstructured":"A. D. Gordon, T. A. Henzinger, A. V. Nori, and S. K. Rajamani. \u201cProbabilistic Programming\u201d. In: Proc. FOSE \u201914. 2014, pp. 167\u2013181. https:\/\/doi.org\/10.1145\/2593882.2593900.","DOI":"10.1145\/2593882.2593900"},{"key":"10_CR24","doi-asserted-by":"publisher","unstructured":"B. Gramlich. \u201cAbstract Relations between Restricted Termination and Confluence Properties of Rewrite Systems\u201d. In: Fundamenta Informaticae 24 (1995), pp. 2\u201323. https:\/\/doi.org\/10.3233\/FI-1995-24121.","DOI":"10.3233\/FI-1995-24121"},{"key":"10_CR25","doi-asserted-by":"publisher","unstructured":"R. Guti\u00e9rrez and S. Lucas. \u201cMU-TERM: Verify Termination Properties Automatically (System Description)\u201d. In: Proc. IJCAR \u201920. LNCS 12167. 2020, pp. 436\u2013447. https:\/\/doi.org\/10.1007\/978-3-030-51054-1_28.","DOI":"10.1007\/978-3-030-51054-1_28"},{"key":"10_CR26","doi-asserted-by":"publisher","unstructured":"M. Huang, H. Fu, K. Chatterjee, and A. K. Goharshady. \u201cModular Verification for Almost-Sure Termination of Probabilistic Programs\u201d. In: Proc. \u00a0ACM Program. \u00a0Lang. 3.OOPSLA (2019). https:\/\/doi.org\/10.1145\/3360555.","DOI":"10.1145\/3360555"},{"key":"10_CR27","doi-asserted-by":"publisher","unstructured":"B. L. Kaminski, J.-P. Katoen, C. Matheja, and F. Olmedo. \u201cWeakest Precondition Reasoning for Expected Runtimes of Randomized Algorithms\u201d. In: J. ACM 65 (2018), pp. 1\u201368. https:\/\/doi.org\/10.1145\/3208102.","DOI":"10.1145\/3208102"},{"key":"10_CR28","doi-asserted-by":"publisher","unstructured":"B. L. Kaminski, J. Katoen, and C. Matheja. \u201cExpected Runtime Analyis by Program Verification\u201d. In: Foundations of Probabilistic Programming. Ed. by G. Barthe, J. Katoen, and A. Silva. Cambridge University Press, 2020, 185\u2013220. https:\/\/doi.org\/10.1017\/9781108770750.007.","DOI":"10.1017\/9781108770750.007"},{"key":"10_CR29","doi-asserted-by":"publisher","unstructured":"J.-C. Kassing and J. Giesl. \u201cProving Almost-Sure Innermost Termination of Probabilistic Term Rewriting Using Dependency Pairs\u201d. In: Proc. \u00a0CADE \u00a0\u201923. LNCS 14132. 2023, pp. 344\u2013364. https:\/\/doi.org\/10.1007\/978-3-031-38499-8_20.","DOI":"10.1007\/978-3-031-38499-8_20"},{"key":"10_CR30","doi-asserted-by":"publisher","unstructured":"J.-C. Kassing, F. Frohn, and J. Giesl. \u201cFrom Innermost to Full Almost-Sure Termination of Probabilistic Term Rewriting\u201d. In: CoRR abs\/2310.06121 (2023). https:\/\/doi.org\/10.48550\/arXiv.2310.06121.","DOI":"10.48550\/arXiv.2310.06121"},{"key":"10_CR31","doi-asserted-by":"publisher","unstructured":"J.-C. Kassing, F. Frohn, and J. Giesl. From Innermost to Full Almost-Sure Termination of Probabilistic Term Rewriting - AProVE Artifact. 2024. https:\/\/doi.org\/10.5281\/zenodo.10449299.","DOI":"10.5281\/zenodo.10449299"},{"key":"10_CR32","doi-asserted-by":"publisher","unstructured":"J.-C. Kassing, S. Dollase, and J. Giesl. \u201cA Complete Dependency Pair Framework for Almost-Sure Innermost Termination of Probabilistic Term Rewriting\u201d. In: Proc. \u00a0FLOPS \u00a0\u201924. LNCS. To appear. Long version at CoRR abs\/2309.00344. 2024. https:\/\/doi.org\/10.48550\/arXiv.2309.00344.","DOI":"10.48550\/arXiv.2309.00344"},{"key":"10_CR33","doi-asserted-by":"publisher","unstructured":"M. Korp, C. Sternagel, H. Zankl, and A. Middeldorp. \u201cTyrolean Termination Tool 2\u201d. In: Proc. \u00a0RTA \u00a0\u201909. LNCS 5595. 2009, pp. 295\u2013304. https:\/\/doi.org\/10.1007\/978-3-642-02348-4_21.","DOI":"10.1007\/978-3-642-02348-4_21"},{"key":"10_CR34","doi-asserted-by":"publisher","unstructured":"M. R. K. Krishna Rao. \u201cSome Characteristics of Strong Innermost Normalization\u201d. In: Theor. \u00a0Comput. \u00a0Sc. 239 (2000), pp. 141\u2013164. https:\/\/doi.org\/10.1016\/S0304-3975(99)00215-7.","DOI":"10.1016\/S0304-3975(99)00215-7"},{"key":"10_CR35","doi-asserted-by":"publisher","unstructured":"L. Leutgeb, G. Moser, and F. Zuleger. \u201cAutomated Expected Amortised Cost Analysis of Probabilistic Data Structures\u201d. In: Proc. \u00a0CAV \u00a0\u201922. LNCS 13372. 2022, pp. 70\u201391. https:\/\/doi.org\/10.1007\/978-3-031-13188-2_4.","DOI":"10.1007\/978-3-031-13188-2_4"},{"key":"10_CR36","doi-asserted-by":"publisher","unstructured":"A. McIver, C. Morgan, B. L. Kaminski, and J.-P. Katoen. \u201cA New Proof Rule for Almost-Sure Termination\u201d. In: Proc. \u00a0ACM Program. Lang. 2.POPL (2018). https:\/\/doi.org\/10.1145\/3158121.","DOI":"10.1145\/3158121"},{"key":"10_CR37","doi-asserted-by":"publisher","unstructured":"F. Meyer, M. Hark, and J. Giesl. \u201cInferring Expected Runtimes of Probabilistic Integer Programs Using Expected Sizes\u201d. In: Proc. TACAS \u201921. LNCS 12651. 2021, pp. 250\u2013269. https:\/\/doi.org\/10.1007\/978-3-030-72016-2_14.","DOI":"10.1007\/978-3-030-72016-2_14"},{"key":"10_CR38","doi-asserted-by":"publisher","unstructured":"M. Moosbrugger, E. Bartocci, J. Katoen, and L. Kov\u00e1cs. \u201cAutomated Termination Analysis of Polynomial Probabilistic Programs\u201d. In: Proc. \u00a0ESOP \u00a0\u201921. LNCS 12648. 2021, pp. 491\u2013518. https:\/\/doi.org\/10.1007\/978-3-030-72019-3_18.","DOI":"10.1007\/978-3-030-72019-3_18"},{"key":"10_CR39","doi-asserted-by":"crossref","unstructured":"M. H. A. Newman. \u201cOn Theories with a Combinatorial Definition of Equivalence\u201d. In: Annals of Mathematics 43.2 (1942), pp.\u00a0223\u2013242. URL: http:\/\/www.ens-lyon.fr\/LIP\/REWRITING\/TERMINATION\/NEWMAN\/Newman.pdf.","DOI":"10.2307\/1968867"},{"key":"10_CR40","doi-asserted-by":"publisher","unstructured":"V. C. Ngo, Q. Carbonneaux, and J. Hoffmann. \u201cBounded Expectations: Resource Analysis for Probabilistic Programs\u201d. In: Proc. PLDI \u201918. 2018, pp. 496\u2013512. https:\/\/doi.org\/10.1145\/3192366.3192394.","DOI":"10.1145\/3192366.3192394"},{"key":"10_CR41","doi-asserted-by":"publisher","unstructured":"M. J. O\u2019Donnell. Computing in Systems Described by Equations. LNCS 58. 1977. https:\/\/doi.org\/10.1007\/3-540-08531-9.","DOI":"10.1007\/3-540-08531-9"},{"key":"10_CR42","doi-asserted-by":"publisher","unstructured":"N. Saheb-Djahromi. \u201cProbabilistic LCF\u201d. In: Proc. MFCS \u201978. LNCS 64. 1978, pp. 442\u2013451. https:\/\/doi.org\/10.1007\/3-540-08921-7_92.","DOI":"10.1007\/3-540-08921-7_92"},{"key":"10_CR43","doi-asserted-by":"publisher","unstructured":"R. Thiemann and C. Sternagel. \u201cCertification of Termination Proofs Using \u201d. In: Proc. \u00a0TPHOLs \u00a0\u201909. LNCS 5674. 2009, pp. 452\u2013468. https:\/\/doi.org\/10.1007\/978-3-642-03359-9_31.","DOI":"10.1007\/978-3-642-03359-9_31"},{"key":"10_CR44","doi-asserted-by":"publisher","unstructured":"Y. Toyama. \u201cCounterexamples to the Termination for the Direct Sum of Term Rewriting Systems\u201d. In: Inf. \u00a0Proc. \u00a0Lett. 25 (1987), pp.\u00a0141\u2013143. https:\/\/doi.org\/10.1016\/0020-0190(87)90122-0.","DOI":"10.1016\/0020-0190(87)90122-0"},{"key":"10_CR45","doi-asserted-by":"publisher","unstructured":"D. Wang, D. M. Kahn, and J. Hoffmann. \u201cRaising Expectations: Automating Expected Cost Analysis with Types\u201d. In: Proc. \u00a0ACM Program. \u00a0Lang. 4.ICFP (2020). https:\/\/doi.org\/10.1145\/3408992.","DOI":"10.1145\/3408992"},{"key":"10_CR46","doi-asserted-by":"publisher","unstructured":"A. Yamada, K. Kusakari, and T. Sakabe. \u201cNagoya Termination Tool\u201d. In: Proc. RTA-TLCA \u201914. LNCS 8560. 2014, pp. 466\u2013475. https:\/\/doi.org\/10.1007\/978-3-319-08918-8_32.","DOI":"10.1007\/978-3-319-08918-8_32"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-57231-9_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,3]],"date-time":"2024-05-03T16:04:15Z","timestamp":1714752255000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-57231-9_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031572302","9783031572319"],"references-count":46,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-57231-9_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"6 April 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FoSSaCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Foundations of Software Science and Computation Structures","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Luxembourg City","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Luxembourg","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 April 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 April 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fossacs2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/etaps.org\/2024\/conferences\/fossacs\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-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":"79","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":"24","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":"30% - 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":"9","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)"}}]}}