{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T02:56:21Z","timestamp":1742957781140,"version":"3.40.3"},"publisher-location":"Cham","reference-count":39,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031191343"},{"type":"electronic","value":"9783031191350"}],"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-031-19135-0_1","type":"book-chapter","created":{"date-parts":[[2022,10,11]],"date-time":"2022-10-11T23:03:49Z","timestamp":1665529429000},"page":"3-27","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["SAT-Based Invariant Inference and\u00a0Its Relation to\u00a0Concept Learning"],"prefix":"10.1007","author":[{"given":"Yotam M. Y.","family":"Feldman","sequence":"first","affiliation":[]},{"given":"Sharon","family":"Shoham","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,10,12]]},"reference":[{"key":"1_CR1","doi-asserted-by":"publisher","unstructured":"Aizenstein, H., Pitt, L.: On the learnability of disjunctive normal form formulas. Mach. Learn. 19(3), 183\u2013208 (1995). https:\/\/doi.org\/10.1007\/BF00996269","DOI":"10.1007\/BF00996269"},{"issue":"4","key":"1_CR2","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/BF00116828","volume":"2","author":"D Angluin","year":"1987","unstructured":"Angluin, D.: Queries and concept learning. Mach. Learn. 2(4), 319\u2013342 (1987)","journal-title":"Mach. Learn."},{"key":"1_CR3","unstructured":"Bj\u00f8rner, N., Gurfinkel, A., Korovin, K., Lahav, O.: Instantiations, zippers and EPR interpolation. In: LPAR 2013, 19th International Conference on Logic for Programming, Artificial Intelligence and Reasoning, December 12\u201317, 2013, Stellenbosch, South Africa, Short papers proceedings, pp. 35\u201341 (2013). https:\/\/easychair.org\/publications\/paper\/XtN"},{"key":"1_CR4","doi-asserted-by":"publisher","unstructured":"Bradley, A.R.: Sat-based model checking without unrolling. In: Verification, Model Checking, and Abstract Interpretation - 12th International Conference, VMCAI 2011, Austin, TX, USA, 23\u201325 January 2011. Proceedings, pp. 70\u201387 (2011). https:\/\/doi.org\/10.1007\/978-3-642-18275-4_7","DOI":"10.1007\/978-3-642-18275-4_7"},{"key":"1_CR5","doi-asserted-by":"publisher","unstructured":"Bshouty, N.H.: Exact learning Boolean function via the monotone theory. Inf. Comput. 123(1), 146\u2013153 (1995). https:\/\/doi.org\/10.1006\/inco.1995.1164","DOI":"10.1006\/inco.1995.1164"},{"key":"1_CR6","doi-asserted-by":"publisher","unstructured":"Bshouty, N.H.: Simple learning algorithms using divide and conquer. Comput. Complex. 6(2), 174\u2013194 (1997). https:\/\/doi.org\/10.1007\/BF01262930","DOI":"10.1007\/BF01262930"},{"key":"1_CR7","doi-asserted-by":"publisher","unstructured":"Chockler, H., Ivrii, A., Matsliah, A.: Computing interpolants without proofs. In: Hardware and Software: Verification and Testing - 8th International Haifa Verification Conference, HVC 2012, Haifa, Israel, 6\u20138 November 2012. Revised Selected Papers, pp. 72\u201385 (2012). https:\/\/doi.org\/10.1007\/978-3-642-39611-3_12","DOI":"10.1007\/978-3-642-39611-3_12"},{"key":"1_CR8","unstructured":"E\u00e9n, N., Mishchenko, A., Brayton, R.K.: Efficient implementation of property directed reachability. In: International Conference on Formal Methods in Computer-Aided Design, FMCAD 2011, Austin, TX, USA, October 30\u2013November 02 2011, pp. 125\u2013134 (2011). http:\/\/dl.acm.org\/citation.cfm?id=2157675"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"Ezudheen, P., Neider, D., D\u2019Souza, D., Garg, P., Madhusudan, P.: Horn-ice learning for synthesizing invariants and contracts. In: PACMPL 2 (OOPSLA), pp. 131:1\u2013131:25 (2018)","DOI":"10.1145\/3276501"},{"key":"1_CR10","doi-asserted-by":"publisher","unstructured":"Feldman, Y.M.Y., Immerman, N., Sagiv, M., Shoham, S.: Complexity and information in invariant inference. In: Proceedings of the ACM Programming Languages, vol. 4 (POPL), pp. 5:1\u20135:29 (2020). https:\/\/doi.org\/10.1145\/3371073, https:\/\/doi.org\/10.1145\/3371073","DOI":"10.1145\/3371073 10.1145\/3371073"},{"key":"1_CR11","doi-asserted-by":"publisher","unstructured":"Feldman, Y.M.Y., Sagiv, M., Shoham, S., Wilcox, J.R.: Learning the boundary of inductive invariants. In: Proceedings of the ACM Programming Languages, vol. 5 (POPL), pp. 1\u201330 (2021). https:\/\/doi.org\/10.1145\/3434296, https:\/\/doi.org\/10.1145\/3434296","DOI":"10.1145\/3434296 10.1145\/3434296"},{"key":"1_CR12","doi-asserted-by":"publisher","unstructured":"Feldman, Y.M.Y., Sagiv, M., Shoham, S., Wilcox, J.R.: Property-directed reachability as abstract interpretation in the monotone theory. In: Proceedings of the ACM Programming Languages, vol. 6 (POPL), pp. 1\u201331 (2022). https:\/\/doi.org\/10.1145\/3498676, https:\/\/doi.org\/10.1145\/3498676","DOI":"10.1145\/3498676 10.1145\/3498676"},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Feldman, Y.M.Y., Shoham, S.: Invariant inference with provable complexity from the monotone theory. In: Static Analysis - 29th International Symposium, SAS 2022, Auckland, New Zealand (To appear in 2022)","DOI":"10.1007\/978-3-031-22308-2_10"},{"key":"1_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1007\/3-540-45251-6_29","volume-title":"FME 2001: Formal Methods for Increasing Software Productivity","author":"C Flanagan","year":"2001","unstructured":"Flanagan, C., Leino, K.R.M.: Houdini, an annotation assistant for ESC\/Java. In: Oliveira, J.N., Zave, P. (eds.) FME 2001. LNCS, vol. 2021, pp. 500\u2013517. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45251-6_29"},{"key":"1_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/978-3-319-08867-9_5","volume-title":"Computer Aided Verification","author":"P Garg","year":"2014","unstructured":"Garg, P., L\u00f6ding, C., Madhusudan, P., Neider, D.: ICE:\u00a0A\u00a0robust\u00a0framework\u00a0for\u00a0learning\u00a0invariants. In: Biere, A., Bloem, R. (eds.) CAV 2014. LNCS, vol. 8559, pp. 69\u201387. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-08867-9_5"},{"key":"1_CR16","doi-asserted-by":"publisher","unstructured":"Garg, P., Neider, D., Madhusudan, P., Roth, D.: Learning invariants using decision trees and implication counterexamples. In: Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2016, St. Petersburg, FL, USA, 20\u201322 January 2016, pp. 499\u2013512 (2016). https:\/\/doi.org\/10.1145\/2837614.2837664, https:\/\/doi.org\/10.1145\/2837614.2837664","DOI":"10.1145\/2837614.2837664 10.1145\/2837614.2837664"},{"key":"1_CR17","unstructured":"Hellerstein, L., Kletenik, D., Sellie, L., Servedio, R.A.: Tight bounds on proper equivalence query learning of DNF. In: COLT 2012 - The 25th Annual Conference on Learning Theory, 25\u201327 June 2012, Edinburgh, Scotland, pp. 31.1-31.18 (2012). http:\/\/proceedings.mlr.press\/v23\/hellerstein12\/hellerstein12.pdf"},{"key":"1_CR18","doi-asserted-by":"publisher","unstructured":"Henzinger, T.A., Jhala, R., Majumdar, R., McMillan, K.L.: Abstractions from proofs. In: Proceedings of the 31st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2004, Venice, Italy, 14\u201316 January 2004, pp. 232\u2013244 (2004). https:\/\/doi.org\/10.1145\/964001.964021, https:\/\/doi.org\/10.1145\/964001.964021","DOI":"10.1145\/964001.964021 10.1145\/964001.964021"},{"key":"1_CR19","doi-asserted-by":"publisher","unstructured":"Itzhaky, S., Bj\u00f8rner, N., Reps, T.W., Sagiv, M., Thakur, A.V.: Property-directed shape analysis. In: Computer Aided Verification - 26th International Conference, CAV 2014, Held as Part of the Vienna Summer of Logic, VSL 2014, Vienna, Austria, 18\u201322 July 2014. Proceedings, pp. 35\u201351 (2014). https:\/\/doi.org\/10.1007\/978-3-319-08867-9_3","DOI":"10.1007\/978-3-319-08867-9_3"},{"key":"1_CR20","doi-asserted-by":"publisher","unstructured":"Jha, S., Gulwani, S., Seshia, S.A., Tiwari, A.: Oracle-guided component-based program synthesis. In: Proceedings of the 32nd ACM\/IEEE International Conference on Software Engineering - Volume 1, ICSE 2010, Cape Town, South Africa, 1\u20138 May 2010, pp. 215\u2013224 (2010). https:\/\/doi.org\/10.1145\/1806799.1806833, https:\/\/doi.org\/10.1145\/1806799.1806833","DOI":"10.1145\/1806799.1806833 10.1145\/1806799.1806833"},{"issue":"7","key":"1_CR21","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1007\/s00236-017-0294-5","volume":"54","author":"S Jha","year":"2017","unstructured":"Jha, S., Seshia, S.A.: A theory of formal synthesis via inductive learning. Acta Inform. 54(7), 693\u2013726 (2017). https:\/\/doi.org\/10.1007\/s00236-017-0294-5","journal-title":"Acta Inform."},{"key":"1_CR22","doi-asserted-by":"publisher","unstructured":"Jhala, R., McMillan, K.L.: Interpolant-based transition relation approximation. Logical Methods Comput. Sci. 3(4) (2007). https:\/\/doi.org\/10.2168\/LMCS-3(4:1)2007","DOI":"10.2168\/LMCS-3(4:1)2007"},{"key":"1_CR23","doi-asserted-by":"publisher","unstructured":"Koenig, J.R., Padon, O., Immerman, N., Aiken, A.: First-order quantified separators. In: Donaldson, A.F., Torlak, E. (eds.) Proceedings of the 41st ACM SIGPLAN International Conference on Programming Language Design and Implementation, PLDI 2020, London, UK, 15\u201320 June 2020, pp. 703\u2013717. ACM (2020). https:\/\/doi.org\/10.1145\/3385412.3386018","DOI":"10.1145\/3385412.3386018"},{"key":"1_CR24","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1007\/978-3-642-02959-2_18","volume-title":"Automated Deduction \u2013 CADE-22","author":"SK Lahiri","year":"2009","unstructured":"Lahiri, S.K., Qadeer, S.: Complexity and algorithms for monomial and clausal predicate abstraction. In: Schmidt, R.A. (ed.) CADE 2009. LNCS (LNAI), vol. 5663, pp. 214\u2013229. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02959-2_18"},{"key":"1_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-45069-6_1","volume-title":"Computer Aided Verification","author":"KL McMillan","year":"2003","unstructured":"McMillan, K.L.: Interpolation and SAT-based model checking. In: Hunt, W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol. 2725, pp. 1\u201313. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45069-6_1"},{"key":"1_CR26","doi-asserted-by":"publisher","unstructured":"McMillan, K.L.: Lazy abstraction with interpolants. In: 18th International Conference on Computer Aided Verification, CAV 2006, Seattle, WA, USA, 17\u201320 August 2006, Proceedings, pp. 123\u2013136 (2006). https:\/\/doi.org\/10.1007\/11817963_14","DOI":"10.1007\/11817963_14"},{"issue":"7","key":"1_CR27","doi-asserted-by":"publisher","first-page":"1523","DOI":"10.1007\/s10817-020-09570-z","volume":"64","author":"D Neider","year":"2020","unstructured":"Neider, D., Madhusudan, P., Saha, S., Garg, P., Park, D.: A learning-based approach to synthesizing invariants for incomplete verification engines. J. Autom. Reason. 64(7), 1523\u20131552 (2020). https:\/\/doi.org\/10.1007\/s10817-020-09570-z","journal-title":"J. Autom. Reason."},{"key":"1_CR28","unstructured":"O\u2019Donnell, R.: Analysis of Boolean Functions. Cambridge University Press, Cambridge (2014). http:\/\/www.cambridge.org\/de\/academic\/subjects\/computer-science\/algorithmics-complexity-computer-algebra-and-computational-g\/analysis-boolean-functions"},{"issue":"1\u20132","key":"1_CR29","first-page":"64","volume":"10","author":"W Quine","year":"1954","unstructured":"Quine, W.: Two theorems about truth-functions. Bolet\u00edn de la Sociedad Matem\u00e1tica Mexicana 10(1\u20132), 64\u201370 (1954)","journal-title":"Bolet\u00edn de la Sociedad Matem\u00e1tica Mexicana"},{"key":"1_CR30","doi-asserted-by":"publisher","unstructured":"Reps, T.W., Sagiv, S., Yorsh, G.: Symbolic implementation of the best transformer. In: Verification, Model Checking, and Abstract Interpretation, 5th International Conference, VMCAI 2004, Venice, Italy, 11\u201313 January 2004, Proceedings, pp. 252\u2013266 (2004). https:\/\/doi.org\/10.1007\/978-3-540-24622-0_21","DOI":"10.1007\/978-3-540-24622-0_21"},{"issue":"3","key":"1_CR31","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s10703-016-0248-5","volume":"48","author":"R Sharma","year":"2016","unstructured":"Sharma, R., Aiken, A.: From invariant checking to invariant inference using randomized search. Formal Methods Syst. Des. 48(3), 235\u2013256 (2016). https:\/\/doi.org\/10.1007\/s10703-016-0248-5","journal-title":"Formal Methods Syst. Des."},{"key":"1_CR32","doi-asserted-by":"publisher","unstructured":"Sharma, R., Gupta, S., Hariharan, B., Aiken, A., Liang, P., Nori, A.V.: A data driven approach for algebraic loop invariants. In: Programming Languages and Systems - 22nd European Symposium on Programming, ESOP 2013, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2013, Rome, Italy, March 16\u201324, 2013. Proceedings, pp. 574\u2013592 (2013). https:\/\/doi.org\/10.1007\/978-3-642-37036-6_31","DOI":"10.1007\/978-3-642-37036-6_31"},{"key":"1_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1007\/978-3-642-38856-9_21","volume-title":"Static Analysis","author":"R Sharma","year":"2013","unstructured":"Sharma, R., Gupta, S., Hariharan, B., Aiken, A., Nori, A.V.: Verification as learning geometric concepts. In: Logozzo, F., F\u00e4hndrich, M. (eds.) SAS 2013. LNCS, vol. 7935, pp. 388\u2013411. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38856-9_21"},{"key":"1_CR34","doi-asserted-by":"publisher","unstructured":"Sharma, R., Nori, A.V., Aiken, A.: Interpolants as classifiers. In: Computer Aided Verification - 24th International Conference, CAV 2012, Berkeley, CA, USA, 7\u201313 July 2012 Proceedings, pp. 71\u201387 (2012). https:\/\/doi.org\/10.1007\/978-3-642-31424-7_11","DOI":"10.1007\/978-3-642-31424-7_11"},{"key":"1_CR35","doi-asserted-by":"publisher","unstructured":"Thakur, A.V., Lal, A., Lim, J., Reps, T.W.: Posthat and all that: automating abstract interpretation. Electr. Notes Theor. Comput. Sci. 311, 15\u201332 (2015). https:\/\/doi.org\/10.1016\/j.entcs.2015.02.003","DOI":"10.1016\/j.entcs.2015.02.003"},{"key":"1_CR36","doi-asserted-by":"publisher","unstructured":"Valiant, L.G.: A theory of the learnable. Commun. ACM 27(11), 1134\u20131142 (1984). https:\/\/doi.org\/10.1145\/1968.1972, https:\/\/doi.org\/10.1145\/1968.1972","DOI":"10.1145\/1968.1972 10.1145\/1968.1972"},{"key":"1_CR37","doi-asserted-by":"publisher","unstructured":"Vizel, Y., Grumberg, O.: Interpolation-sequence based model checking. In: Proceedings of 9th International Conference on Formal Methods in Computer-Aided Design, FMCAD 2009, 15\u201318 November 2009, Austin, Texas, USA, pp. 1\u20138 (2009). https:\/\/doi.org\/10.1109\/FMCAD.2009.5351148","DOI":"10.1109\/FMCAD.2009.5351148"},{"key":"1_CR38","doi-asserted-by":"publisher","unstructured":"Vizel, Y., Grumberg, O., Shoham, S.: Intertwined forward-backward reachability analysis using interpolants. In: Tools and Algorithms for the Construction and Analysis of Systems - 19th International Conference, TACAS 2013, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2013, Rome, Italy, 16\u201324 March 2013. Proceedings, pp. 308\u2013323 (2013). https:\/\/doi.org\/10.1007\/978-3-642-36742-7_22","DOI":"10.1007\/978-3-642-36742-7_22"},{"key":"1_CR39","doi-asserted-by":"crossref","unstructured":"Vizel, Y., Gurfinkel, A., Shoham, S., Malik, S.: IC3 - flipping the E in ICE. In: 18th International Conference on Verification, Model Checking, and Abstract Interpretation - VMCAI 2017, Paris, France, 15\u201317 January 2017, Proceedings, pp. 521\u2013538 (2017)","DOI":"10.1007\/978-3-319-52234-0_28"}],"container-title":["Lecture Notes in Computer Science","Reachability Problems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-19135-0_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,7]],"date-time":"2023-03-07T22:56:22Z","timestamp":1678229782000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-19135-0_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031191343","9783031191350"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-19135-0_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"12 October 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"RP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Reachability Problems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kaiserslautern","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 October 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 October 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"rp2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/rp2022.mpi-sws.org\/","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":"14","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":"8","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":"57% - 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":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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3 invited talks 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)"}}]}}