{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T02:14:53Z","timestamp":1775873693674,"version":"3.50.1"},"publisher-location":"Cham","reference-count":53,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030888053","type":"print"},{"value":"9783030888060","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:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-88806-0_22","type":"book-chapter","created":{"date-parts":[[2021,10,13]],"date-time":"2021-10-13T17:25:06Z","timestamp":1634145906000},"page":"453-478","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Automatic Synthesis of Data-Flow Analyzers"],"prefix":"10.1007","author":[{"given":"Xuezheng","family":"Xu","sequence":"first","affiliation":[]},{"given":"Xudong","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Jingling","family":"Xue","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,10,13]]},"reference":[{"key":"22_CR1","unstructured":"T.j. watson libraries for analysis (wala). http:\/\/wala.sourceforge.net\/wiki, http:\/\/wala.sourceforge.net\/wiki"},{"key":"22_CR2","volume-title":"Compilers: Principles, Techniques, and Tools","author":"AV Aho","year":"2006","unstructured":"Aho, A.V., Lam, M.S., Sethi, R., Ullman, J.D.: Compilers: Principles, Techniques, and Tools, 2nd edn. Addison-Wesley Longman Publishing Co. Inc., Boston (2006)","edition":"2"},{"key":"22_CR3","doi-asserted-by":"crossref","unstructured":"Alur, R., et al.: Syntax-guided synthesis. IEEE (2013)","DOI":"10.1109\/FMCAD.2013.6679385"},{"issue":"6","key":"22_CR4","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1145\/2666356.2594299","volume":"49","author":"S Arzt","year":"2014","unstructured":"Arzt, S., et al.: FlowDroid: precise context, flow, field, object-sensitive and lifecycle-aware taint analysis for android apps. Acm Sigplan Not. 49(6), 259\u2013269 (2014)","journal-title":"Acm Sigplan Not."},{"key":"22_CR5","unstructured":"Balog, M., Gaunt, A.L., Brockschmidt, M., Nowozin, S., Tarlow, D.: DeepCoder: learning to write programs. arXiv preprint arXiv:1611.01989 (2016)"},{"key":"22_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0055923","volume-title":"Genetic Programming","author":"W Banzhaf","year":"1998","unstructured":"Banzhaf, W., Nordin, P., Keller, R.E., Francone, F.D.: Genetic Programming. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0055923"},{"issue":"6","key":"22_CR7","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1145\/2813885.2737952","volume":"50","author":"DW Barowy","year":"2015","unstructured":"Barowy, D.W., Gulwani, S., Hart, T., Zorn, B.: FlashRelate: extracting relational data from semi-structured spreadsheets using examples. ACM SIGPLAN Not. 50(6), 218\u2013228 (2015)","journal-title":"ACM SIGPLAN Not."},{"key":"22_CR8","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/978-3-319-10575-8_11","volume-title":"Handbook of Model Checking","author":"C Barrett","year":"2018","unstructured":"Barrett, C., Tinelli, C.: Satisfiability modulo theories. In: Handbook of Model Checking, pp. 305\u2013343. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-10575-8_11"},{"key":"22_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/978-3-319-63387-9_12","volume-title":"Computer Aided Verification","author":"P Bielik","year":"2017","unstructured":"Bielik, P., Raychev, V., Vechev, M.: Learning a static analyzer from data. In: Majumdar, R., Kun\u010dak, V. (eds.) CAV 2017. LNCS, vol. 10426, pp. 233\u2013253. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63387-9_12"},{"key":"22_CR10","doi-asserted-by":"publisher","unstructured":"Cai, Q., Xue, J.: Optimal and efficient speculation-based partial redundancy elimination. In: 2003 International Symposium on Code Generation and Optimization, CGO 2003, pp. 91\u2013102 (2003). https:\/\/doi.org\/10.1109\/CGO.2003.1191536","DOI":"10.1109\/CGO.2003.1191536"},{"key":"22_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/978-3-642-22110-1_20","volume-title":"Computer Aided Verification","author":"P \u010cern\u00fd","year":"2011","unstructured":"\u010cern\u00fd, P., Chatterjee, K., Henzinger, T.A., Radhakrishna, A., Singh, R.: Quantitative synthesis for concurrent programs. In: Gopalakrishnan, G., Qadeer, S. (eds.) CAV 2011. LNCS, vol. 6806, pp. 243\u2013259. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22110-1_20"},{"issue":"6","key":"22_CR12","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1145\/2499370.2462180","volume":"48","author":"A Cheung","year":"2013","unstructured":"Cheung, A., Solar-Lezama, A., Madden, S.: Optimizing database-backed applications with query synthesis. ACM SIGPLAN Not. 48(6), 3\u201314 (2013)","journal-title":"ACM SIGPLAN Not."},{"key":"22_CR13","doi-asserted-by":"crossref","unstructured":"Das, M., Lerner, S., Seigle, M.: ESP: path-sensitive program verification in polynomial time. In: Proceedings of the ACM SIGPLAN 2002 Conference on Programming Language Design and Implementation, pp. 57\u201368 (2002)","DOI":"10.1145\/512529.512538"},{"issue":"6","key":"22_CR14","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1145\/2813885.2737977","volume":"50","author":"JK Feser","year":"2015","unstructured":"Feser, J.K., Chaudhuri, S., Dillig, I.: Synthesizing data structure transformations from input-output examples. ACM SIGPLAN Not. 50(6), 229\u2013239 (2015)","journal-title":"ACM SIGPLAN Not."},{"issue":"1","key":"22_CR15","doi-asserted-by":"publisher","first-page":"802","DOI":"10.1145\/2914770.2837629","volume":"51","author":"J Frankle","year":"2016","unstructured":"Frankle, J., Osera, P.M., Walker, D., Zdancewic, S.: Example-directed synthesis: a type-theoretic interpretation. ACM SIGPLAN Not. 51(1), 802\u2013815 (2016)","journal-title":"ACM SIGPLAN Not."},{"issue":"1","key":"22_CR16","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1145\/1925844.1926423","volume":"46","author":"S Gulwani","year":"2011","unstructured":"Gulwani, S.: Automating string processing in spreadsheets using input-output examples. ACM SIGPLAN Not. 46(1), 317\u2013330 (2011)","journal-title":"ACM SIGPLAN Not."},{"issue":"137","key":"22_CR17","first-page":"3","volume":"45","author":"S Gulwani","year":"2016","unstructured":"Gulwani, S.: Programming by examples. Dependable Softw. Syst. Eng. 45(137), 3\u201315 (2016)","journal-title":"Dependable Softw. Syst. Eng."},{"key":"22_CR18","doi-asserted-by":"crossref","unstructured":"Gulwani, S., Polozov, A., Singh, R.: Program Synthesis, vol. 4, August 2017. https:\/\/www.microsoft.com\/en-us\/research\/publication\/program-synthesis\/","DOI":"10.1561\/9781680832938"},{"key":"22_CR19","doi-asserted-by":"crossref","unstructured":"Gvero, T., Kuncak, V., Kuraj, I., Piskac, R.: Complete completion using types and weights. In: Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation, pp. 27\u201338 (2013)","DOI":"10.1145\/2499370.2462192"},{"key":"22_CR20","doi-asserted-by":"crossref","unstructured":"Hallem, S., Chelf, B., Xie, Y., Engler, D.: A system and language for building system-specific, static analyses. In: Proceedings of the ACM SIGPLAN 2002 Conference on Programming Language Design and Implementation, pp. 69\u201382 (2002)","DOI":"10.1145\/543552.512539"},{"key":"22_CR21","doi-asserted-by":"crossref","unstructured":"Hardekopf, B., Lin, C.: Flow-sensitive pointer analysis for millions of lines of code. In: CGO 2011, pp. 289\u2013298 (2011)","DOI":"10.1109\/CGO.2011.5764696"},{"key":"22_CR22","doi-asserted-by":"crossref","unstructured":"He, D., et al.: Performance-boosting sparsification of the IFDS algorithm with applications to taint analysis. In: 2019 34th IEEE\/ACM International Conference on Automated Software Engineering (ASE), pp. 267\u2013279. IEEE (2019)","DOI":"10.1109\/ASE.2019.00034"},{"key":"22_CR23","doi-asserted-by":"publisher","unstructured":"He, D., Lu, J., Gao, Y., Xue, J.: Accelerating object-sensitive pointer analysis by exploiting object containment and reachability. In: M\u00f8ller, A., Sridharan, M. (eds.) 35th European Conference on Object-Oriented Programming (ECOOP 2021). Leibniz International Proceedings in Informatics (LIPIcs), vol. 194, pp. 16:1\u201316:31. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl (2021). https:\/\/doi.org\/10.4230\/LIPIcs.ECOOP.2021.16. https:\/\/drops.dagstuhl.de\/opus\/volltexte\/2021\/14059","DOI":"10.4230\/LIPIcs.ECOOP.2021.16"},{"key":"22_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-540-88387-6_5","volume-title":"Automated Technology for Verification and Analysis","author":"G Katz","year":"2008","unstructured":"Katz, G., Peled, D.: Genetic programming and model checking: synthesizing new mutual exclusion algorithms. In: Cha, S.S., Choi, J.-Y., Kim, M., Lee, I., Viswanathan, M. (eds.) ATVA 2008. LNCS, vol. 5311, pp. 33\u201347. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-88387-6_5"},{"issue":"2","key":"22_CR25","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1145\/2261417.2261438","volume":"43","author":"M Kuperstein","year":"2012","unstructured":"Kuperstein, M., Vechev, M., Yahav, E.: Automatic inference of memory fences. ACM SIGACT News 43(2), 108\u2013123 (2012)","journal-title":"ACM SIGACT News"},{"key":"22_CR26","doi-asserted-by":"crossref","unstructured":"Le, V., Gulwani, S.: FlashExtract: a framework for data extraction by examples. In: Proceedings of the 35th ACM SIGPLAN Conference on Programming Language Design and Implementation, pp. 542\u2013553 (2014)","DOI":"10.1145\/2594291.2594333"},{"issue":"10","key":"22_CR27","doi-asserted-by":"publisher","first-page":"1033","DOI":"10.1145\/2076021.2048144","volume":"46","author":"R Madhavan","year":"2011","unstructured":"Madhavan, R., Komondoor, R.: Null dereference verification via over-approximated weakest pre-conditions analysis. ACM SIGPLAN Not. 46(10), 1033\u20131052 (2011)","journal-title":"ACM SIGPLAN Not."},{"key":"22_CR28","doi-asserted-by":"crossref","unstructured":"Nguyen, H.D.T., Qi, D., Roychoudhury, A., Chandra, S.: SemFix: program repair via semantic analysis. In: 2013 35th International Conference on Software Engineering (ICSE), pp. 772\u2013781. IEEE (2013)","DOI":"10.1109\/ICSE.2013.6606623"},{"issue":"6","key":"22_CR29","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1145\/2813885.2738007","volume":"50","author":"PM Osera","year":"2015","unstructured":"Osera, P.M., Zdancewic, S.: Type-and-example-directed program synthesis. ACM SIGPLAN Not. 50(6), 619\u2013630 (2015)","journal-title":"ACM SIGPLAN Not."},{"issue":"1","key":"22_CR30","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1137\/1033004","volume":"33","author":"M Padberg","year":"1991","unstructured":"Padberg, M., Rinaldi, G.: A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems. SIAM Rev. 33(1), 60\u2013100 (1991)","journal-title":"SIAM Rev."},{"key":"22_CR31","doi-asserted-by":"crossref","unstructured":"Panchekha, P., Torlak, E.: Automated reasoning for web page layout. In: Proceedings of the 2016 ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and Applications, pp. 181\u2013194 (2016)","DOI":"10.1145\/2983990.2984010"},{"key":"22_CR32","doi-asserted-by":"crossref","unstructured":"Perelman, D., Gulwani, S., Ball, T., Grossman, D.: Type-directed completion of partial expressions. In: Proceedings of the 33rd ACM SIGPLAN Conference on Programming Language Design and Implementation, pp. 275\u2013286 (2012)","DOI":"10.1145\/2345156.2254098"},{"issue":"6","key":"22_CR33","doi-asserted-by":"publisher","first-page":"522","DOI":"10.1145\/2980983.2908093","volume":"51","author":"N Polikarpova","year":"2016","unstructured":"Polikarpova, N., Kuraj, I., Solar-Lezama, A.: Program synthesis from polymorphic refinement types. ACM SIGPLAN Not. 51(6), 522\u2013538 (2016)","journal-title":"ACM SIGPLAN Not."},{"key":"22_CR34","doi-asserted-by":"crossref","unstructured":"Polozov, O., Gulwani, S.: FlashMeta: a framework for inductive program synthesis. In: Proceedings of the 2015 ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and Applications, pp. 107\u2013126 (2015)","DOI":"10.1145\/2814270.2814310"},{"key":"22_CR35","doi-asserted-by":"crossref","unstructured":"Raychev, V., Vechev, M., Yahav, E.: Code completion with statistical language models. In: Proceedings of the 35th ACM SIGPLAN Conference on Programming Language Design and Implementation, pp. 419\u2013428 (2014)","DOI":"10.1145\/2594291.2594321"},{"key":"22_CR36","doi-asserted-by":"crossref","unstructured":"Reps, T., Horwitz, S., Sagiv, M.: Precise interprocedural dataflow analysis via graph reachability. In: Proceedings of the 22nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 49\u201361 (1995)","DOI":"10.1145\/199448.199462"},{"issue":"1\u20132","key":"22_CR37","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0304-3975(96)00072-2","volume":"167","author":"M Sagiv","year":"1996","unstructured":"Sagiv, M., Reps, T., Horwitz, S.: Precise interprocedural dataflow analysis with applications to constant propagation. Theor. Comput. Sci. 167(1\u20132), 131\u2013170 (1996)","journal-title":"Theor. Comput. Sci."},{"key":"22_CR38","doi-asserted-by":"crossref","unstructured":"Si, X., Lee, W., Zhang, R., Albarghouthi, A., Koutris, P., Naik, M.: Syntax-guided synthesis of datalog programs. In: Proceedings of the 2018 26th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering, pp. 515\u2013527 (2018)","DOI":"10.1145\/3236024.3236034"},{"key":"22_CR39","doi-asserted-by":"crossref","unstructured":"Singh, R., Gulwani, S., Solar-Lezama, A.: Automated feedback generation for introductory programming assignments. In: Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation, pp. 15\u201326 (2013)","DOI":"10.1145\/2499370.2462195"},{"key":"22_CR40","doi-asserted-by":"publisher","unstructured":"Smaragdakis, Y., Bravenboer, M., Lhot\u00e1k, O.: Pick your contexts well: understanding object-sensitivity. In: Proceedings of the 38th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2011, pp. 17\u201330. Association for Computing Machinery, New York (2011). https:\/\/doi.org\/10.1145\/1926385.1926390","DOI":"10.1145\/1926385.1926390"},{"key":"22_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/978-3-030-11245-5_2","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"C Smith","year":"2019","unstructured":"Smith, C., Albarghouthi, A.: Program synthesis with equivalence reduction. In: Enea, C., Piskac, R. (eds.) VMCAI 2019. LNCS, vol. 11388, pp. 24\u201347. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-11245-5_2"},{"key":"22_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/978-3-319-66706-5_18","volume-title":"Static Analysis","author":"S So","year":"2017","unstructured":"So, S., Oh, H.: Synthesizing imperative programs from examples guided by static analysis. In: Ranzato, F. (ed.) SAS 2017. LNCS, vol. 10422, pp. 364\u2013381. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-66706-5_18"},{"key":"22_CR43","doi-asserted-by":"crossref","unstructured":"Solar-Lezama, A., Bodik, R.: Program synthesis by sketching. Citeseer (2008)","DOI":"10.1145\/1250734.1250754"},{"key":"22_CR44","doi-asserted-by":"crossref","unstructured":"Sui, Y., Xue, J.: SVF: interprocedural static value-flow analysis in LLVM. In: Proceedings of the 25th International Conference on Compiler Construction, pp. 265\u2013266. ACM, New York (2016)","DOI":"10.1145\/2892208.2892235"},{"key":"22_CR45","doi-asserted-by":"publisher","unstructured":"Tan, T., Li, Y., Xue, J.: Efficient and precise points-to analysis: modeling the heap by merging equivalent automata. In: Proceedings of the 38th ACM SIGPLAN Conference on Programming Language Design and Implementation, pp. 278\u2013291. Association for Computing Machinery, New York (2017). https:\/\/doi.org\/10.1145\/3140587.3062360","DOI":"10.1145\/3140587.3062360"},{"key":"22_CR46","doi-asserted-by":"publisher","unstructured":"Thiessen, R., Lhot\u00e1k, O.: Context transformations for pointer analysis. In: Proceedings of the 38th ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2017, pp. 263\u2013277. Association for Computing Machinery, New York (2017). https:\/\/doi.org\/10.1145\/3062341.3062359","DOI":"10.1145\/3062341.3062359"},{"issue":"6","key":"22_CR47","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1145\/1543135.1542486","volume":"44","author":"O Tripp","year":"2009","unstructured":"Tripp, O., Pistoia, M., Fink, S.J., Sridharan, M., Weisman, O.: Taj: effective taint analysis of web applications. ACM SIGPLAN Not. 44(6), 87\u201397 (2009)","journal-title":"ACM SIGPLAN Not."},{"key":"22_CR48","doi-asserted-by":"crossref","unstructured":"Vall\u00e9e-Rai, R. Co, P., Gagnon, E., Hendren, L., Lam, P., Sundaresan, V.: Soot: a Java bytecode optimization framework. In: CASCON 2010, p. 13 (2010)","DOI":"10.1145\/1925805.1925818"},{"key":"22_CR49","doi-asserted-by":"crossref","unstructured":"Vechev, M., Yahav, E., Yorsh, G.: Abstraction-guided synthesis of synchronization. In: Proceedings of the 37th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 327\u2013338 (2010)","DOI":"10.1145\/1707801.1706338"},{"key":"22_CR50","doi-asserted-by":"crossref","unstructured":"Wassermann, G., Su, Z.: Static detection of cross-site scripting vulnerabilities. In: 2008 ACM\/IEEE 30th International Conference on Software Engineering, pp. 171\u2013180. IEEE (2008)","DOI":"10.1145\/1368088.1368112"},{"key":"22_CR51","doi-asserted-by":"publisher","unstructured":"Xu, X., Sui, Y., Yan, H., Xue, J.: VFix: value-flow-guided precise program repair for null pointer dereferences. In: 2019 IEEE\/ACM 41st International Conference on Software Engineering (ICSE), pp. 512\u2013523 (2019). https:\/\/doi.org\/10.1109\/ICSE.2019.00063","DOI":"10.1109\/ICSE.2019.00063"},{"issue":"2","key":"22_CR52","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1145\/1138035.1138036","volume":"3","author":"J Xue","year":"2006","unstructured":"Xue, J., Cai, Q.: A lifetime optimal algorithm for speculative PRE. ACM Trans. Arch. Code Optim. 3(2), 115\u2013155 (2006). https:\/\/doi.org\/10.1145\/1138035.1138036","journal-title":"ACM Trans. Arch. Code Optim."},{"key":"22_CR53","doi-asserted-by":"crossref","unstructured":"Zhang, H., Jain, A., Khandelwal, G., Kaushik, C., Ge, S., Hu, W.: Bing developer assistant: improving developer productivity by recommending sample code. In: Proceedings of the 2016 24th ACM SIGSOFT International Symposium on Foundations of Software Engineering, pp. 956\u2013961 (2016)","DOI":"10.1145\/2950290.2983955"}],"container-title":["Lecture Notes in Computer Science","Static Analysis"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-88806-0_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,12]],"date-time":"2023-01-12T02:41:15Z","timestamp":1673491275000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-88806-0_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030888053","9783030888060"],"references-count":53,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-88806-0_22","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":"13 October 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Static Analysis Symposium","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chicago, IL","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 October 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 October 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sas2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/staticanalysis.org\/","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":"40","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":"18","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":"4","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":"45% - 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":"6","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)"}}]}}