{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T18:57:34Z","timestamp":1743101854608,"version":"3.40.3"},"publisher-location":"Cham","reference-count":64,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030942373"},{"type":"electronic","value":"9783030942380"}],"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-030-94238-0_9","type":"book-chapter","created":{"date-parts":[[2022,1,18]],"date-time":"2022-01-18T03:03:40Z","timestamp":1642475020000},"page":"150-169","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Towards Agile Mutation Testing Using Branch Coverage Based Prioritization Technique"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6169-6334","authenticated-orcid":false,"given":"Sangharatna","family":"Godboley","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4824-7091","authenticated-orcid":false,"given":"Durga Prasad","family":"Mohapatra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,1,12]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Ayari, K., Bouktif, S., Antoniol, G.: Automatic mutation test input data generation via ant colony. In: Proceedings of the 9th Annual Conference on Genetic and Evolutionary Computation, pp. 1074\u20131081 (2007)","DOI":"10.1145\/1276958.1277172"},{"key":"9_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/978-3-540-24730-2_15","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"E Clarke","year":"2004","unstructured":"Clarke, E., Kroening, D., Lerda, F.: A tool for checking ANSI-C programs. In: Jensen, K., Podelski, A. (eds.) TACAS 2004. LNCS, vol. 2988, pp. 168\u2013176. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24730-2_15"},{"key":"9_CR3","unstructured":"Crispin, L., Gregory, J.: Agile Testing: A Practical Guide for Testers and Agile Teams. Addison-Wesley Professional, 1 edn (2009)"},{"key":"9_CR4","unstructured":"DeMillo, R., Martin, R.: The mothra software testing environment user\u2019s manual. Software Engineering Research Center, Tech. Rep (1987)"},{"issue":"4","key":"9_CR5","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1109\/C-M.1978.218136","volume":"11","author":"RA DeMillo","year":"1978","unstructured":"DeMillo, R.A., Lipton, R.J., Sayward, F.G.: Hints on test data selection: help for the practicing programmer. Computer 11(4), 34\u201341 (1978)","journal-title":"Computer"},{"issue":"9","key":"9_CR6","doi-asserted-by":"publisher","first-page":"900","DOI":"10.1109\/32.92910","volume":"17","author":"RA DeMillo","year":"1991","unstructured":"DeMillo, R.A., Offutt, A.J.: Constraint-based automatic test data generation. IEEE Trans. Softw. Eng. 17(9), 900\u2013910 (1991)","journal-title":"IEEE Trans. Softw. Eng."},{"issue":"9","key":"9_CR7","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1109\/TSE.2006.92","volume":"32","author":"H Do","year":"2006","unstructured":"Do, H., Rothermel, G.: On the use of mutation faults in empirical assessments of test case prioritization techniques. IEEE Trans. Softw. Eng. 32(9), 733\u2013752 (2006). https:\/\/doi.org\/10.1109\/TSE.2006.92","journal-title":"IEEE Trans. Softw. Eng."},{"issue":"4","key":"9_CR8","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1109\/MCI.2006.329691","volume":"1","author":"M Dorigo","year":"2006","unstructured":"Dorigo, M., Birattari, M., Stutzle, T.: Ant colony optimization. IEEE Comput. Intell. Mag. 1(4), 28\u201339 (2006)","journal-title":"IEEE Comput. Intell. Mag."},{"key":"9_CR9","series-title":"Lecture Notes in Business Information Processing","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/978-3-030-67084-9_10","volume-title":"Lean and Agile Software Development","author":"A Dutta","year":"2021","unstructured":"Dutta, A., Godboley, S.: MSFL: a model for fault localization using mutation-spectra technique. In: Przyby\u0142ek, A., Miler, J., Poth, A., Riel, A. (eds.) LASD 2021. LNBIP, vol. 408, pp. 156\u2013173. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-67084-9_10"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Dutta, A., Srivastava, S.S., Godboley, S., Mohapatra, D.P.: Combi-FL: Neural network and SBFL based fault localization using mutation analysis. J. Comput. Lang. 66, 101064 (2021)","DOI":"10.1016\/j.cola.2021.101064"},{"issue":"2","key":"9_CR11","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1109\/32.988497","volume":"28","author":"S Elbaum","year":"2002","unstructured":"Elbaum, S., Malishevsky, A.G., Rothermel, G.: Test case prioritization: a family of empirical studies. IEEE Trans. Softw. Eng. 28(2), 159\u2013182 (2002)","journal-title":"IEEE Trans. Softw. Eng."},{"issue":"3","key":"9_CR12","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/S0164-1212(96)00154-9","volume":"38","author":"PG Frankl","year":"1997","unstructured":"Frankl, P.G., Weiss, S.N., Hu, C.: All-uses vs mutation testing: an experimental comparison of effectiveness. J. Syst. Softw. 38(3), 235\u2013253 (1997)","journal-title":"J. Syst. Softw."},{"issue":"4","key":"9_CR13","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/s11334-016-0284-8","volume":"12","author":"S Godboley","year":"2016","unstructured":"Godboley, S., Dutta, A., Mohapatra, D.P., Das, A., Mall, R.: Making a concolic tester achieve increased MC\/DC. Innovations Syst. Softw. Eng. 12(4), 319\u2013332 (2016)","journal-title":"Innovations Syst. Softw. Eng."},{"key":"9_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.csi.2016.09.006","volume":"50","author":"S Godboley","year":"2017","unstructured":"Godboley, S., Dutta, A., Mohapatra, D.P., Mall, R.: J3 model: a novel framework for improved modified condition\/decision coverage analysis. Comput. Stand. Interfaces 50, 1\u201317 (2017)","journal-title":"Comput. Stand. Interfaces"},{"key":"9_CR15","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.csi.2017.04.003","volume":"55","author":"S Godboley","year":"2018","unstructured":"Godboley, S., Dutta, A., Mohapatra, D.P., Mall, R.: Gecojap: a novel source-code preprocessing technique to improve code coverage. Comput. Stand. Interfaces 55, 27\u201346 (2018)","journal-title":"Comput. Stand. Interfaces"},{"key":"9_CR16","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/j.csi.2018.02.005","volume":"59","author":"S Godboley","year":"2018","unstructured":"Godboley, S., Dutta, A., Mohapatra, D.P., Mall, R.: Scaling modified condition\/decision coverage using distributed concolic testing for java programs. Comput. Stand. Interfaces 59, 61\u201386 (2018)","journal-title":"Comput. Stand. Interfaces"},{"issue":"2","key":"9_CR17","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1002\/spe.2405","volume":"47","author":"S Godboley","year":"2017","unstructured":"Godboley, S., Mohapatra, D.P., Das, A., Mall, R.: An improved distributed concolic testing approach. Softw. Pract. Exp. 47(2), 311\u2013342 (2017)","journal-title":"Softw. Pract. Exp."},{"key":"9_CR18","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1016\/j.procs.2015.08.449","volume":"62","author":"S Godboley","year":"2015","unstructured":"Godboley, S., Sahani, A., Mohapatra, D.P.: ABCE: a novel framework for improved branch coverage analysis. Proc. Comput. Sci. 62, 266\u2013273 (2015). https:\/\/doi.org\/10.1016\/j.procs.2015.08.449","journal-title":"Proc. Comput. Sci."},{"key":"9_CR19","doi-asserted-by":"crossref","unstructured":"Godefroid, P., Klarlund, N., Sen, K.: Dart: directed automated random testing. In: Proceedings of the 2005 ACM SIGPLAN conference on Programming language design and implementation, pp. 213\u2013223 (2005)","DOI":"10.1145\/1064978.1065036"},{"issue":"1\u20132","key":"9_CR20","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/0004-3702(95)00040-2","volume":"84","author":"R Greiner","year":"1996","unstructured":"Greiner, R.: PALO: a probabilistic hill-climbing algorithm. Artif. Intell. 84(1\u20132), 177\u2013208 (1996)","journal-title":"Artif. Intell."},{"issue":"4","key":"9_CR21","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1109\/4235.797971","volume":"3","author":"GR Harik","year":"1999","unstructured":"Harik, G.R., Lobo, F.G., Goldberg, D.E.: The compact genetic algorithm. IEEE Trans. Evol. Comput. 3(4), 287\u2013297 (1999)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"9_CR22","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1109\/TSE.1982.235571","volume":"4","author":"WE Howden","year":"1982","unstructured":"Howden, W.E.: Weak mutation testing and completeness of test sets. IEEE Trans. Softw. Eng. 4, 371\u2013379 (1982)","journal-title":"IEEE Trans. Softw. Eng."},{"key":"9_CR23","unstructured":"Javalanche: (2012). http:\/\/www.javalanche.org\/"},{"key":"9_CR24","doi-asserted-by":"crossref","unstructured":"Kaminski, G., Ammann, P., Offutt, J.: Better predicate testing. In: Proceedings of the 6th International Workshop on Automation of Software Test, pp. 57\u201363 (2011)","DOI":"10.1145\/1982595.1982608"},{"issue":"8","key":"9_CR25","doi-asserted-by":"publisher","first-page":"2002","DOI":"10.1016\/j.jss.2012.08.024","volume":"86","author":"G Kaminski","year":"2013","unstructured":"Kaminski, G., Ammann, P., Offutt, J.: Improving logic-based testing. J. Syst. Softw. 86(8), 2002\u20132012 (2013)","journal-title":"J. Syst. Softw."},{"key":"9_CR26","doi-asserted-by":"crossref","unstructured":"Li, X., Li, W., Zhang, Y., Zhang, L.: Deepfl: Integrating multiple fault diagnosis dimensions for deep fault localization. In: Proceedings of the 28th ACM SIGSOFT International Symposium on Software Testing and Analysis, pp. 169\u2013180 (2019)","DOI":"10.1145\/3293882.3330574"},{"key":"9_CR27","volume-title":"Fundamentals of Software Engineering","author":"R Mall","year":"2018","unstructured":"Mall, R.: Fundamentals of Software Engineering. PHI Learning Pvt Ltd, New Delhi (2018)"},{"issue":"6","key":"9_CR28","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1145\/71052.71064","volume":"24","author":"B Meek","year":"1989","unstructured":"Meek, B., Siu, K.: The effectiveness of error seeding. ACM Sigplan Not. 24(6), 81\u201389 (1989)","journal-title":"ACM Sigplan Not."},{"key":"9_CR29","unstructured":"MILU: (2018). https:\/\/github.com\/yuejia\/Milu"},{"key":"9_CR30","doi-asserted-by":"crossref","unstructured":"Offutt, A.J., Lee, S.D.: How strong is weak mutation? In: Proceedings of the symposium on Testing, analysis, and verification, pp. 200\u2013213 (1991)","DOI":"10.1145\/120807.120826"},{"issue":"3","key":"9_CR31","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1002\/(SICI)1099-1689(199709)7:3<165::AID-STVR143>3.0.CO;2-U","volume":"7","author":"AJ Offutt","year":"1997","unstructured":"Offutt, A.J., Pan, J.: Automatically detecting equivalent mutants and infeasible paths. Softw. Testing, Verification Reliab. 7(3), 165\u2013192 (1997)","journal-title":"Softw. Testing, Verification Reliab."},{"issue":"2","key":"9_CR32","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1002\/(SICI)1097-024X(199602)26:2<165::AID-SPE5>3.0.CO;2-K","volume":"26","author":"AJ Offutt","year":"1996","unstructured":"Offutt, A.J., Pan, J., Tewary, K., Zhang, T.: An experimental evaluation of data flow and mutation testing. Softw. Pract. Exp. 26(2), 165\u2013176 (1996)","journal-title":"Softw. Pract. Exp."},{"key":"9_CR33","doi-asserted-by":"crossref","unstructured":"Offutt, A.J., Rothermel, G., Zapf, C.: An experimental evaluation of selective mutation. In: Proceedings of 1993 15th international conference on software engineering, pp. 100\u2013107. IEEE (1993)","DOI":"10.1109\/ICSE.1993.346062"},{"key":"9_CR34","doi-asserted-by":"crossref","unstructured":"Offutt A.J., Untch R.H.: Mutation 2000: uniting the orthogonal. In: Wong, W.E., (eds) Mutation Testing for the New Century. The Springer International Series on Advances in Database Systems, vol. 24. Springer, Boston (2001)","DOI":"10.1007\/978-1-4757-5939-6_7"},{"issue":"5\u20137","key":"9_CR35","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1002\/stvr.1509","volume":"25","author":"M Papadakis","year":"2015","unstructured":"Papadakis, M., Le Traon, Y.: Metallaxis-FL: mutation-based fault localization. Softw. Testing Verifi. Reliab. 25(5\u20137), 605\u2013628 (2015)","journal-title":"Softw. Testing Verifi. Reliab."},{"key":"9_CR36","doi-asserted-by":"crossref","unstructured":"Papadakis, M., Malevris, N.: Automatic mutation test case generation via dynamic symbolic execution. In: 2010 IEEE 21st International Symposium on Software Reliability Engineering, pp. 121\u2013130. IEEE (2010)","DOI":"10.1109\/ISSRE.2010.38"},{"key":"9_CR37","unstructured":"Parsai, A.: Mutation testing: from theory to practice. Ph.D. thesis, University of Antwerp (2019)"},{"key":"9_CR38","unstructured":"PIT (2020). https:\/\/pitest.org\/"},{"key":"9_CR39","unstructured":"RERS12 (2012). http:\/\/rers-challenge.org\/2012\/"},{"key":"9_CR40","unstructured":"Regular extrapolation of reactive systems (rers-2013): Problem28 (2013), http:\/\/rers-challenge.org\/2013ase\/problems\/challengeProblems\/White\/Problem28\/Problem28.c"},{"key":"9_CR41","unstructured":"Regular extrapolation of reactive systems (rers-2013): Problem29 (2013), http:\/\/rers-challenge.org\/2013ase\/problems\/challengeProblems\/White\/Problem29\/Problem29.c"},{"key":"9_CR42","unstructured":"Regular extrapolation of reactive systems (rers-2013): Problem30 (2013). http:\/\/rers-challenge.org\/2013ase\/problems\/challengeProblems\/White\/Problem30\/Problem30.c"},{"key":"9_CR43","unstructured":"Regular extrapolation of reactive systems (rers-2013): Problem32 (2013). http:\/\/rers-challenge.org\/2013ase\/problems\/challengeProblems\/White\/Problem28\/Problem32.c"},{"key":"9_CR44","unstructured":"RERS14 (2014). http:\/\/rers-challenge.org\/2014\/"},{"key":"9_CR45","unstructured":"RERS16 (2016). http:\/\/rers-challenge.org\/2016\/"},{"key":"9_CR46","unstructured":"Rigorous examination of reactive systems (rers-2017): Sequential ltl problems (2017). http:\/\/www.rers-challenge.org\/2017\/index.php?page=ltlProblems"},{"key":"9_CR47","unstructured":"Rigorous examination of reactive systems (rers-2017): Sequential reachability problems (2017). http:\/\/www.rers-challenge.org\/2017\/index.php?page=reachProblems"},{"key":"9_CR48","unstructured":"Rigorous examination of reactive systems (rers-2017): Sequential training problems for rers 2017 (2017). http:\/\/www.rers-challenge.org\/2017\/index.php?page=trainingphase"},{"key":"9_CR49","unstructured":"RERS (2018). http:\/\/rers-challenge.org\/"},{"key":"9_CR50","unstructured":"RERS18 (2018). http:\/\/rers-challenge.org\/2018\/"},{"key":"9_CR51","unstructured":"Rigorous examination of reactive systems (rers-2018): Sequential training problems for rers 2018 (2018). http:\/\/www.rers-challenge.org\/2018\/index.php?page=trainingphase"},{"key":"9_CR52","unstructured":"RERS19: Sequential Reachability Problems (2019). http:\/\/rers-challenge.org\/2019\/index.php?page=reachProblems"},{"key":"9_CR53","unstructured":"RERS20: Sequential Reachability Problems (2020). http:\/\/rers-challenge.org\/2020\/index.php?page=reachProblems"},{"issue":"10","key":"9_CR54","doi-asserted-by":"publisher","first-page":"929","DOI":"10.1109\/32.962562","volume":"27","author":"G Rothermel","year":"2001","unstructured":"Rothermel, G., Untch, R.H., Chu, C., Harrold, M.J.: Prioritizing test cases for regression testing. IEEE Trans. Softw. Eng. 27(10), 929\u2013948 (2001)","journal-title":"IEEE Trans. Softw. Eng."},{"issue":"5","key":"9_CR55","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1145\/1095430.1081750","volume":"30","author":"K Sen","year":"2005","unstructured":"Sen, K., Marinov, D., Agha, G.: Cute: a concolic unit testing engine for c. ACM SIGSOFT Softw. Eng. Not. 30(5), 263\u2013272 (2005)","journal-title":"ACM SIGSOFT Softw. Eng. Not."},{"key":"9_CR56","unstructured":"Testura.mutation (2021). https:\/\/github.com\/Testura\/Testura.Mutation"},{"key":"9_CR57","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/978-3-540-79124-9_10","volume-title":"Tests and Proofs","author":"N Tillmann","year":"2008","unstructured":"Tillmann, N., de Halleux, J.: Pex\u2013White box test generation for .NET. In: Beckert, B., H\u00e4hnle, R. (eds.) TAP 2008. LNCS, vol. 4966, pp. 134\u2013153. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-79124-9_10"},{"key":"9_CR58","doi-asserted-by":"crossref","unstructured":"Vercammen, S., Ghafari, M., Demeyer, S., Borg, M.: Goal-oriented mutation testing with focal methods. In: Proceedings of the 9th ACM SIGSOFT International Workshop on Automating TEST Case Design, Selection, and Evaluation, pp. 23\u201330 (2018)","DOI":"10.1145\/3278186.3278190"},{"key":"9_CR59","unstructured":"Walsh, P.J.: A measure of test case completeness (software, engineering) (1985)"},{"key":"9_CR60","unstructured":"Woodward, M., Halewood, K.: From weak to strong, dead or alive? an analysis of some mutation testing issues. In: Workshop on software testing, verification, and analysis, pp. 152\u2013153. IEEE Computer Society (1988)"},{"issue":"5","key":"9_CR61","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1093\/comjnl\/bxm021","volume":"52","author":"Q Yang","year":"2007","unstructured":"Yang, Q., Li, J.J., Weiss, D.M.: A survey of coverage-based testing tools. Comput. J. 52(5), 589\u2013597 (2007). https:\/\/doi.org\/10.1093\/comjnl\/bxm021","journal-title":"Comput. J."},{"key":"9_CR62","doi-asserted-by":"publisher","unstructured":"Zhang, L., Hao, D., Zhang, L., Rothermel, G., Mei, H.: Bridging the gap between the total and additional test-case prioritization strategies. In: 2013 35th International Conference on Software Engineering (ICSE), pp. 192\u2013201 (2013). https:\/\/doi.org\/10.1109\/ICSE.2013.6606565","DOI":"10.1109\/ICSE.2013.6606565"},{"key":"9_CR63","doi-asserted-by":"publisher","unstructured":"Zhang, L., Marinov, D., Khurshid, S.: Faster mutation testing inspired by test prioritization and reduction. In: Proceedings of the 2013 International Symposium on Software Testing and Analysis, p. 235\u2013245. ISSTA 2013, Association for Computing Machinery, New York, NY, USA (2013). https:\/\/doi.org\/10.1145\/2483760.2483782","DOI":"10.1145\/2483760.2483782"},{"key":"9_CR64","doi-asserted-by":"crossref","unstructured":"Zhang, L., Xie, T., Zhang, L., Tillmann, N., De Halleux, J., Mei, H.: Test generation via dynamic symbolic execution for mutation testing. In: 2010 IEEE International Conference on Software Maintenance, pp. 1\u201310. IEEE (2010)","DOI":"10.1109\/ICSM.2010.5609672"}],"container-title":["Lecture Notes in Business Information Processing","Lean and Agile Software Development"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-94238-0_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T14:12:57Z","timestamp":1726495977000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-94238-0_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030942373","9783030942380"],"references-count":64,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-94238-0_9","relation":{},"ISSN":["1865-1348","1865-1356"],"issn-type":[{"type":"print","value":"1865-1348"},{"type":"electronic","value":"1865-1356"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"12 January 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LASD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Lean and Agile Software Development","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 January 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 January 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lasd2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/lasd.pl\/","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":"29","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":"9","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":"1","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.7","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":"1","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)"}}]}}