{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T11:27:46Z","timestamp":1778498866272,"version":"3.51.4"},"publisher-location":"Cham","reference-count":63,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030816841","type":"print"},{"value":"9783030816858","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>A barrier certificate often serves as an inductive invariant that isolates an unsafe region from the reachable set of states, and hence is widely used in proving safety of hybrid systems possibly over the infinite time horizon. We present a novel condition on barrier certificates, termed the<jats:italic>invariant barrier-certificate condition<\/jats:italic>, that witnesses unbounded-time safety of differential dynamical systems. The proposed condition is by far the least conservative one on barrier certificates, and can be shown as the weakest possible one to attain inductive invariance. We show that discharging the invariant barrier-certificate condition\u2014thereby synthesizing invariant barrier certificates\u2014can be encoded as solving an<jats:italic>optimization problem subject to bilinear matrix inequalities<\/jats:italic>(BMIs). We further propose a synthesis algorithm based on difference-of-convex programming, which approaches a local optimum of the BMI problem via solving<jats:italic>a series of convex optimization problems<\/jats:italic>. This algorithm is incorporated in a branch-and-bound framework that searches for the global optimum in a divide-and-conquer fashion. We present a weak completeness result of our method, in the sense that a barrier certificate is guaranteed to be found (under some mild assumptions) whenever there exists an inductive invariant (in the form of a given template) that suffices to certify safety of the system. Experimental results on benchmark examples demonstrate the effectiveness and efficiency of our approach.<\/jats:p>","DOI":"10.1007\/978-3-030-81685-8_21","type":"book-chapter","created":{"date-parts":[[2021,7,17]],"date-time":"2021-07-17T00:02:35Z","timestamp":1626480155000},"page":"443-466","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Synthesizing Invariant Barrier Certificates via Difference-of-Convex Programming"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5138-3273","authenticated-orcid":false,"given":"Qiuye","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9663-7441","authenticated-orcid":false,"given":"Mingshuai","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9717-846X","authenticated-orcid":false,"given":"Bai","family":"Xue","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3298-3817","authenticated-orcid":false,"given":"Naijun","family":"Zhan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6143-1926","authenticated-orcid":false,"given":"Joost-Pieter","family":"Katoen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,7,15]]},"reference":[{"issue":"1","key":"21_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0304-3975(94)00202-T","volume":"138","author":"R Alur","year":"1995","unstructured":"Alur, R., et al.: The algorithmic analysis of hybrid systems. Theor. Comput. Sci. 138(1), 3\u201334 (1995)","journal-title":"Theor. Comput. Sci."},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"Anai, H., Weispfenning, V.: Reach set computations using real quantifier elimination. In: HSCC (2001)","DOI":"10.1007\/3-540-45351-2_9"},{"key":"21_CR3","doi-asserted-by":"crossref","unstructured":"Boyd, S., Vandenberghe, L.: Convex Optimization (2004)","DOI":"10.1017\/CBO9780511804441"},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"Chen, X., et al.: A novel approach for solving the BMI problem in barrier certificates generation. In: CAV (2020)","DOI":"10.1007\/978-3-030-53288-8_29"},{"issue":"7","key":"21_CR5","first-page":"1241","volume":"47","author":"WY Chiu","year":"2016","unstructured":"Chiu, W.Y.: Method of reduction of variables for bilinear matrix inequality problems in system and control designs. IEEE SMC 47(7), 1241\u20131256 (2016)","journal-title":"IEEE SMC"},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"Choi, M.D., Lam, T.Y., Reznick, B.: Sums of squares of real polynomials. In: Proceedings of Symposia in Pure Mathematics (1995)","DOI":"10.1090\/pspum\/058.2\/1327293"},{"issue":"1","key":"21_CR7","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1137\/S1052623402417298","volume":"15","author":"R Correa","year":"2004","unstructured":"Correa, R.: A global algorithm for nonlinear semidefinite programming. SIOPT 15(1), 303\u2013318 (2004)","journal-title":"SIOPT"},{"key":"21_CR8","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/j.jsc.2016.07.010","volume":"80","author":"L Dai","year":"2017","unstructured":"Dai, L., et al.: Barrier certificates revisited. J. Symb. Comput. 80, 62\u201386 (2017)","journal-title":"J. Symb. Comput."},{"issue":"5","key":"21_CR9","doi-asserted-by":"publisher","first-page":"1750","DOI":"10.1137\/S036012995279031","volume":"36","author":"J Dennis","year":"1998","unstructured":"Dennis, J., Heinkenschloss, M., Vicente, L.N.: Trust-region interior-point SQP algorithms for a class of nonlinear programming problems. SICON 36(5), 1750\u20131794 (1998)","journal-title":"SICON"},{"issue":"6","key":"21_CR10","first-page":"1377","volume":"57","author":"QT Dinh","year":"2011","unstructured":"Dinh, Q.T., et al.: Combining convex-concave decompositions and linearization approaches for solving BMIs, with application to static output feedback. IEEE TAC 57(6), 1377\u20131390 (2011)","journal-title":"IEEE TAC"},{"key":"21_CR11","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/j.automatica.2016.12.013","volume":"78","author":"A Djaballah","year":"2017","unstructured":"Djaballah, A., et al.: Construction of parametric barrier functions for dynamical systems using interval analysis. Automatica 78, 287\u2013290 (2017)","journal-title":"Automatica"},{"key":"21_CR12","doi-asserted-by":"crossref","unstructured":"Eggers, A., et al.: Improving the SAT modulo ODE approach to hybrid systems analysis by combining different enclosure methods. In: SoSyM (2012)","DOI":"10.1007\/s10270-012-0295-3"},{"issue":"1","key":"21_CR13","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/s10440-014-9974-0","volume":"139","author":"A Ferragut","year":"2015","unstructured":"Ferragut, A., Gasull, A.: Seeking Darboux polynomials. Acta Applicandae Mathematicae 139(1), 167\u2013186 (2015)","journal-title":"Acta Applicandae Mathematicae"},{"key":"21_CR14","unstructured":"Fiala, J., Ko\u010dvara, M., Stingl, M.: PENLAB: A MATLAB solver for nonlinear semidefinite optimization. CoRR abs\/1311.5240 (2013)"},{"issue":"1","key":"21_CR15","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1145\/3313909.3313913","volume":"6","author":"M Fr\u00e4nzle","year":"2019","unstructured":"Fr\u00e4nzle, M., Chen, M., Kr\u00f6ger, P.: In memory of Oded Maler: automatic reachability analysis of hybrid-state automata. ACM SIGLOG News 6(1), 19\u201339 (2019)","journal-title":"ACM SIGLOG News"},{"key":"21_CR16","doi-asserted-by":"crossref","unstructured":"Gan, T., et al.: Decidability of the reachability for a family of linear vector fields. In: ATVA (2015)","DOI":"10.1007\/978-3-319-24953-7_34"},{"key":"21_CR17","doi-asserted-by":"crossref","unstructured":"Gan, T., et al.: Computing reachable sets of linear vector fields revisited. In: ECC (2016)","DOI":"10.1109\/ECC.2016.7810321"},{"issue":"7","key":"21_CR18","first-page":"2003","volume":"63","author":"T Gan","year":"2018","unstructured":"Gan, T., et al.: Reachability analysis for solvable dynamical systems. IEEE TAC 63(7), 2003\u20132018 (2018)","journal-title":"IEEE TAC"},{"key":"21_CR19","doi-asserted-by":"crossref","unstructured":"Gao, S., et al.: Numerically-robust inductive proof rules for continuous dynamical systems. In: CAV (2019)","DOI":"10.1007\/978-3-030-25543-5_9"},{"issue":"4","key":"21_CR20","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/BF01099648","volume":"7","author":"KC Goh","year":"1995","unstructured":"Goh, K.C., Safonov, M.G., Papavassilopoulos, G.P.: Global optimization for the biaffine matrix inequality problem. J. Glob. Optim. 7(4), 365\u2013380 (1995)","journal-title":"J. Glob. Optim."},{"key":"21_CR21","doi-asserted-by":"crossref","unstructured":"Goubault, E., et al.: Finding non-polynomial positive invariants and Lyapunov functions for polynomial systems through Darboux polynomials. In: ACC (2014)","DOI":"10.1109\/ACC.2014.6859330"},{"key":"21_CR22","unstructured":"Gulwani, S., Tiwari, A.: Constraint-based approach for analysis of hybrid systems. In: CAV (2008)"},{"key":"21_CR23","doi-asserted-by":"crossref","unstructured":"Ibaraki, S., Tomizuka, M.: Rank minimization approach for solving BMI problems with random search. In: ACC (2001)","DOI":"10.1109\/ACC.2001.946009"},{"issue":"3","key":"21_CR24","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/s10589-005-3231-4","volume":"31","author":"C Kanzow","year":"2005","unstructured":"Kanzow, C., et al.: Successive linearization methods for nonlinear semidefinite programs. Comput. Optim. Appl. 31(3), 252\u2013273 (2005)","journal-title":"Comput. Optim. Appl."},{"key":"21_CR25","doi-asserted-by":"crossref","unstructured":"Kapinski, J., et al.: Simulation-guided Lyapunov analysis for hybrid dynamical systems. In: HSCC (2014)","DOI":"10.1145\/2562059.2562139"},{"key":"21_CR26","doi-asserted-by":"crossref","unstructured":"Kheirandishfard, M., Zohrizadeh, F., Madani, R.: Convex relaxation of bilinear matrix inequalities Part I: Theoretical results. In: CDC (2018)","DOI":"10.1109\/CDC.2018.8619567"},{"key":"21_CR27","unstructured":"Klipp, E., et al.: Systems Biology in Practice: Concepts, Implementation and Application (2008)"},{"key":"21_CR28","doi-asserted-by":"crossref","unstructured":"Kol\u00e1r\u0306 I., Michor, P.W., Slov\u00e1k, J.: Natural Operations in Differential Geometry (1993)","DOI":"10.1007\/978-3-662-02950-3"},{"key":"21_CR29","doi-asserted-by":"crossref","unstructured":"Kong, H., et al.: Exponential-condition-based barrier certificate generation for safety verification of hybrid systems. In: CAV (2013)","DOI":"10.1007\/978-3-642-39799-8_17"},{"key":"21_CR30","doi-asserted-by":"crossref","unstructured":"Kong, S., Solar-Lezama, A., Gao, S.: Delta-decision procedures for exists-forall problems over the reals. In: CAV (2018)","DOI":"10.1007\/978-3-319-96142-2_15"},{"issue":"3","key":"21_CR31","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1006\/jsco.2001.0472","volume":"32","author":"G Lafferriere","year":"2001","unstructured":"Lafferriere, G., Pappas, G.J., Yovine, S.: Symbolic reachability computation for families of linear vector fields. J. Symb. Comput. 32(3), 23\u2013253 (2001)","journal-title":"J. Symb. Comput."},{"key":"21_CR32","doi-asserted-by":"crossref","unstructured":"Lasserre, J.B.: Moments, Positive Polynomials and Their Applications (2010)","DOI":"10.1142\/p665"},{"issue":"1","key":"21_CR33","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s10107-018-1235-y","volume":"169","author":"HA Le Thi","year":"2018","unstructured":"Le Thi, H.A., Dinh, T.P.: DC programming and DCA: thirty years of developments. Math. Program. 169(1), 5\u201368 (2018)","journal-title":"Math. Program."},{"issue":"4","key":"21_CR34","doi-asserted-by":"publisher","first-page":"1048","DOI":"10.1137\/S1052623400375865","volume":"12","author":"F Leibfritz","year":"2002","unstructured":"Leibfritz, F., Mostafa, E.: An interior point constrained trust region method for a special class of nonlinear semidefinite programming problems. SIOPT 12(4), 1048\u20131071 (2002)","journal-title":"SIOPT"},{"issue":"4","key":"21_CR35","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1007\/s12532-018-0137-6","volume":"10","author":"X Li","year":"2018","unstructured":"Li, X., Sun, D., Toh, K.C.: QSDPNAL: a two-phase augmented Lagrangian method for convex quadratic semidefinite programming. Math. Program. Comput. 10(4), 703\u2013743 (2018)","journal-title":"Math. Program. Comput."},{"key":"21_CR36","doi-asserted-by":"crossref","unstructured":"Liu, J., Zhan, N., Zhao, H.: Computing semi-algebraic invariants for polynomial dynamical systems. In: EMSOFT (2011)","DOI":"10.1145\/2038642.2038659"},{"key":"21_CR37","doi-asserted-by":"crossref","unstructured":"de Moura, L.M., Bj\u00f8rner, N.: Z3: an efficient SMT solver. In: TACAS (2008)","DOI":"10.1007\/978-3-540-78800-3_24"},{"issue":"11","key":"21_CR38","doi-asserted-by":"publisher","first-page":"1875","DOI":"10.1016\/j.automatica.2006.05.026","volume":"42","author":"R Orsi","year":"2006","unstructured":"Orsi, R., Helmke, U., Moore, J.B.: A Newton-like method for solving rank constrained linear matrix inequalities. Automatica 42(11), 1875\u20131882 (2006)","journal-title":"Automatica"},{"key":"21_CR39","unstructured":"Papachristodoulou, A., et al.: SOSTOOLS version 3.00 sum of squares optimization toolbox for MATLAB. CoRR abs\/1310.4716 (2013)"},{"key":"21_CR40","doi-asserted-by":"crossref","unstructured":"Platzer, A., Clarke, E.M.: Computing differential invariants of hybrid systems as fixedpoints. In: CAV (2008)","DOI":"10.21236\/ADA476791"},{"key":"21_CR41","doi-asserted-by":"crossref","unstructured":"Prajna, S., Jadbabaie, A.: Safety verification of hybrid systems using barrier certificates. In: HSCC (2004)","DOI":"10.1007\/978-3-540-24743-2_32"},{"key":"21_CR42","doi-asserted-by":"crossref","unstructured":"Ratschan, S., She, Z.: Constraints for continuous reachability in the verification of hybrid systems. In: AISC (2006)","DOI":"10.1007\/11856290_18"},{"issue":"1","key":"21_CR43","doi-asserted-by":"publisher","first-page":"8-es","DOI":"10.1145\/1210268.1210276","volume":"6","author":"S Ratschan","year":"2007","unstructured":"Ratschan, S., She, Z.: Safety verification of hybrid systems by constraint propagation-based abstraction refinement. ACM TECS 6(1), 8-es (2007)","journal-title":"ACM TECS"},{"issue":"7","key":"21_CR44","doi-asserted-by":"publisher","first-page":"4377","DOI":"10.1137\/090749955","volume":"48","author":"S Ratschan","year":"2010","unstructured":"Ratschan, S., She, Z.: Providing a basin of attraction to a target region of polynomial systems by computation of Lyapunov-like functions. SICON 48(7), 4377\u20134394 (2010)","journal-title":"SICON"},{"issue":"3","key":"21_CR45","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1137\/070697835","volume":"52","author":"B Recht","year":"2010","unstructured":"Recht, B., Fazel, M., Parrilo, P.A.: Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization. SIAM Rev. 52(3), 471\u2013501 (2010)","journal-title":"SIAM Rev."},{"key":"21_CR46","doi-asserted-by":"crossref","unstructured":"Sankaranarayanan, S., Sipma, H.B., Manna, Z.: Constructing invariants for hybrid systems. In: HSCC (2004)","DOI":"10.1007\/978-3-540-24743-2_36"},{"key":"21_CR47","unstructured":"Sassi, M.A.B., Girard, A., Sankaranarayanan, S.: Iterative computation of polyhedral invariants sets for polynomial dynamical systems. In: CDC (2014)"},{"key":"21_CR48","unstructured":"Sassi, M.A.B., Sankaranarayanan, S.: Stability and stabilization of polynomial dynamical systems using Bernstein polynomials. In: HSCC (2015)"},{"issue":"1","key":"21_CR49","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1016\/j.amc.2005.09.077","volume":"178","author":"WD Smith","year":"2006","unstructured":"Smith, W.D.: Church\u2019s thesis meets the n-body problem. Appl. Math. Comput. 178(1), 154\u2013183 (2006)","journal-title":"Appl. Math. Comput."},{"key":"21_CR50","unstructured":"Sogokon, A., Ghorbal, K., Johnson, T.T.: Non-linear continuous systems for safety verification (benchmark proposal). In: ARCH @ CPSWeek (2016)"},{"key":"21_CR51","doi-asserted-by":"crossref","unstructured":"Sogokon, A., et al.: Vector barrier certificates and comparison systems. In: FM (2018)","DOI":"10.1007\/978-3-319-95582-7_25"},{"key":"21_CR52","doi-asserted-by":"crossref","unstructured":"Tao, P.D., Souad, E.B.: Algorithms for solving a class of nonconvex optimization problems. North-Holland Mathematics Studies, Methods of subgradients (1986)","DOI":"10.1016\/S0304-0208(08)72402-2"},{"key":"21_CR53","doi-asserted-by":"crossref","unstructured":"Tarski, A.: A Decision Method for Elementary Algebra and Geometry (1951)","DOI":"10.1525\/9780520348097"},{"key":"21_CR54","doi-asserted-by":"crossref","unstructured":"Tiwari, A.: Approximate reachability for linear systems. In: HSCC (2003)","DOI":"10.1007\/3-540-36580-X_37"},{"key":"21_CR55","unstructured":"Toker, O., Ozbay, H.: On the NP-hardness of solving bilinear matrix inequalities and simultaneous stabilization with static output feedback. In: ACC (1995)"},{"issue":"7","key":"21_CR56","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1002\/1099-1239(200006)10:7<561::AID-RNC493>3.0.CO;2-C","volume":"10","author":"HD Tuan","year":"2000","unstructured":"Tuan, H.D., Apkarian, P., Nakashima, Y.: A new Lagrangian dual global optimization algorithm for solving bilinear matrix inequalities. Int. J. Rob. Nonlinear Control IFAC-Affiliat. J. 10(7), 561\u2013578 (2000)","journal-title":"Int. J. Rob. Nonlinear Control IFAC-Affiliat. J."},{"key":"21_CR57","doi-asserted-by":"crossref","unstructured":"Wang, Q., et al.: Synthesizing invariant barrier certificates via difference-of-convex programming (extended version). arXiv abs\/2105.14311 (2021)","DOI":"10.1007\/978-3-030-81685-8_21"},{"key":"21_CR58","doi-asserted-by":"crossref","unstructured":"Wang, Y., Rajamani, R.: Feasibility analysis of the bilinear matrix inequalities with an application to multi-objective nonlinear observer design. In: CDC (2016)","DOI":"10.1109\/CDC.2016.7798758"},{"issue":"1\u20132","key":"21_CR59","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10107-010-0354-x","volume":"132","author":"H Yamashita","year":"2012","unstructured":"Yamashita, H., Yabe, H.: Local and superlinear convergence of a primal-dual interior point method for nonlinear semidefinite programming. Math. Program. 132(1\u20132), 1\u201330 (2012)","journal-title":"Math. Program."},{"issue":"1","key":"21_CR60","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2629424","volume":"14","author":"Z Yang","year":"2015","unstructured":"Yang, Z., Lin, W., Wu, M.: Exact safety verification of hybrid systems based on bilinear SOS representation. ACM TECS 14(1), 1\u201319 (2015)","journal-title":"ACM TECS"},{"key":"21_CR61","doi-asserted-by":"crossref","unstructured":"Yang, Z., et al.: A linear programming relaxation based approach for generating barrier certificates of hybrid systems. In: FM (2016)","DOI":"10.1007\/978-3-319-48989-6_44"},{"key":"21_CR62","doi-asserted-by":"crossref","unstructured":"Zeng, X., et al.: Darboux-type barrier certificates for safety verification of nonlinear hybrid systems. In: EMSOFT (2016)","DOI":"10.1145\/2968478.2968484"},{"key":"21_CR63","doi-asserted-by":"crossref","unstructured":"Zhang, Y., et al.: Safety verification of nonlinear hybrid systems based on bilinear programming. IEEE TCAD 37(11),(2018)","DOI":"10.1109\/TCAD.2018.2858383"}],"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-81685-8_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,6]],"date-time":"2023-11-06T04:58:43Z","timestamp":1699246723000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-81685-8_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030816841","9783030816858"],"references-count":63,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-81685-8_21","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)"}}]}}