{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,29]],"date-time":"2026-01-29T22:31:24Z","timestamp":1769725884890,"version":"3.49.0"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030816872","type":"print"},{"value":"9783030816889","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,7,15]],"date-time":"2021-07-15T00:00:00Z","timestamp":1626307200000},"content-version":"vor","delay-in-days":195,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We introduce new algorithms for computing <jats:italic>non-termination sensitive control dependence<\/jats:italic> (NTSCD) and <jats:italic>decisive order dependence<\/jats:italic> (DOD). These relations on vertices of a control flow graph have many applications including program slicing and compiler optimizations. Our algorithms are asymptotically faster than the current algorithms. We also show that the original algorithms for computing NTSCD and DOD may produce incorrect results. We implemented the new as well as fixed versions of the original algorithms for the computation of NTSCD and DOD. Experimental evaluation shows that our algorithms dramatically outperform the original ones.<\/jats:p>","DOI":"10.1007\/978-3-030-81688-9_41","type":"book-chapter","created":{"date-parts":[[2021,7,16]],"date-time":"2021-07-16T16:20:47Z","timestamp":1626452447000},"page":"887-910","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Fast Computation of Strong Control Dependencies"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1132-5516","authenticated-orcid":false,"given":"Marek","family":"Chalupa","sequence":"first","affiliation":[]},{"given":"David","family":"Klas\u0306ka","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5873-403X","authenticated-orcid":false,"given":"Jan","family":"Strej\u010dek","sequence":"additional","affiliation":[]},{"given":"Luk\u00e1s\u0306","family":"Tomovic\u0306","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,7,15]]},"reference":[{"issue":"2","key":"41_CR1","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/j.ipl.2007.10.002","volume":"106","author":"T Amtoft","year":"2008","unstructured":"Amtoft, T.: Slicing for modern program structures: a theory for eliminating irrelevant loops. Inf. Process. Lett. 106(2), 45\u201351 (2008). https:\/\/doi.org\/10.1016\/j.ipl.2007.10.002","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"41_CR2","doi-asserted-by":"publisher","first-page":"53:1","DOI":"10.1145\/2501654.2501667","volume":"45","author":"K Androutsopoulos","year":"2013","unstructured":"Androutsopoulos, K., Clark, D., Harman, M., Krinke, J., Tratt, L.: State-based model slicing: a survey. ACM Comput. Surv. 45(4), 53:1-53:36 (2013). https:\/\/doi.org\/10.1145\/2501654.2501667","journal-title":"ACM Comput. Surv."},{"key":"41_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/978-3-642-00593-0_15","volume-title":"Fundamental Approaches to Software Engineering","author":"K Androutsopoulos","year":"2009","unstructured":"Androutsopoulos, K., Clark, D., Harman, M., Li, Z., Tratt, L.: Control dependence for extended finite state machines. In: Chechik, M., Wirsing, M. (eds.) FASE 2009. LNCS, vol. 5503, pp. 216\u2013230. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00593-0_15"},{"issue":"1","key":"41_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10009-017-0469-y","volume":"21","author":"D Beyer","year":"2019","unstructured":"Beyer, D., L\u00f6we, S., Wendler, P.: Reliable benchmarking: requirements and solutions. Int. J. Softw. Tools Technol. Transf. 21(1), 1\u201329 (2019). https:\/\/doi.org\/10.1007\/s10009-017-0469-y","journal-title":"Int. J. Softw. Tools Technol. Transf."},{"key":"41_CR5","doi-asserted-by":"publisher","unstructured":"Bilardi, G., Pingali, K.: A framework for generalized control dependence. In: PLDI 1996, pp. 291\u2013300. ACM (1996). https:\/\/doi.org\/10.1145\/231379.231435","DOI":"10.1145\/231379.231435"},{"key":"41_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1007\/978-3-030-59152-6_33","volume-title":"Automated Technology for Verification and Analysis","author":"M Chalupa","year":"2020","unstructured":"Chalupa, M.: DG: analysis and slicing of LLVM bitcode. In: Hung, D.V., Sokolsky, O. (eds.) ATVA 2020. LNCS, vol. 12302, pp. 557\u2013563. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-59152-6_33"},{"key":"41_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/978-3-030-72013-1_31","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"M Chalupa","year":"2021","unstructured":"Chalupa, M., Ja\u0161ek, T., Nov\u00e1k, J., \u0158echt\u00e1\u010dkov\u00e1, A., \u0160okov\u00e1, V., Strej\u010dek, J.: Symbiotic 8: beyond symbolic execution. In: TACAS 2021. LNCS, vol. 12652, pp. 453\u2013457. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-72013-1_31"},{"key":"41_CR8","unstructured":"Chalupa, M., Kla\u0161ka, D., Strej\u010dek, J., Tomovi\u010d, L.: Fast computation of strong control dependencies. CoRR abs\/2011.01564 (2020). https:\/\/arxiv.org\/abs\/2011.01564"},{"key":"41_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/978-3-030-34968-4_6","volume-title":"Integrated Formal Methods","author":"M Chalupa","year":"2019","unstructured":"Chalupa, M., Strej\u010dek, J.: Evaluation of program slicing in software verification. In: Ahrendt, W., Tapia Tarifa, S.L. (eds.) IFM 2019. LNCS, vol. 11918, pp. 101\u2013119. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34968-4_6"},{"key":"41_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/11823230_25","volume-title":"Static Analysis","author":"F Chen","year":"2006","unstructured":"Chen, F., Ro\u015fu, G.: Parametric and termination-sensitive control dependence. In: Yi, K. (ed.) SAS 2006. LNCS, vol. 4134, pp. 387\u2013404. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11823230_25"},{"key":"41_CR11","unstructured":"Cooper, K., Harvey, T., Kennedy, K.: Iterative data- ow analysis, revisited (2002)"},{"issue":"4","key":"41_CR12","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1145\/115372.115320","volume":"13","author":"R Cytron","year":"1991","unstructured":"Cytron, R., Ferrante, J., Rosen, B.K., Wegman, M.N., Zadeck, F.K.: Efficiently computing static single assignment form and the control dependence graph. ACM Trans. Program. Lang. Syst. 13(4), 451\u2013490 (1991). https:\/\/doi.org\/10.1145\/115372.115320","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"49","key":"41_CR13","doi-asserted-by":"publisher","first-page":"6809","DOI":"10.1016\/j.tcs.2011.08.033","volume":"412","author":"S Danicic","year":"2011","unstructured":"Danicic, S., Barraclough, R.W., Harman, M., Howroyd, J., Kiss, \u00c1., Laurence, M.R.: A unifying theory of control dependence and its application to arbitrary program structures. Theor. Comput. Sci. 412(49), 6809\u20136842 (2011). https:\/\/doi.org\/10.1016\/j.tcs.2011.08.033","journal-title":"Theor. Comput. Sci."},{"key":"41_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/3-540-44520-X_47","volume-title":"Euro-Par 2000 Parallel Processing","author":"A Darte","year":"2000","unstructured":"Darte, A., Silber, G.-A.: Temporary arrays for distribution of loops with control dependences. In: Bode, A., Ludwig, T., Karl, W., Wism\u00fcller, R. (eds.) Euro-Par 2000. LNCS, vol. 1900, pp. 357\u2013367. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44520-X_47"},{"issue":"7","key":"41_CR15","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1145\/359636.359712","volume":"20","author":"DE Denning","year":"1977","unstructured":"Denning, D.E., Denning, P.J.: Certification of programs for secure information ow. Commun. ACM 20(7), 504\u2013513 (1977). https:\/\/doi.org\/10.1145\/359636.359712","journal-title":"Commun. ACM"},{"issue":"3","key":"41_CR16","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1145\/24039.24041","volume":"9","author":"J Ferrante","year":"1987","unstructured":"Ferrante, J., Ottenstein, K.J., Warren, J.D.: The program dependence graph and its use in optimization. ACM Trans. Program. Lang. Syst. 9(3), 319\u2013349 (1987). https:\/\/doi.org\/10.1145\/24039.24041","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"41_CR17","doi-asserted-by":"publisher","unstructured":"Gallagher, K., Binkley, D.: Program slicing. In: FoSM 2008, pp. 58\u201367 (2008). https:\/\/doi.org\/10.1109\/FOSM.2008.4659249","DOI":"10.1109\/FOSM.2008.4659249"},{"key":"41_CR18","unstructured":"Giffhorn, D.: Slicing of concurrent programs and its application to information flow control. Ph.D. thesis, Karlsruhe Institute of Technology (2012). http:\/\/digbib.ubka.uni-karlsruhe.de\/volltexte\/1000028814"},{"issue":"6","key":"41_CR19","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/s10207-009-0086-1","volume":"8","author":"C Hammer","year":"2009","unstructured":"Hammer, C., Snelting, G.: Flow-sensitive, context-sensitive, and object-sensitive information ow control based on program dependence graphs. Int. J. Inf. Sec. 8(6), 399\u2013422 (2009). https:\/\/doi.org\/10.1007\/s10207-009-0086-1","journal-title":"Int. J. Inf. Sec."},{"key":"41_CR20","doi-asserted-by":"publisher","unstructured":"Harrold, M.J., Rothermel, G., Sinha, S.: Computation of interprocedural control dependence. In: ISSTA 1998, pp. 11\u201320. ACM (1998). https:\/\/doi.org\/10.1145\/271771.271780","DOI":"10.1145\/271771.271780"},{"issue":"3","key":"41_CR21","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1145\/321832.321835","volume":"21","author":"MS Hecht","year":"1974","unstructured":"Hecht, M.S., Ullman, J.D.: Characterizations of reducible ow graphs. J. ACM 21(3), 367\u2013375 (1974). https:\/\/doi.org\/10.1145\/321832.321835","journal-title":"J. ACM"},{"issue":"1","key":"41_CR22","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1145\/77606.77608","volume":"12","author":"S Horwitz","year":"1990","unstructured":"Horwitz, S., Reps, T.W., Binkley, D.W.: Interprocedural slicing using dependence graphs. ACM Trans. Program. Lang. Syst. 12(1), 26\u201360 (1990). https:\/\/doi.org\/10.1145\/77606.77608","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"41_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/978-3-319-19584-1_4","volume-title":"Reliable Software Technologies \u2013 Ada-Europe 2015","author":"H Khanfar","year":"2015","unstructured":"Khanfar, H., Lisper, B., Masud, A.N.: Static backward program slicing for safety-critical systems. In: de la Puente, J.A., Vardanega, T. (eds.) Ada-Europe 2015. LNCS, vol. 9111, pp. 50\u201365. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-19584-1_4"},{"issue":"6","key":"41_CR24","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1007\/s00165-008-0086-3","volume":"20","author":"S Labb\u00e9","year":"2008","unstructured":"Labb\u00e9, S., Gallois, J.: Slicing communicating automata specifications: polynomial algorithms for model reduction. Formal Aspects Comput. 20(6), 563\u2013595 (2008). https:\/\/doi.org\/10.1007\/s00165-008-0086-3","journal-title":"Formal Aspects Comput."},{"key":"41_CR25","doi-asserted-by":"publisher","unstructured":"Lattner, C., Adve, V.S.: LLVM: a compilation framework for lifelong program analysis & transformation. In: CGO 2004, pp. 75\u201388. IEEE Computer Society (2004). https:\/\/doi.org\/10.1109\/CGO.2004.1281665","DOI":"10.1109\/CGO.2004.1281665"},{"issue":"1","key":"41_CR26","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/s00165-017-0439-x","volume":"30","author":"J L\u00e9chenet","year":"2018","unstructured":"L\u00e9chenet, J., Kosmatov, N., Gall, P.L.: Cut branches before looking for bugs: certifiably sound verification on relaxed slices. Formal Asp. Comput. 30(1), 107\u2013131 (2018). https:\/\/doi.org\/10.1007\/s00165-017-0439-x","journal-title":"Formal Asp. Comput."},{"key":"41_CR27","doi-asserted-by":"publisher","unstructured":"Loyall, J.P., Mathisen, S.A.: Using dependence analysis to support the software maintenance process. In: ICSM 1993, pp. 282\u2013291. IEEE Computer Society (1993). https:\/\/doi.org\/10.1109\/ICSM.1993.366934","DOI":"10.1109\/ICSM.1993.366934"},{"key":"41_CR28","doi-asserted-by":"publisher","unstructured":"Lucia, A.D.: Program slicing: methods and applications. In: SCAM 2001, pp. 144\u2013151. IEEE Computer Society (2001). https:\/\/doi.org\/10.1109\/SCAM.2001.972675","DOI":"10.1109\/SCAM.2001.972675"},{"key":"41_CR29","doi-asserted-by":"publisher","unstructured":"Metta, R., Becker, M., Bokil, P., Chakraborty, S., Venkatesh, R.: TIC: a scalable model checking based approach to WCET estimation. In: LCTES 2016, pp. 72\u201381. ACM (2016). https:\/\/doi.org\/10.1145\/2907950.2907961","DOI":"10.1145\/2907950.2907961"},{"key":"41_CR30","doi-asserted-by":"publisher","unstructured":"Ottenstein, K.J., Ottenstein, L.M.: The program dependence graph in a software development environment. In: FSE 1984, pp. 177\u2013184. ACM (1984). https:\/\/doi.org\/10.1145\/800020.808263","DOI":"10.1145\/800020.808263"},{"issue":"9","key":"41_CR31","doi-asserted-by":"publisher","first-page":"965","DOI":"10.1109\/32.58784","volume":"16","author":"A Podgurski","year":"1990","unstructured":"Podgurski, A., Clarke, L.A.: A formal model of program dependences and its implications for software testing, debugging, and maintenance. IEEE Trans. Software Eng. 16(9), 965\u2013979 (1990). https:\/\/doi.org\/10.1109\/32.58784","journal-title":"IEEE Trans. Software Eng."},{"key":"41_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/978-3-540-31987-0_7","volume-title":"Programming Languages and Systems","author":"VP Ranganath","year":"2005","unstructured":"Ranganath, V.P., Amtoft, T., Banerjee, A., Dwyer, M.B., Hatcliff, J.: A new foundation for control-dependence and slicing for modern program structures. In: Sagiv, M. (ed.) ESOP 2005. LNCS, vol. 3444, pp. 77\u201393. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-31987-0_7"},{"issue":"5","key":"41_CR33","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1145\/1275497.1275502","volume":"29","author":"VP Ranganath","year":"2007","unstructured":"Ranganath, V.P., Amtoft, T., Banerjee, A., Hatcliff, J., Dwyer, M.B.: A new foundation for control dependence and slicing for modern program structures. ACM Trans. Program. Lang. Syst. 29(5), 27 (2007). https:\/\/doi.org\/10.1145\/1275497.1275502","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"2","key":"41_CR34","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1145\/367008.367022","volume":"10","author":"S Sinha","year":"2001","unstructured":"Sinha, S., Harrold, M.J., Rothermel, G.: Interprocedural control dependence. ACM Trans. Softw. Eng. Methodol. 10(2), 209\u2013254 (2001). https:\/\/doi.org\/10.1145\/367008.367022","journal-title":"ACM Trans. Softw. Eng. Methodol."},{"issue":"1","key":"41_CR35","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1002\/spe.1059","volume":"42","author":"J Stanier","year":"2012","unstructured":"Stanier, J., Watson, D.: A study of irreducibility in C programs. Softw. Pract. Exp. 42(1), 117\u2013130 (2012). https:\/\/doi.org\/10.1002\/spe.1059","journal-title":"Softw. Pract. Exp."},{"key":"41_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1007\/978-3-540-78663-4_20","volume-title":"Trustworthy Global Computing","author":"I T\u0161ahhirov","year":"2008","unstructured":"T\u0161ahhirov, I., Laud, P.: Application of dependency graphs to security protocol analysis. In: Barthe, G., Fournet, C. (eds.) TGC 2007. LNCS, vol. 4912, pp. 294\u2013311. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78663-4_20"},{"issue":"4","key":"41_CR37","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1109\/TSE.1984.5010248","volume":"10","author":"M Weiser","year":"1984","unstructured":"Weiser, M.: Program slicing. IEEE Trans. Softw. Eng. 10(4), 352\u2013357 (1984). https:\/\/doi.org\/10.1109\/TSE.1984.5010248","journal-title":"IEEE Trans. Softw. Eng."}],"container-title":["Lecture Notes in Computer Science","Computer Aided Verification"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-81688-9_41","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,16]],"date-time":"2021-07-16T16:29:49Z","timestamp":1626452989000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-81688-9_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030816872","9783030816889"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-81688-9_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"15 July 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CAV","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computer Aided Verification","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 July 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 July 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"33","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cav2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/i-cav.org\/2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"290","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"63","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"22% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"12","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"16 tool papers and 5 invited papers are also included.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}