{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T10:42:41Z","timestamp":1770288161217,"version":"3.49.0"},"publisher-location":"Cham","reference-count":46,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031210365","type":"print"},{"value":"9783031210372","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-21037-2_5","type":"book-chapter","created":{"date-parts":[[2022,11,25]],"date-time":"2022-11-25T00:05:14Z","timestamp":1669334714000},"page":"88-109","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Automated Temporal Verification for\u00a0Algebraic Effects"],"prefix":"10.1007","author":[{"given":"Yahui","family":"Song","sequence":"first","affiliation":[]},{"given":"Darius","family":"Foo","sequence":"additional","affiliation":[]},{"given":"Wei-Ngan","family":"Chin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,11,25]]},"reference":[{"issue":"1","key":"5_CR1","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1016\/j.jlamp.2014.02.001","volume":"84","author":"A Bauer","year":"2015","unstructured":"Bauer, A., Pretnar, M.: Programming with algebraic effects and handlers. J. Log. Algebraic Methods Program. 84(1), 108\u2013123 (2015). https:\/\/doi.org\/10.1016\/j.jlamp.2014.02.001","journal-title":"J. Log. Algebraic Methods Program."},{"key":"5_CR2","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796820000039","volume":"30","author":"L Convent","year":"2020","unstructured":"Convent, L., Lindley, S., McBride, C., McLaughlin, C.: Doo bee doo bee doo. J. Funct. Program. 30, e9 (2020). https:\/\/doi.org\/10.1017\/S0956796820000039","journal-title":"J. Funct. Program."},{"key":"5_CR3","doi-asserted-by":"publisher","unstructured":"Hillerstr\u00f6m, D., Lindley, S., Atkey, R.: Effect handlers via generalised continuations. J. Funct. Program. 30, e5 (2020). https:\/\/doi.org\/10.1017\/S0956796820000040","DOI":"10.1017\/S0956796820000040"},{"key":"5_CR4","doi-asserted-by":"publisher","unstructured":"Sivaramakrishnan, K.C., Dolan, S., White, L., Kelly, T., Jaffer, S., Madhavapeddy, A.: Retrofitting effect handlers onto OCaml. In: PLDI \u201921: 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, Virtual Event, Canada, June 20\u201325, 2021, S. N. Freund and E. Yahav, Eds. ACM, pp. 206\u2013221 (2021). https:\/\/doi.org\/10.1145\/3453483.3454039","DOI":"10.1145\/3453483.3454039"},{"key":"5_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1017\/S0956796820000027","volume":"30","author":"JI Brachth\u00e4user","year":"2020","unstructured":"Brachth\u00e4user, J.I., Schuster, P., Ostermann, K.: Effekt: capability-passing style for type-and effect-safe, extensible effect handlers in scala. J. Funct. Programm. 30, 1\u201346 (2020)","journal-title":"J. Funct. Programm."},{"key":"5_CR6","doi-asserted-by":"publisher","unstructured":"Leijen, D.: Koka: programming with row polymorphic effect types. In: Proceedings 5th Workshop on Mathematically Structured Functional Programming, MSFP@ETAPS 2014, Grenoble, France, 12 April 2014, ser. EPTCS, P. B. Levy and N. Krishnaswami, Eds., vol. 153, pp. 100\u2013126 (2014). https:\/\/doi.org\/10.4204\/EPTCS.153.8","DOI":"10.4204\/EPTCS.153.8"},{"issue":"2","key":"5_CR7","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1023\/A:1010068630801","volume":"11","author":"PJ Landin","year":"1998","unstructured":"Landin, P.J.: A generalization of jumps and labels. Higher-Order Symbolic Comput. 11(2), 125\u2013143 (1998). https:\/\/doi.org\/10.1023\/A:1010068630801","journal-title":"Higher-Order Symbolic Comput."},{"key":"5_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3434314","volume":"5","author":"PE De Vilhena","year":"2021","unstructured":"De Vilhena, P.E., Pottier, F.: A separation logic for effect handlers. Proc. ACM Program. Lang. 5, 1\u201328 (2021). https:\/\/doi.org\/10.1145\/3434314","journal-title":"Proc. ACM Program. Lang."},{"key":"5_CR9","unstructured":"Recursive cow. https:\/\/github.com\/effect-handlers\/effects-rosetta-stone\/tree\/master\/examples\/recursive-cow"},{"key":"5_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/978-3-030-02768-1_22","volume-title":"Programming Languages and Systems","author":"D Hillerstr\u00f6m","year":"2018","unstructured":"Hillerstr\u00f6m, D., Lindley, S.: Shallow effect handlers. In: Ryu, S. (ed.) APLAS 2018. LNCS, vol. 11275, pp. 415\u2013435. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-02768-1_22"},{"issue":"9","key":"5_CR11","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1145\/2544174.2500590","volume":"48","author":"O Kammar","year":"2013","unstructured":"Kammar, O., Lindley, S., Oury, N.: Handlers in action. ACM SIGPLAN Notices 48(9), 145\u2013158 (2013)","journal-title":"ACM SIGPLAN Notices"},{"key":"5_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/3-540-60249-6_44","volume-title":"Fundamentals of Computation Theory","author":"V Antimirov","year":"1995","unstructured":"Antimirov, V.: Rewriting regular inequalities. In: Reichel, H. (ed.) FCT 1995. LNCS, vol. 965, pp. 116\u2013125. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-60249-6_44"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Nanjo, Y., Unno, H., Koskinen, E., Terauchi, T.: A fixpoint logic and dependent effects for temporal property verification. In: Proceedings of the 33rd Annual ACM\/IEEE Symposium on Logic in Computer Science, ACM, pp. 759\u2013768 (2018)","DOI":"10.1145\/3209108.3209204"},{"issue":"1","key":"5_CR14","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/0304-3975(95)80024-4","volume":"143","author":"VM Antimirov","year":"1995","unstructured":"Antimirov, V.M., Mosses, P.D.: Rewriting extended regular expressions. Theor. Comput. Sci. 143(1), 51\u201372 (1995). https:\/\/doi.org\/10.1016\/0304-3975(95)80024-4","journal-title":"Theor. Comput. Sci."},{"key":"5_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1007\/3-540-59042-0_96","volume-title":"STACS 95","author":"V Antimirov","year":"1995","unstructured":"Antimirov, V.: Partial derivatives of regular expressions and finite automata constructions. In: Mayr, E.W., Puech, C. (eds.) STACS 1995. LNCS, vol. 900, pp. 455\u2013466. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-59042-0_96"},{"key":"5_CR16","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/11554554_8","volume-title":"Automated Reasoning with Analytic Tableaux and Related Methods","author":"J Brotherston","year":"2005","unstructured":"Brotherston, J.: Cyclic proofs for first-order logic with inductive definitions. In: Beckert, B. (ed.) TABLEAUX 2005. LNCS (LNAI), vol. 3702, pp. 78\u201392. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11554554_8"},{"key":"5_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/978-3-540-75292-9_20","volume-title":"Theoretical Aspects of Computing \u2013 ICTAC 2007","author":"M Leucker","year":"2007","unstructured":"Leucker, M., S\u00e1nchez, C.: Regular linear temporal logic. In: Jones, C.B., Liu, Z., Woodcock, J. (eds.) ICTAC 2007. LNCS, vol. 4711, pp. 291\u2013305. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-75292-9_20"},{"key":"5_CR18","unstructured":"Zenodo. https:\/\/zenodo.org\/record\/7009799#.Yw-yyuxBwRS"},{"key":"5_CR19","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":"5_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/978-3-030-63406-3_5","volume-title":"Formal Methods and Software Engineering","author":"Y Song","year":"2020","unstructured":"Song, Y., Chin, W.-N.: Automated temporal verification of integrated dependent effects. In: Lin, S.-W., Hou, Z., Mahony, B. (eds.) ICFEM 2020. LNCS, vol. 12531, pp. 73\u201390. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-63406-3_5"},{"issue":"4","key":"5_CR21","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1142\/S0129054109006802","volume":"20","author":"M Almeida","year":"2009","unstructured":"Almeida, M., Moreira, N., Reis, R.: Antimirov and Mosses\u2019s rewrite system revisited. Int. J. Found. Comput. Sci. 20(4), 669\u2013684 (2009). https:\/\/doi.org\/10.1142\/S0129054109006802","journal-title":"Int. J. Found. Comput. Sci."},{"key":"5_CR22","doi-asserted-by":"publisher","unstructured":"Keil, M., Thiemann, P.: Symbolic solving of extended regular expression inequalities. In: 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, FSTTCS 2014, December 15\u201317, 2014, New Delhi, India, ser. LIPIcs, V. Raman and S. P. Suresh, Eds., vol. 29. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, pp. 175\u2013186 (2014). https:\/\/doi.org\/10.4230\/LIPIcs.FSTTCS.2014.175","DOI":"10.4230\/LIPIcs.FSTTCS.2014.175"},{"issue":"6","key":"5_CR23","doi-asserted-by":"publisher","first-page":"1795","DOI":"10.1016\/j.jcss.2011.12.003","volume":"78","author":"D Hovland","year":"2012","unstructured":"Hovland, D.: The inclusion problem for regular expressions. J. Comput. Syst. Sci. 78(6), 1795\u20131813 (2012). https:\/\/doi.org\/10.1016\/j.jcss.2011.12.003","journal-title":"J. Comput. Syst. Sci."},{"key":"5_CR24","unstructured":"Exception WiKi. https:\/\/en.wikipedia.org\/wiki\/Exception_handling"},{"key":"5_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/978-3-030-67067-2_19","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"Y Song","year":"2021","unstructured":"Song, Y., Chin, W.-N.: A synchronous effects logic for temporal verification of pure esterel. In: Henglein, F., Shoham, S., Vizel, Y. (eds.) VMCAI 2021. LNCS, vol. 12597, pp. 417\u2013440. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-67067-2_19"},{"key":"5_CR26","doi-asserted-by":"crossref","unstructured":"Hofmann, M., Chen, W.: Abstract interpretation from b\u00fcchi automata. In: Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS), p. 51. ACM (2014)","DOI":"10.1145\/2603088.2603127"},{"key":"5_CR27","doi-asserted-by":"crossref","unstructured":"Koskinen, E., Terauchi, T.: Local temporal reasoning. In: Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS), p. 59. ACM (2014)","DOI":"10.1145\/2603088.2603138"},{"key":"5_CR28","doi-asserted-by":"crossref","unstructured":"Daan, L.: Type directed compilation of row-typed algebraic effects. In: Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, pp. 486\u2013499 (2017)","DOI":"10.1145\/3093333.3009872"},{"key":"5_CR29","doi-asserted-by":"crossref","unstructured":"Biernacki, D., Pir\u00f3g, M., Polesiuk, P., Sieczkowski, F.: Abstracting algebraic effects. In: Proceedings of the ACM on Programming Languages, vol. 3, no. POPL, pp. 1\u201328 (2019)","DOI":"10.1145\/3290319"},{"key":"5_CR30","doi-asserted-by":"crossref","unstructured":"Dariusz, B., Maciej, P., Piotr, P., Filip, S.: Binders by day, labels by night: effect instances via lexically scoped handlers. In: Proceedings of the ACM on Programming Languages, vol. 4, no. POPL, pp. 1\u201329 (2019)","DOI":"10.1145\/3371116"},{"key":"5_CR31","unstructured":"Lindley, S., McBride, C., McLaughlin, C.: Do be do be do. CoRR, vol. abs\/1611.09259, (2016). http:\/\/arxiv.org\/abs\/1611.09259"},{"key":"5_CR32","doi-asserted-by":"crossref","unstructured":"Lindley, S., Cheney, J.: Row-based effect types for database integration. In: Proceedings of the 8th ACM SIGPLAN Workshop on Types in Language Design and Implementation, pp. 91\u2013102 (2012)","DOI":"10.1145\/2103786.2103798"},{"key":"5_CR33","unstructured":"Leijen, D.: Algebraic effect handlers with resources and deep finalization. Technical Report MSR-TR-2018-10. Tech. Rep, Microsoft Research (2018)"},{"key":"5_CR34","doi-asserted-by":"crossref","unstructured":"Pretnar, M.: Inferring algebraic effects. arXiv preprint arXiv:1312.2334 (2013)","DOI":"10.2168\/LMCS-10(3:21)2014"},{"issue":"2","key":"5_CR35","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1017\/S0956796807006466","volume":"18","author":"C Skalka","year":"2008","unstructured":"Skalka, C., Smith, S., Van Horn, D.: Types and trace effects of higher order programs. J. Funct. Programm. 18(2), 179\u2013249 (2008)","journal-title":"J. Funct. Programm."},{"key":"5_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/978-3-540-30477-7_8","volume-title":"Programming Languages and Systems","author":"C Skalka","year":"2004","unstructured":"Skalka, C., Smith, S.: History effects and verification. In: Chin, W.-N. (ed.) APLAS 2004. LNCS, vol. 3302, pp. 107\u2013128. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30477-7_8"},{"key":"5_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1007\/978-3-540-40018-9_15","volume-title":"Programming Languages and Systems","author":"K Marriott","year":"2003","unstructured":"Marriott, K., Stuckey, P.J., Sulzmann, M.: Resource usage verification. In: Ohori, A. (ed.) APLAS 2003. LNCS, vol. 2895, pp. 212\u2013229. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-40018-9_15"},{"issue":"2","key":"5_CR38","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1006\/inco.1994.1046","volume":"111","author":"J-P Talpin","year":"1994","unstructured":"Talpin, J.-P., Jouvelot, P.: The type and effect discipline. Inf. Comput. 111(2), 245\u2013296 (1994)","journal-title":"Inf. Comput."},{"key":"5_CR39","doi-asserted-by":"crossref","unstructured":"Amtoft, T., Nielson, H.R., Nielson, F.: Type and effect systems: behaviours for concurrency. World Sci. (1999)","DOI":"10.1142\/p132"},{"key":"5_CR40","doi-asserted-by":"crossref","unstructured":"Foster, J.S., Terauchi, T., Aiken, A.: Flow-sensitive type qualifiers. In: Proceedings of the ACM SIGPLAN 2002 Conference on Programming language design and implementation, pp. 1\u201312 (2002)","DOI":"10.1145\/543552.512531"},{"key":"5_CR41","doi-asserted-by":"crossref","unstructured":"Bartoletti, M., Degano, P., Ferrari, G.L.: Enforcing secure service composition. In: 18th IEEE Computer Security Foundations Workshop (CSFW\u201905). IEEE, pp. 211\u2013223 (2005)","DOI":"10.1109\/CSFW.2005.17"},{"issue":"2","key":"5_CR42","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/j.jsc.2010.08.004","volume":"46","author":"G Malecha","year":"2011","unstructured":"Malecha, G., Morrisett, G., Wisnesky, R.: Trace-based verification of imperative programs with i\/o. J. Symbolic Comput. 46(2), 95\u2013118 (2011)","journal-title":"J. Symbolic Comput."},{"key":"5_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"488","DOI":"10.1007\/978-3-642-11957-6_26","volume-title":"Programming Languages and Systems","author":"K Nakata","year":"2010","unstructured":"Nakata, K., Uustalu, T.: A Hoare logic for the coinductive trace-based big-step semantics of while. In: Gordon, A.D. (ed.) ESOP 2010. LNCS, vol. 6012, pp. 488\u2013506. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-11957-6_26"},{"key":"5_CR44","doi-asserted-by":"crossref","unstructured":"Neamtiu, I., Hicks, M., Foster, J.S., Pratikakis, P.: Contextual effects for version-consistent dynamic software updating and safe concurrent programming. In: Proceedings of the 35th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 37\u201349 (2008)","DOI":"10.1145\/1328897.1328447"},{"key":"5_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/BFb0053595","volume-title":"Fundamental Approaches to Software Engineering","author":"HR Nielson","year":"1998","unstructured":"Nielson, H.R., Amtoft, T., Nielson, F.: Behaviour analysis and safety conditions: a case study in CML. In: Astesiano, E. (ed.) FASE 1998. LNCS, vol. 1382, pp. 255\u2013269. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0053595"},{"key":"5_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/3-540-56883-2_10","volume-title":"Functional Programming, Concurrency, Simulation and Automated Reasoning","author":"JH Reppy","year":"1993","unstructured":"Reppy, J.H.: Concurrent ML: design, application and semantics. In: Lauer, P.E. (ed.) Functional Programming, Concurrency, Simulation and Automated Reasoning. LNCS, vol. 693, pp. 165\u2013198. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-56883-2_10"}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-21037-2_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,9]],"date-time":"2024-10-09T14:31:21Z","timestamp":1728484281000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-21037-2_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031210365","9783031210372"],"references-count":46,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-21037-2_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"25 November 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"APLAS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Asian Symposium on Programming Languages and Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Auckland","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"New Zealand","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 December 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 December 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aplas2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conf.researchr.org\/home\/aplas-2022","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":"HotCRP","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"22","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":"10","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":"45% - 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":"4","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":"4","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)"}}]}}