{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T17:05:28Z","timestamp":1761930328783,"version":"3.40.3"},"publisher-location":"Cham","reference-count":42,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031477041"},{"type":"electronic","value":"9783031477058"}],"license":[{"start":{"date-parts":[[2023,11,6]],"date-time":"2023-11-06T00:00:00Z","timestamp":1699228800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,11,6]],"date-time":"2023-11-06T00:00:00Z","timestamp":1699228800000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-47705-8_13","type":"book-chapter","created":{"date-parts":[[2023,11,10]],"date-time":"2023-11-10T09:02:24Z","timestamp":1699606944000},"page":"237-256","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Performance Fuzzing\u00a0with Reinforcement-Learning and\u00a0Well-Defined Constraints for\u00a0the\u00a0B Method"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0819-5554","authenticated-orcid":false,"given":"Jannik","family":"Dunkelau","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4595-1518","authenticated-orcid":false,"given":"Michael","family":"Leuschel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,11,6]]},"reference":[{"key":"13_CR1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511624162","author":"JR Abrial","year":"1996","unstructured":"Abrial, J.R.: The B-book: assigning programs to meanings. Cambridge Univ. Press (1996). https:\/\/doi.org\/10.1017\/CBO9780511624162","journal-title":"Cambridge Univ. Press"},{"key":"13_CR2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139195881","author":"JR Abrial","year":"2010","unstructured":"Abrial, J.R.: Modeling in event-B: system and software engineering. Cambridge Univ. Press (2010). https:\/\/doi.org\/10.1017\/CBO9781139195881","journal-title":"Cambridge Univ. Press"},{"key":"13_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/3-540-45648-1_13","volume-title":"ZB 2002:Formal Specification and Development in Z and B","author":"J-R Abrial","year":"2002","unstructured":"Abrial, J.-R., Mussat, L.: On using conditional definitions in formal theories. In: Bert, D., Bowen, J.P., Henson, M.C., Robinson, K. (eds.) ZB 2002. LNCS, vol. 2272, pp. 242\u2013269. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45648-1_13"},{"key":"13_CR4","unstructured":"Agrawal, S., Goyal, N.: Analysis of Thompson sampling for the multi-armed bandit problem. In: Proceedings of the 25th Annual Conference on Learning Theory. Proceedings of Machine Learning Research, vol. 23, pp. 39.1-39.26. PMLR (2012)"},{"issue":"1","key":"13_CR5","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0022-0000(81)90005-2","volume":"23","author":"RJR Back","year":"1981","unstructured":"Back, R.J.R.: On correct refinement of programs. J. Comput. Syst. Sci. 23(1), 49\u201368 (1981). https:\/\/doi.org\/10.1016\/0022-0000(81)90005-2","journal-title":"J. Comput. Syst. Sci."},{"key":"13_CR6","doi-asserted-by":"publisher","unstructured":"Back, R.J., Wright, J.: Refinement calculus: a systematic introduction. Texts in Computer Science, Springer (2012). https:\/\/doi.org\/10.1007\/978-1-4612-1674-2","DOI":"10.1007\/978-1-4612-1674-2"},{"key":"13_CR7","doi-asserted-by":"publisher","unstructured":"Barbosa, H., et al.: cvc5: a versatile and industrial-strength SMT solver. In: Fisman, D., Rosu, G. (eds.) Tools and Algorithms for the Construction and Analysis of Systems: 28th International Conference, TACAS 2022, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022, Munich, Germany, April 2\u20137, 2022, Proceedings, Part I, pp. 415\u2013442. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-99524-9_24","DOI":"10.1007\/978-3-030-99524-9_24"},{"key":"13_CR8","unstructured":"Barrett, C., Stump, A., Tinelli, C.: The SMT-LIB standard: Version 2.0. In: Proceedings of the 8th International Workshop on Satisfiability Modulo Theories (Edinburgh, UK) (2010)"},{"key":"13_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/978-3-030-58298-2_8","volume-title":"Formal Methods for Industrial Critical Systems","author":"M Butler","year":"2020","unstructured":"Butler, M., et al.: The first twenty-five years of industrial use of the B-method. In: ter Beek, M.H., Ni\u010dkovi\u0107, D. (eds.) FMICS 2020. LNCS, vol. 12327, pp. 189\u2013209. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-58298-2_8"},{"issue":"1\u20132","key":"13_CR10","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1017\/S1471068411000482","volume":"12","author":"M Carlsson","year":"2012","unstructured":"Carlsson, M., Mildner, P.: SICStus prolog-the first 25 years. Theory Pract. Logic Program. 12(1\u20132), 35\u201366 (2012). https:\/\/doi.org\/10.1017\/S1471068411000482","journal-title":"Theory Pract. Logic Program."},{"key":"13_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/BFb0033845","volume-title":"Programming Languages: Implementations, Logics, and Programs","author":"M Carlsson","year":"1997","unstructured":"Carlsson, M., Ottosson, G., Carlson, B.: An open-ended finite domain constraint solver. In: Glaser, H., Hartel, P., Kuchen, H. (eds.) PLILP 1997. LNCS, vol. 1292, pp. 191\u2013206. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/BFb0033845"},{"key":"13_CR12","volume-title":"SICStus Prolog user\u2019s manual","author":"M Carlsson","year":"1988","unstructured":"Carlsson, M., Widen, J., Andersson, J., Andersson, S., Boortz, K., Nilsson, H., Sj\u00f6land, T.: SICStus Prolog user\u2019s manual, vol. 3. Swedish Institute of Computer Science, Kista, Sweden (1988)"},{"key":"13_CR13","first-page":"2249","volume":"24","author":"O Chapelle","year":"2011","unstructured":"Chapelle, O., Li, L.: An empirical evaluation of Thompson sampling. Adv. Neural. Inf. Process. Syst. 24, 2249\u20132257 (2011)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"13_CR14","doi-asserted-by":"publisher","unstructured":"Chen, Y., Bradbury, M., Suri, N.: Towards effective performance fuzzing. In: 2022 IEEE International Symposium on Software Reliability Engineering Workshops (ISSREW), pp. 128\u2013129 (2022). https:\/\/doi.org\/10.1109\/ISSREW55968.2022.00055","DOI":"10.1109\/ISSREW55968.2022.00055"},{"key":"13_CR15","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":"13_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/978-3-030-48077-6_8","volume-title":"Rigorous State-Based Methods","author":"J Dunkelau","year":"2020","unstructured":"Dunkelau, J., Schmidt, J., Leuschel, M.: Analysing ProB\u2019s constraint solving backends. In: Raschke, A., M\u00e9ry, D., Houdek, F. (eds.) ABZ 2020. LNCS, vol. 12071, pp. 107\u2013123. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-48077-6_8"},{"key":"13_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"737","DOI":"10.1007\/978-3-319-08867-9_49","volume-title":"Computer Aided Verification","author":"B Dutertre","year":"2014","unstructured":"Dutertre, B.: Yices\u00a02.2. In: Biere, A., Bloem, R. (eds.) CAV 2014. LNCS, vol. 8559, pp. 737\u2013744. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-08867-9_49"},{"key":"13_CR18","doi-asserted-by":"publisher","unstructured":"Koo, J., Saumya, C., Kulkarni, M., Bagchi, S.: PYSE: automatic worst-case test generation by reinforcement learning. In: 2019 12th IEEE Conference on Software Testing, Validation and Verification (ICST), pp. 136\u2013147 (2019). https:\/\/doi.org\/10.1109\/ICST.2019.00023","DOI":"10.1109\/ICST.2019.00023"},{"key":"13_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/978-3-319-33693-0_23","volume-title":"Integrated Formal Methods","author":"S Krings","year":"2016","unstructured":"Krings, S., Leuschel, M.: SMT solvers for validation of B and event-B models. In: \u00c1brah\u00e1m, E., Huisman, M. (eds.) IFM 2016. LNCS, vol. 9681, pp. 361\u2013375. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-33693-0_23"},{"issue":"4","key":"13_CR20","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1145\/3364452.3364455","volume":"44","author":"XBD Le","year":"2019","unstructured":"Le, X.B.D., Pasareanu, C., Padhye, R., Lo, D., Visser, W., Sen, K.: Saffron: adaptive grammar-based fuzzing for worst-case analysis. SIGSOFT Softw. Eng. Notes 44(4), 14 (2019). https:\/\/doi.org\/10.1145\/3364452.3364455","journal-title":"SIGSOFT Softw. Eng. Notes"},{"key":"13_CR21","doi-asserted-by":"publisher","unstructured":"Lemieux, C., Padhye, R., Sen, K., Song, D.: Perffuzz: automatically generating pathological inputs. In: Proceedings of the 27th ACM SIGSOFT International Symposium on Software Testing and Analysis, pp. 254\u2013265 (2018). https:\/\/doi.org\/10.1145\/3213846.3213861","DOI":"10.1145\/3213846.3213861"},{"key":"13_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/978-3-030-63461-2_4","volume-title":"Integrated Formal Methods","author":"M Leuschel","year":"2020","unstructured":"Leuschel, M.: Fast and effective well-definedness checking. In: Dongol, B., Troubitsyna, E. (eds.) IFM 2020. LNCS, vol. 12546, pp. 63\u201381. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-63461-2_4"},{"key":"13_CR23","doi-asserted-by":"publisher","unstructured":"Leuschel, M., Bendisposto, J., Dobrikov, I., Krings, S., Plagge, D.: From animation to data validation: the ProB constraint solver 10 years on. In: Formal Methods Applied to Complex Systems: Implementation of the B Method, chap. 14, pp. 427\u2013446. Wiley ISTE (2014). https:\/\/doi.org\/10.1002\/9781119002727.ch14","DOI":"10.1002\/9781119002727.ch14"},{"key":"13_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"855","DOI":"10.1007\/978-3-540-45236-2_46","volume-title":"FME 2003: Formal Methods","author":"M Leuschel","year":"2003","unstructured":"Leuschel, M., Butler, M.: ProB: a model checker for B. In: Araki, K., Gnesi, S., Mandrioli, D. (eds.) FME 2003. LNCS, vol. 2805, pp. 855\u2013874. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45236-2_46"},{"issue":"2","key":"13_CR25","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/s10009-007-0063-9","volume":"10","author":"M Leuschel","year":"2008","unstructured":"Leuschel, M., Butler, M.: ProB: an automated analysis toolset for the B method. Int. J. Softw. Tools Technol. Transfer 10(2), 185\u2013203 (2008). https:\/\/doi.org\/10.1007\/s10009-007-0063-9","journal-title":"Int. J. Softw. Tools Technol. Transfer"},{"issue":"3","key":"13_CR26","doi-asserted-by":"publisher","first-page":"1199","DOI":"10.1109\/TR.2018.2834476","volume":"67","author":"H Liang","year":"2018","unstructured":"Liang, H., Pei, X., Jia, X., Shen, W., Zhang, J.: Fuzzing: state of the art. IEEE Trans. Reliab. 67(3), 1199\u20131218 (2018). https:\/\/doi.org\/10.1109\/TR.2018.2834476","journal-title":"IEEE Trans. Reliab."},{"issue":"11","key":"13_CR27","doi-asserted-by":"publisher","first-page":"2312","DOI":"10.1109\/TSE.2019.2946563","volume":"47","author":"VJ Man\u00e8s","year":"2021","unstructured":"Man\u00e8s, V.J., Han, H., Han, C., Cha, S.K., Egele, M., Schwartz, E.J., Woo, M.: The art, science, and engineering of fuzzing: a survey. IEEE Trans. Software Eng. 47(11), 2312\u20132331 (2021). https:\/\/doi.org\/10.1109\/TSE.2019.2946563","journal-title":"IEEE Trans. Software Eng."},{"key":"13_CR28","doi-asserted-by":"publisher","unstructured":"Marques-Silva, J., Lynce, I., Malik, S.: Conflict-driven clause learning SAT solvers. In: Handbook of Satisfiability, Frontiers in Artificial Intelligence and Applications, vol. 185, pp. 131\u2013153. IOS press (2009). https:\/\/doi.org\/10.3233\/978-1-58603-929-5-131","DOI":"10.3233\/978-1-58603-929-5-131"},{"issue":"12","key":"13_CR29","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1145\/96267.96279","volume":"33","author":"BP Miller","year":"1990","unstructured":"Miller, B.P., Fredriksen, L., So, B.: An empirical study of the reliability of UNIX utilities. Commun. ACM 33(12), 32\u201344 (1990). https:\/\/doi.org\/10.1145\/96267.96279","journal-title":"Commun. ACM"},{"key":"13_CR30","unstructured":"Niemetz, A., Preiner, M.: Bitwuzla at the SMT-COMP 2020. CoRR abs\/2006.01621 (2020)"},{"key":"13_CR31","doi-asserted-by":"publisher","unstructured":"Petsios, T., Zhao, J., Keromytis, A.D., Jana, S.: Slowfuzz: automated domain-independent detection of algorithmic complexity vulnerabilities. In: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, pp. 2155\u20132168 (2017). https:\/\/doi.org\/10.1145\/3133956.3134073","DOI":"10.1145\/3133956.3134073"},{"key":"13_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1007\/978-3-642-32759-9_31","volume-title":"FM 2012: Formal Methods","author":"D Plagge","year":"2012","unstructured":"Plagge, D., Leuschel, M.: Validating B,Z and TLA+ using ProB\u00a0and Kodkod. In: Giannakopoulou, D., M\u00e9ry, D. (eds.) FM 2012. LNCS, vol. 7436, pp. 372\u2013386. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32759-9_31"},{"key":"13_CR33","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1090\/S0002-9904-1952-09620-8","volume":"55","author":"H Robbins","year":"1952","unstructured":"Robbins, H.: Some aspects of the sequential design of experiments. Bull. Am. Math. Soc. 55, 527\u2013535 (1952)","journal-title":"Bull. Am. Math. Soc."},{"key":"13_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1007\/978-3-319-98938-9_20","volume-title":"Integrated Formal Methods","author":"J Schmidt","year":"2018","unstructured":"Schmidt, J., Krings, S., Leuschel, M.: Repair and generation of formal models using synthesis. In: Furia, C.A., Winter, K. (eds.) IFM 2018. LNCS, vol. 11023, pp. 346\u2013366. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-98938-9_20"},{"key":"13_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/978-3-030-85248-1_7","volume-title":"Formal Methods for Industrial Critical Systems","author":"J Schmidt","year":"2021","unstructured":"Schmidt, J., Leuschel, M.: Improving SMT solver integrations for the validation of B and Event-B Models. In: Lluch Lafuente, A., Mavridou, A. (eds.) FMICS 2021. LNCS, vol. 12863, pp. 107\u2013125. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-85248-1_7"},{"key":"13_CR36","doi-asserted-by":"publisher","first-page":"1043","DOI":"10.1007\/s10009-022-00682-y","volume":"24","author":"J Schmidt","year":"2022","unstructured":"Schmidt, J., Leuschel, M.: SMT solving for the validation of B and Event-B models. Int. J. Softw. Tools Technol. Transfer 24, 1043\u20131077 (2022). https:\/\/doi.org\/10.1007\/s10009-022-00682-y","journal-title":"Int. J. Softw. Tools Technol. Transfer"},{"key":"13_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/978-3-030-63618-0_5","volume-title":"Software Verification","author":"J Scott","year":"2020","unstructured":"Scott, J., Mora, F., Ganesh, V.: BanditFuzz: a reinforcement-learning based performance fuzzer for SMT solvers. In: Christakis, M., Polikarpova, N., Duggirala, P.S., Schrammel, P. (eds.) NSV\/VSTTE -2020. LNCS, vol. 12549, pp. 68\u201386. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-63618-0_5"},{"key":"13_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/978-3-030-90870-6_6","volume-title":"Formal Methods","author":"J Scott","year":"2021","unstructured":"Scott, J., Sudula, T., Rehman, H., Mora, F., Ganesh, V.: BanditFuzz: fuzzing SMT solvers with multi-agent reinforcement learning. In: Huisman, M., P\u0103s\u0103reanu, C., Zhan, N. (eds.) FM 2021. LNCS, vol. 13047, pp. 103\u2013121. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-90870-6_6"},{"issue":"3\u20134","key":"13_CR39","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1093\/biomet\/25.3-4.285","volume":"25","author":"WR Thompson","year":"1933","unstructured":"Thompson, W.R.: On the likelihood that one unknown probability exceeds another in view of the evidence of two samples. Biometrika 25(3\u20134), 285\u2013294 (1933). https:\/\/doi.org\/10.1093\/biomet\/25.3-4.285","journal-title":"Biometrika"},{"key":"13_CR40","doi-asserted-by":"publisher","unstructured":"Watkins, C.J., Dayan, P.: Q-learning. Machine Learn. 8, 279\u2013292 (1992). https:\/\/doi.org\/10.1007\/BF00992698","DOI":"10.1007\/BF00992698"},{"key":"13_CR41","doi-asserted-by":"publisher","unstructured":"Wen, C., et al.: Memlock: memory usage guided fuzzing. In: Proceedings of the ACM\/IEEE 42nd International Conference on Software Engineering, pp. 765\u2013777. ICSE \u201920, Association for Computing Machinery (2020). https:\/\/doi.org\/10.1145\/3377811.3380396","DOI":"10.1145\/3377811.3380396"},{"issue":"3","key":"13_CR42","doi-asserted-by":"publisher","first-page":"947","DOI":"10.1109\/TSE.2022.3168373","volume":"49","author":"Y Zhang","year":"2023","unstructured":"Zhang, Y., et al.: Demystifying performance regressions in string solvers. IEEE Trans. Software Eng. 49(3), 947\u2013961 (2023). https:\/\/doi.org\/10.1109\/TSE.2022.3168373","journal-title":"IEEE Trans. Software Eng."}],"container-title":["Lecture Notes in Computer Science","Integrated Formal Methods"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-47705-8_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,18]],"date-time":"2024-04-18T14:50:34Z","timestamp":1713451834000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-47705-8_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,6]]},"ISBN":["9783031477041","9783031477058"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-47705-8_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023,11,6]]},"assertion":[{"value":"6 November 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"iFM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Integrated Formal Methods","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Leiden","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 November 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 November 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ifm2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/liacs.leidenuniv.nl\/~bonsanguemm\/ifm23\/index.html","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":"51","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":"16","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":"2","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":"31% - 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":"5","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)"}}]}}