{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:47:13Z","timestamp":1742914033155,"version":"3.40.3"},"publisher-location":"Cham","reference-count":55,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031352560"},{"type":"electronic","value":"9783031352577"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-35257-7_9","type":"book-chapter","created":{"date-parts":[[2023,6,26]],"date-time":"2023-06-26T23:02:32Z","timestamp":1687820552000},"page":"146-163","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Verifying Chips Design at\u00a0RTL Level"],"prefix":"10.1007","author":[{"given":"Wu","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nan","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cong","family":"Tian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhenhua","family":"Duan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhijie","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chaofeng","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,6,27]]},"reference":[{"key":"9_CR1","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1109\/TSE.1980.234485","volume":"3","author":"EJ Weyuker","year":"1980","unstructured":"Weyuker, E.J., Ostrand, T.J.: Theories of program testing and the application of revealing subdomains. IEEE Trans. Software Eng. 3, 236\u2013246 (1980)","journal-title":"IEEE Trans. Software Eng."},{"key":"9_CR2","unstructured":"Frenkel, D., Smit, B.: Understanding Molecular Simulation: From Algorithms to Applications. Academic Press, New York (2001)"},{"issue":"9","key":"9_CR3","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1109\/2.58215","volume":"23","author":"JM Wing","year":"1990","unstructured":"Wing, J.M.: A specifier\u2019s introduction to formal methods. Computer 23(9), 8\u201322 (1990)","journal-title":"Computer"},{"key":"9_CR4","doi-asserted-by":"publisher","first-page":"576","DOI":"10.1145\/363235.363259","volume":"12","author":"CAR Hoare","year":"1969","unstructured":"Hoare, C.A.R.: An axiomatic basis for computer programming. Commun. ACM 12, 576\u2013580 (1969)","journal-title":"Commun. ACM"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Pnueli, A.: The temporal logic of programs. In: Symposium on Foundations of Computer Science, pp. 46\u201357. IEEE Xplore (1977)","DOI":"10.1109\/SFCS.1977.32"},{"key":"9_CR6","unstructured":"Clarke, E.M., Emerson, E.A., Sifakis, J.: Model checking. Lect. Notes Comput. Sci. 164(2), 305\u2013349 (1999)"},{"issue":"5","key":"9_CR7","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1109\/32.588521","volume":"23","author":"GJ Holzmann","year":"1997","unstructured":"Holzmann, G.J.: The model checker SPIN. IEEE Trans. Software Eng. 23(5), 279\u2013295 (1997)","journal-title":"IEEE Trans. Software Eng."},{"issue":"2","key":"9_CR8","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1016\/0890-5401(92)90017-A","volume":"98","author":"JR Burch","year":"1992","unstructured":"Burch, J.R., Clarke, E.M., Mc Millan, K.L., et al.: Symbolic model checking: 1020 states and beyond. Inf. Comput. 98(2), 142\u2013170 (1992)","journal-title":"Inf. Comput."},{"issue":"5","key":"9_CR9","doi-asserted-by":"publisher","first-page":"1512","DOI":"10.1145\/186025.186051","volume":"16","author":"EM Clarke","year":"1994","unstructured":"Clarke, E.M., Grumberg, O., Long, D.E.: Model checking and abstraction. ACM Trans. Program. Lang. Syst. 16(5), 1512\u20131542 (1994)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"9_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/3-540-45657-0_29","volume-title":"Computer Aided Verification","author":"A Cimatti","year":"2002","unstructured":"Cimatti, A., et al.: NuSMV 2: an OpenSource tool for symbolic model checking. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol. 2404, pp. 359\u2013364. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45657-0_29"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"Bryant, R.E.: Graph-Based Algorithms for Boolean Function Manipulation12 (1986)","DOI":"10.1109\/TC.1986.1676819"},{"key":"9_CR12","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/s10009-015-0407-9","volume":"19","author":"MYR Gadelha","year":"2017","unstructured":"Gadelha, M.Y.R., Ismail, H.I., Cordeiro, L.C.: Handling loops in bounded model checking of C programs via K-induction. Int. J. Softw. Tools Technol. Transfer 19, 97\u2013114 (2017)","journal-title":"Int. J. Softw. Tools Technol. Transfer"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Biere, A., Cimatti, A., Clarke, E.M., Fujita, M., Zhu, Y.: Symbolic model checking using SAT procedures instead of BDDs. In: *Design Automation Conference, (DAC*1999), June 1999","DOI":"10.21236\/ADA360973"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Cai, S., Zhang, X.: Deep cooperation of CDCL and local search for SAT (Extended Abstract). In: IJCAI 2022, pp. 5274\u20135278 (2022)","DOI":"10.24963\/ijcai.2022\/734"},{"issue":"5\u20136","key":"9_CR15","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1002\/malq.19630090502","volume":"9","author":"SA Kripke","year":"1963","unstructured":"Kripke, S.A.: Semantical analysis of modal logic I normal modal propositional calculi. Math. Log. Q. 9(5\u20136), 67\u201396 (1963)","journal-title":"Math. Log. Q."},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"Duan, Z.: Temporal Logic and Temporal Logic Programming, Beijing (2005)","DOI":"10.1007\/11562931_27"},{"issue":"1\u20133","key":"9_CR17","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/S0303-2647(99)00087-8","volume":"55","author":"Z Duan","year":"2000","unstructured":"Duan, Z., Holcombe, M., Bell, A.: A logic for biosystems. Biosystems 55(1\u20133), 93\u2013105 (2000)","journal-title":"Biosystems"},{"key":"9_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/3-540-58216-9_48","volume-title":"Logic Programming and Automated Reasoning","author":"Z Duan","year":"1994","unstructured":"Duan, Z., Koutny, M., Holt, C.: Projection in temporal logic programming. In: Pfenning, F. (ed.) LPAR 1994. LNCS, vol. 822, pp. 333\u2013344. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-58216-9_48"},{"key":"9_CR19","first-page":"333","volume":"19","author":"Z Duan","year":"2004","unstructured":"Duan, Z., Koutny, M.: A framed temporal logic programming language. J. Comput. Sci. Technol. 19, 333\u2013344 (2004)","journal-title":"J. Comput. Sci. Technol."},{"key":"9_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1007\/11562931_27","volume-title":"Logic Programming","author":"Z Duan","year":"2005","unstructured":"Duan, Z., Yang, X., Koutny, M.: Semantics of framed temporal logic programs. In: Gabbrielli, M., Gupta, G. (eds.) ICLP 2005. LNCS, vol. 3668, pp. 356\u2013370. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11562931_27"},{"key":"9_CR21","unstructured":"Galesi, N., Itsykson, D., Riazanov, A., Sofronova, A.: Bounded-depth Frege complexity of Tseitin formulas for all graphs. In: MFCS 2019, pp. 49:1\u201349:15 (2019)"},{"key":"9_CR22","doi-asserted-by":"crossref","unstructured":"Chambers, B., et al.: Faster SAT solving with better CNF generation. In: 2009 Design, Automation and Test in Europe Conference and Exhibition, pp. 1590\u20131595 (2009)","DOI":"10.1109\/DATE.2009.5090918"},{"issue":"7","key":"9_CR23","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1145\/368273.368557","volume":"5","author":"M Davis","year":"1962","unstructured":"Davis, M., Logemann, G., Lovelandn, D.: A machine program for theorem proving. Commun. ACM 5(7), 394\u2013397 (1962)","journal-title":"Commun. ACM"},{"key":"9_CR24","unstructured":"Freeman, J.W.: Improvements to Propositional Satisfiability Search Algorithms. University of Pennsylvania, Philadelphia, PA, USA (1995)"},{"key":"9_CR25","doi-asserted-by":"crossref","unstructured":"Een, N., Sorensson, N.: An extensible SAT solver. In: Theory and Applications of Satisfiability Testing. Santa Margherita Ligure, Italy, pp. 502\u2013518 (2003)","DOI":"10.1007\/978-3-540-24605-3_37"},{"key":"9_CR26","doi-asserted-by":"crossref","unstructured":"Zhang, H.-T.: SATO: an efficient propositional prover. In: Proceedings of the 14th International Conference on Automated Deduction (CADE-1997), pp. 272\u2013275, London, UK (1997)","DOI":"10.1007\/3-540-63104-6_28"},{"key":"9_CR27","doi-asserted-by":"crossref","unstructured":"Marques-Silva, J.P., Sakallah, K.A.: GRASP: a new search algorithm for satisfiability. In: Proceedings of the ACM\/IEEE International Conference on Computer-Aided Design, pp. 220\u2013227, Washington, DC, USA (1996)","DOI":"10.1109\/ICCAD.1996.569607"},{"issue":"12","key":"9_CR28","doi-asserted-by":"publisher","first-page":"1549","DOI":"10.1016\/j.dam.2006.10.007","volume":"155","author":"E Goldberg","year":"2007","unstructured":"Goldberg, E., Novikov, Y.: BerkMin: a fast and robust SAT-solver. Discret. Appl. Math. 155(12), 1549\u20131561 (2007)","journal-title":"Discret. Appl. Math."},{"key":"9_CR29","doi-asserted-by":"crossref","unstructured":"Moskewicz, M., Madigan, C., Zhao, Y., et a1.: Chaff: engineering an efficient SAT solver. In: Proceedings of 38th Conference on Design Automation, pp. 530\u2013535, Las Vegas, NV, USA (2001)","DOI":"10.1145\/378239.379017"},{"key":"9_CR30","doi-asserted-by":"crossref","unstructured":"Goldberg, E., Novikov, Y.: BerMin: a fast and robust SAT-solver. In: Proceedings of Design Automation and Test in Europe (DATE), pp. 142\u2013149, Paris, France (2002)","DOI":"10.1109\/DATE.2002.998262"},{"key":"9_CR31","doi-asserted-by":"crossref","unstructured":"Audemard, G., Simon, L.: Refining restarts strategies for SAT and UNSAT formulae. In: Proceedings of the 18th International Conference on Principles and Practice of Constraint Programming (2012)","DOI":"10.1007\/978-3-642-33558-7_11"},{"key":"9_CR32","doi-asserted-by":"publisher","first-page":"1515","DOI":"10.1613\/jair.1.13666","volume":"74","author":"S Cai","year":"2022","unstructured":"Cai, S., Zhang, X., Fleury, M., Biere, A.: Better decision heuristics in CDCL through local search and target phases. J. Artif. Intell. Res. 74, 1515\u20131563 (2022)","journal-title":"J. Artif. Intell. Res."},{"key":"9_CR33","unstructured":"Selman, B., Levesque, H., Mitchell, D.: A new method for solving hard satisfiability problems. In: Proceedings of the 10th AAAI 1992, pp. 440\u2013446. AAAI Press, Menlo Park, CA (1992)"},{"key":"9_CR34","unstructured":"Selman, B., Kautz, H.A., Cohen, B.: Noise strategies for improving local search. In: Proceedings of the 12th AAAI-1994, pp. 337\u2013343. AAAI Press, Menlo Park, CA (1994)"},{"key":"9_CR35","unstructured":"McAllester, D., Selman, B., Kautz, H.: Evidence for invariants in local search. In: Proceedings of the 14th AAAI 1997, pp. 321\u2013326. AAAI Press, Menlo Park, CA (1997)"},{"key":"9_CR36","unstructured":"Mazure, B., Sais, L., Gregoire, E.: Tabu search for SAT. In: Proceedings of the 14th AAAI 1997, pp. 28\u2013285. AAAI Press, Menlo Park, CA (1997)"},{"issue":"2","key":"9_CR37","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/S0004-3702(01)00151-5","volume":"132","author":"D Schuurmans","year":"2001","unstructured":"Schuurmans, D., Southey, F.: Local search characteristics of incomplete SAT procedures. Artif. Intell. 132(2), 121\u2013150 (2001)","journal-title":"Artif. Intell."},{"key":"9_CR38","doi-asserted-by":"crossref","unstructured":"Prestwich, S., Lynce, I.: Local search for unsatisfiability. In: Proceedings of the 9th International Conference on Theory and Applications of Satisfiability Testing, Seattle, pp. 283\u2013296, WA, USA (2006)","DOI":"10.1007\/11814948_28"},{"key":"9_CR39","unstructured":"Audemard, G., Simon, L.: GUNSAT: a greedy local search algorithm for unsatisfiabiIity. In: Proceedings of the 20th International Joint Conference of Artificial Intelligence, pp. 2256\u20132261, Hyderabad, India (2007)"},{"key":"9_CR40","unstructured":"Crypto MiniSat2 [CP\/OL]. http:\/\/www.msoos.org\/cryptominisat2\/"},{"key":"9_CR41","unstructured":"Biere, A.: Lingeling, Plingeling and Treengeling entering the SAT competition 2013. In: Proceedings of SAT Competition (2013)"},{"key":"9_CR42","doi-asserted-by":"crossref","unstructured":"Een, N., Sorensson, N.: An extensible SAT solver. In: Theory and Applications of Satisfiability Testing, pp. 502\u2013518, Santa Margherita Ligure, Italy (2003)","DOI":"10.1007\/978-3-540-24605-3_37"},{"key":"9_CR43","doi-asserted-by":"crossref","unstructured":"Guo, L., Hamadi, Y., Jabbour, S., Sais, L.: Diversification and intensification in parallel SAT solving. In: Proceedings of the 16th International Conference on Principles and Practices of Constraint Programming (2010)","DOI":"10.1007\/978-3-642-15396-9_22"},{"key":"9_CR44","unstructured":"Biere, A.: The AIGER And-Inverter Graph (AIG) Format Version 20070427 (2007)"},{"key":"9_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/978-3-642-14295-6_5","volume-title":"Computer Aided Verification","author":"R Brayton","year":"2010","unstructured":"Brayton, R., Mishchenko, A.: ABC: an academic industrial-strength verification tool. In: Touili, T., Cook, B., Jackson, P. (eds.) CAV 2010. LNCS, vol. 6174, pp. 24\u201340. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14295-6_5"},{"key":"9_CR46","unstructured":"https:\/\/yosyshq.net\/yosys\/"},{"key":"9_CR47","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1016\/j.tcs.2015.08.039","volume":"609","author":"Z Duan","year":"2016","unstructured":"Duan, Z., Tian, C., Zhang, N.: A canonical form based decision procedure and model checking approach for propositional projection temporal logic. Theoret. Comput. Sci. 609, 544\u2013560 (2016)","journal-title":"Theoret. Comput. Sci."},{"key":"9_CR48","doi-asserted-by":"crossref","unstructured":"Pan, Y.: Development of image processing software based on QT creator. In: 2019 IEEE 3rd Information Technology, Networking, Electronic and Automation Control Conference (ITNEC), pp. 2667\u20132671. IEEE (2019)","DOI":"10.1109\/ITNEC.2019.8729186"},{"key":"9_CR49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/978-3-030-20652-9_11","volume-title":"NASA Formal Methods","author":"A Goel","year":"2019","unstructured":"Goel, A., Sakallah, K.: Model checking of verilog RTL using IC3 with syntax-guided abstraction. In: Badger, J.M., Rozier, K.Y. (eds.) NFM 2019. LNCS, vol. 11460, pp. 166\u2013185. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-20652-9_11"},{"key":"9_CR50","doi-asserted-by":"crossref","unstructured":"Irfan, A., Cimatti, A., Griggio, A., et al.: Verilog2SMV: a tool for word-level verification. In: 2016 Design, Automation & Test in Europe Conference & Exhibition (DATE), pp. 1156\u20131159. IEEE (2016)","DOI":"10.3850\/9783981537079_0765"},{"key":"9_CR51","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/978-3-540-89439-1_25","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"ZS Andraus","year":"2008","unstructured":"Andraus, Z.S., Liffiton, M.H., Sakallah, K.A.: Reveal: a formal verification tool for verilog designs. In: Cervesato, I., Veith, H., Voronkov, A. (eds.) LPAR 2008. LNCS (LNAI), vol. 5330, pp. 343\u2013352. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-89439-1_25"},{"key":"9_CR52","doi-asserted-by":"crossref","unstructured":"Ho, Y.S., Mishchenko, A., Brayton, R.: Property directed reachability with word-level abstraction. In: 2017 Formal Methods in Computer Aided Design (FMCAD), pp. 132\u2013139. IEEE (2017)","DOI":"10.23919\/FMCAD.2017.8102251"},{"key":"9_CR53","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/978-3-319-26287-1_10","volume-title":"Hardware and Software: Verification and Testing","author":"M Leucker","year":"2015","unstructured":"Leucker, M., Markin, G., Neuh\u00e4u\u00dfer, M.R.: A new refinement strategy for CEGAR-based industrial model checking. In: Piterman, N. (ed.) HVC 2015. LNCS, vol. 9434, pp. 155\u2013170. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-26287-1_10"},{"key":"9_CR54","doi-asserted-by":"crossref","unstructured":"Drechsler, R.: PolyAdd: polynomial formal verification of adder circuits. In: 2021 24th International Symposium on Design and Diagnostics of Electronic Circuits and Systems (DDECS), pp. 99\u2013104. IEEE (2021)","DOI":"10.1109\/DDECS52668.2021.9417052"},{"key":"9_CR55","doi-asserted-by":"crossref","unstructured":"Andraus, Z.S., Sakallah, K.A.: Automatic abstraction and verification of verilog models. In: Proceedings of the 41st annual Design Automation Conference, pp. 218\u2013223 (2004)","DOI":"10.1145\/996566.996629"}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Software Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-35257-7_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T03:24:11Z","timestamp":1729653851000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-35257-7_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031352560","9783031352577"],"references-count":55,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-35257-7_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"27 June 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TASE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Theoretical Aspects of Software Engineering","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bristol","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","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":"4 July 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 July 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tase2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/bristolpl.github.io\/tase2023\/","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":"49","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":"19","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":"39% - 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":"3","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)"}}]}}