{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T10:10:50Z","timestamp":1777889450603,"version":"3.51.4"},"publisher-location":"Cham","reference-count":69,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030449131","type":"print"},{"value":"9783030449148","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2020,4,18]],"date-time":"2020-04-18T00:00:00Z","timestamp":1587168000000},"content-version":"vor","delay-in-days":108,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Interprocedural data-flow analyses form an expressive and useful paradigm of numerous static analysis applications, such as live variables analysis, alias analysis and null pointers analysis. The most widely-used framework for interprocedural data-flow analysis is <jats:italic>IFDS<\/jats:italic>, which encompasses distributive data-flow functions over a finite domain. <jats:italic>On-demand<\/jats:italic> data-flow analyses restrict the focus of the analysis on specific program locations and data facts. This setting provides a natural split between (i)\u00a0an <jats:italic>offline (or preprocessing) phase<\/jats:italic>, where the program is partially analyzed and analysis summaries are created, and (ii)\u00a0an <jats:italic>online (or query) phase<\/jats:italic>, where analysis queries arrive on demand and the summaries are used to speed up answering queries.<\/jats:p><jats:p>In this work, we consider on-demand IFDS analyses where the queries concern program locations of the same procedure (aka same-context queries). We exploit the fact that flow graphs of programs have low treewidth to develop faster algorithms that are <jats:italic>space and time optimal<\/jats:italic> for many common data-flow analyses, in both the preprocessing and the query phase. We also use treewidth to develop query solutions that are <jats:italic>embarrassingly parallelizable<\/jats:italic>, i.e.\u00a0the total work for answering each query is split to a number of threads such that each thread performs only a constant amount of work. Finally, we implement a static analyzer based on our algorithms, and perform a series of on-demand analysis experiments on standard benchmarks. Our experimental results show a drastic speed-up of the queries after only a lightweight preprocessing phase, which significantly outperforms existing techniques.<\/jats:p>","DOI":"10.1007\/978-3-030-44914-8_5","type":"book-chapter","created":{"date-parts":[[2020,4,17]],"date-time":"2020-04-17T10:02:53Z","timestamp":1587117773000},"page":"112-140","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Optimal and Perfectly Parallel Algorithms for On-demand Data-Flow Analysis"],"prefix":"10.1007","author":[{"given":"Krishnendu","family":"Chatterjee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amir Kafshdar","family":"Goharshady","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rasmus","family":"Ibsen-Jensen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andreas","family":"Pavlogiannis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,4,18]]},"reference":[{"key":"5_CR1","unstructured":"T. J. Watson libraries for analysis (WALA). https:\/\/github.com\/wala\/WALA (2003)"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Appel, A.W., Palsberg, J.: Modern Compiler Implementation in Java. Cambridge University Press, 2nd edn. (2003)","DOI":"10.1017\/CBO9780511811432"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Arzt, S., Rasthofer, S., Fritz, C., Bodden, E., Bartel, A., Klein, J., Le Traon, Y., Octeau, D., McDaniel, P.: FlowDroid: Precise context, flow, field, object-sensitive and lifecycle-aware taint analysis for android apps. In: PLDI. pp. 259\u2013269 (2014)","DOI":"10.1145\/2666356.2594299"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Babich, W.A., Jazayeri, M.: The method of attributes for data flow analysis. Acta Informatica 10(3) (1978)","DOI":"10.1007\/BF00264319"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Bebenita, M., Brandner, F., Fahndrich, M., Logozzo, F., Schulte, W., Tillmann, N., Venter, H.: Spur: A trace-based JIT compiler for CIL. In: OOPSLA. pp. 708\u2013725 (2010)","DOI":"10.1145\/1932682.1869517"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Blackburn, S.M., Garner, R., Hoffman, C., Khan, A.M., McKinley, K.S., Bentzur, R., Diwan, A., Feinberg, D., Frampton, D., Guyer, S.Z., Hirzel, M., Hosking, A., Jump, M., Lee, H., Moss, J.E.B., Phansalkar, A., Stefanovi\u0107, D., VanDrunen, T., von Dincklage, D., Wiedermann, B.: The DaCapo benchmarks: Java benchmarking development and analysis. In: OOPSLA. pp. 169\u2013190 (2006)","DOI":"10.1145\/1167515.1167488"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Bodden, E.: Inter-procedural data-flow analysis with IFDS\/IDE and soot. In: SOAP. pp. 3\u20138 (2012)","DOI":"10.1145\/2259051.2259052"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Bodden, E., Tol\u00eado, T., Ribeiro, M., Brabrand, C., Borba, P., Mezini, M.: Spllift: Statically analyzing software product lines in minutes instead of years. In: PLDI. pp. 355\u2013364 (2013)","DOI":"10.1145\/2499370.2491976"},{"key":"5_CR9","unstructured":"Bodlaender, H., Gustedt, J., Telle, J.A.: Linear-time register allocation for a fixed number of registers. In: SODA (1998)"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Bodlaender, H.L.: A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM Journal on computing 25(6), 1305\u20131317 (1996)","DOI":"10.1137\/S0097539793251219"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Bodlaender, H.L., Hagerup, T.: Parallel algorithms with optimal speedup for bounded treewidth. SIAM Journal on Computing 27(6), 1725\u20131746 (1998)","DOI":"10.1137\/S0097539795289859"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Burgstaller, B., Blieberger, J., Scholz, B.: On the tree width of ada programs. In: Ada-Europe. pp. 78\u201390 (2004)","DOI":"10.1007\/978-3-540-24841-5_6"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Callahan, D., Cooper, K.D., Kennedy, K., Torczon, L.: Interprocedural constant propagation. In: CC (1986)","DOI":"10.1145\/12276.13327"},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"Chatterjee, K., Choudhary, B., Pavlogiannis, A.: Optimal dyck reachability for data-dependence and alias analysis. In: POPL. pp. 30:1\u201330:30 (2017)","DOI":"10.1145\/3158118"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Chatterjee, K., Goharshady, A., Goharshady, E.: The treewidth of smart contracts. In: SAC (2019)","DOI":"10.1145\/3297280.3297322"},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"Chatterjee, K., Goharshady, A.K., Goyal, P., Ibsen-Jensen, R., Pavlogiannis, A.: Faster algorithms for dynamic algebraic queries in basic RSMs with constant treewidth. ACM Transactions on Programming Languages and Systems 41(4), 1\u201346 (2019)","DOI":"10.1145\/3363525"},{"key":"5_CR17","doi-asserted-by":"crossref","unstructured":"Chatterjee, K., Goharshady, A.K., Ibsen-Jensen, R., Pavlogiannis, A.: Optimal and perfectly parallel algorithms for on-demand data-flow analysis. arXiv preprint 2001.11070 (2020)","DOI":"10.1007\/978-3-030-44914-8_5"},{"key":"5_CR18","doi-asserted-by":"crossref","unstructured":"Chatterjee, K., Goharshady, A.K., Okati, N., Pavlogiannis, A.: Efficient parameterized algorithms for data packing. In: POPL. pp. 1\u201328 (2019)","DOI":"10.1145\/3290366"},{"key":"5_CR19","doi-asserted-by":"crossref","unstructured":"Chatterjee, K., Goharshady, A.K., Pavlogiannis, A.: JTDec: A tool for tree decompositions in soot. In: ATVA. pp. 59\u201366 (2017)","DOI":"10.1007\/978-3-319-68167-2_4"},{"key":"5_CR20","doi-asserted-by":"crossref","unstructured":"Chatterjee, K., Ibsen-Jensen, R., Goharshady, A.K., Pavlogiannis, A.: Algorithms for algebraic path properties in concurrent systems of constant treewidth components. ACM Transactions on Programming Langauges and Systems 40(3), 9 (2018)","DOI":"10.1145\/3210257"},{"key":"5_CR21","unstructured":"Chatterjee, K., Ibsen-Jensen, R., Pavlogiannis, A.: Optimal reachability and a space-time tradeoff for distance queries in constant-treewidth graphs. In: ESA (2016)"},{"key":"5_CR22","doi-asserted-by":"crossref","unstructured":"Chaudhuri, S., Zaroliagis, C.D.: Shortest paths in digraphs of small treewidth. Part i: Sequential algorithms. Algorithmica 27(3-4), 212\u2013226 (2000)","DOI":"10.1007\/s004530010016"},{"key":"5_CR23","doi-asserted-by":"crossref","unstructured":"Chaudhuri, S.: Subcubic algorithms for recursive state machines. In: POPL (2008)","DOI":"10.1145\/1328438.1328460"},{"key":"5_CR24","doi-asserted-by":"crossref","unstructured":"Chen, T., Lin, J., Dai, X., Hsu, W.C., Yew, P.C.: Data dependence profiling for speculative optimizations. In: CC. pp. 57\u201372 (2004)","DOI":"10.1007\/978-3-540-24723-4_5"},{"key":"5_CR25","doi-asserted-by":"crossref","unstructured":"Cousot, P., Cousot, R.: Static determination of dynamic properties of recursive procedures. In: IFIP Conference on Formal Description of Programming Concepts (1977)","DOI":"10.1145\/800022.808314"},{"key":"5_CR26","doi-asserted-by":"crossref","unstructured":"Cygan, M., Fomin, F.V., Kowalik, \u0141., Lokshtanov, D., Marx, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S.: Parameterized algorithms, vol.\u00a04 (2015)","DOI":"10.1007\/978-3-319-21275-3"},{"key":"5_CR27","doi-asserted-by":"crossref","unstructured":"Duesterwald, E., Gupta, R., Soffa, M.L.: Demand-driven computation of interprocedural data flow. POPL (1995)","DOI":"10.1145\/199448.199461"},{"key":"5_CR28","unstructured":"Dutta, S.: Anatomy of a compiler. Circuit Cellar 121, 30\u201335 (2000)"},{"key":"5_CR29","doi-asserted-by":"crossref","unstructured":"Fl\u00fcckiger, O., Scherer, G., Yee, M.H., Goel, A., Ahmed, A., Vitek, J.: Correctness of speculative optimizations with dynamic deoptimization. In: POPL. pp. 49:1\u201349:28 (2017)","DOI":"10.1145\/3158137"},{"key":"5_CR30","doi-asserted-by":"crossref","unstructured":"Giegerich, R., M\u00f6ncke, U., Wilhelm, R.: Invariance of approximate semantics with respect to program transformations. In: ECI (1981)","DOI":"10.1007\/978-3-662-01089-1_1"},{"key":"5_CR31","unstructured":"Gould, C., Su, Z., Devanbu, P.: Jdbc checker: A static analysis tool for SQL\/JDBC applications. In: ICSE. pp. 697\u2013698 (2004)"},{"key":"5_CR32","doi-asserted-by":"crossref","unstructured":"Grove, D., Torczon, L.: Interprocedural constant propagation: A study of jump function implementation. In: PLDI (1993)","DOI":"10.1145\/155090.155099"},{"key":"5_CR33","doi-asserted-by":"crossref","unstructured":"Guarnieri, S., Pistoia, M., Tripp, O., Dolby, J., Teilhet, S., Berg, R.: Saving the world wide web from vulnerable javascript. In: ISSTA. pp. 177\u2013187 (2011)","DOI":"10.1145\/2001420.2001442"},{"key":"5_CR34","doi-asserted-by":"crossref","unstructured":"Gustedt, J., M\u00e6hle, O.A., Telle, J.A.: The treewidth of java programs. In: ALENEX. pp. 86\u201397 (2002)","DOI":"10.1007\/3-540-45643-0_7"},{"key":"5_CR35","doi-asserted-by":"crossref","unstructured":"Harel, D., Tarjan, R.E.: Fast algorithms for finding nearest common ancestors. SIAM Journal on Computing 13(2), 338\u2013355 (1984)","DOI":"10.1137\/0213024"},{"key":"5_CR36","doi-asserted-by":"crossref","unstructured":"Horwitz, S., Reps, T., Sagiv, M.: Demand interprocedural dataflow analysis. ACM SIGSOFT Software Engineering Notes (1995)","DOI":"10.1145\/222124.222146"},{"key":"5_CR37","doi-asserted-by":"crossref","unstructured":"Hovemeyer, D., Pugh, W.: Finding bugs is easy. ACM SIGPLAN Notices 39(12), 92\u2013106 (Dec 2004)","DOI":"10.1145\/1052883.1052895"},{"key":"5_CR38","doi-asserted-by":"crossref","unstructured":"Klaus Krause, P., Larisch, L., Salfelder, F.: The tree-width of C. Discrete Applied Mathematics (03 2019)","DOI":"10.1016\/j.dam.2019.01.027"},{"key":"5_CR39","doi-asserted-by":"crossref","unstructured":"Knoop, J., Steffen, B.: The interprocedural coincidence theorem. In: CC (1992)","DOI":"10.1007\/3-540-55984-1_13"},{"key":"5_CR40","unstructured":"Kr\u00fcger, S., Sp\u00e4th, J., Ali, K., Bodden, E., Mezini, M.: CrySL: An Extensible Approach to Validating the Correct Usage of Cryptographic APIs. In: ECOOP. pp. 10:1\u201310:27 (2018)"},{"key":"5_CR41","unstructured":"Lee, Y.f., Marlowe, T.J., Ryder, B.G.: Performing data flow analysis in parallel. In: ACM\/IEEE Supercomputing. pp. 942\u2013951 (1990)"},{"key":"5_CR42","doi-asserted-by":"crossref","unstructured":"Lee, Y.F., Ryder, B.G.: A comprehensive approach to parallel data flow analysis. In: ICS. pp. 236\u2013247 (1992)","DOI":"10.1145\/143369.143415"},{"key":"5_CR43","doi-asserted-by":"crossref","unstructured":"Lin, J., Chen, T., Hsu, W.C., Yew, P.C., Ju, R.D.C., Ngai, T.F., Chan, S.: A compiler framework for speculative optimizations. ACM Transactions on Architecture and Code Optimization 1(3), 247\u2013271 (2004)","DOI":"10.1145\/1022969.1022970"},{"key":"5_CR44","unstructured":"Muchnick, S.S.: Advanced Compiler Design and Implementation. Morgan Kaufmann (1997)"},{"key":"5_CR45","doi-asserted-by":"crossref","unstructured":"Naeem, N.A., Lhot\u00e1k, O., Rodriguez, J.: Practical extensions to the ifds algorithm. CC (2010)","DOI":"10.1007\/978-3-642-11970-5_8"},{"key":"5_CR46","doi-asserted-by":"crossref","unstructured":"Nanda, M.G., Sinha, S.: Accurate interprocedural null-dereference analysis for java. In: ICSE. pp. 133\u2013143 (2009)","DOI":"10.1109\/ICSE.2009.5070515"},{"key":"5_CR47","doi-asserted-by":"crossref","unstructured":"Rapoport, M., Lhot\u00e1k, O., Tip, F.: Precise data flow analysis in the presence of correlated method calls. In: SAS. pp. 54\u201371 (2015)","DOI":"10.1007\/978-3-662-48288-9_4"},{"key":"5_CR48","unstructured":"Reps, T.: Program analysis via graph reachability. ILPS (1997)"},{"key":"5_CR49","doi-asserted-by":"crossref","unstructured":"Reps, T.: Undecidability of context-sensitive data-dependence analysis. ACM Transactions on Programming Languages and Systems 22(1), 162\u2013186 (2000)","DOI":"10.1145\/345099.345137"},{"key":"5_CR50","doi-asserted-by":"crossref","unstructured":"Reps, T., Horwitz, S., Sagiv, M.: Precise interprocedural dataflow analysis via graph reachability. In: POPL. pp. 49\u201361 (1995)","DOI":"10.1145\/199448.199462"},{"key":"5_CR51","doi-asserted-by":"crossref","unstructured":"Reps, T.: Demand interprocedural program analysis using logic databases. In: Applications of Logic Databases, vol. 296 (1995)","DOI":"10.1007\/978-1-4615-2207-2_8"},{"key":"5_CR52","doi-asserted-by":"crossref","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. iii. planar tree-width. Journal of Combinatorial Theory, Series B 36(1), 49\u201364 (1984)","DOI":"10.1016\/0095-8956(84)90013-3"},{"key":"5_CR53","doi-asserted-by":"crossref","unstructured":"Rodriguez, J., Lhot\u00e1k, O.: Actor-based parallel dataflow analysis. In: CC. pp. 179\u2013197 (2011)","DOI":"10.1007\/978-3-642-19861-8_11"},{"key":"5_CR54","doi-asserted-by":"crossref","unstructured":"Rountev, A., Kagan, S., Marlowe, T.: Interprocedural dataflow analysis in the presence of large libraries. In: CC. pp. 2\u201316 (2006)","DOI":"10.1007\/11688839_2"},{"key":"5_CR55","doi-asserted-by":"crossref","unstructured":"Sagiv, M., Reps, T., Horwitz, S.: Precise interprocedural dataflow analysis with applications to constant propagation. Theoretical Computer Science (1996)","DOI":"10.1016\/0304-3975(96)00072-2"},{"key":"5_CR56","doi-asserted-by":"crossref","unstructured":"Schubert, P.D., Hermann, B., Bodden, E.: PhASAR: An inter-procedural static analysis framework for C\/C++. In: TACAS. pp. 393\u2013410 (2019)","DOI":"10.1007\/978-3-030-17465-1_22"},{"key":"5_CR57","doi-asserted-by":"crossref","unstructured":"Shang, L., Xie, X., Xue, J.: On-demand dynamic summary-based points-to analysis. In: CGO. pp. 264\u2013274 (2012)","DOI":"10.1145\/2259016.2259050"},{"key":"5_CR58","unstructured":"Sharir, M., Pnueli, A.: Two approaches to interprocedural data flow analysis. In: Program flow analysis: Theory and applications. Prentice-Hall (1981)"},{"key":"5_CR59","doi-asserted-by":"crossref","unstructured":"Smaragdakis, Y., Bravenboer, M., Lhot\u00e1k, O.: Pick your contexts well: Understanding object-sensitivity. In: POPL. pp. 17\u201330 (2011)","DOI":"10.1145\/1925844.1926390"},{"key":"5_CR60","doi-asserted-by":"crossref","unstructured":"Sp\u00e4th, J., Ali, K., Bodden, E.: Context-, flow-, and field-sensitive data-flow analysis using synchronized pushdown systems. In: POPL. pp. 48:1\u201348:29 (2019)","DOI":"10.1145\/3290361"},{"key":"5_CR61","doi-asserted-by":"crossref","unstructured":"Sridharan, M., Bod\u00edk, R.: Refinement-based context-sensitive points-to analysis for java. ACM SIGPLAN Notices 41(6), 387\u2013400 (2006)","DOI":"10.1145\/1133255.1134027"},{"key":"5_CR62","doi-asserted-by":"crossref","unstructured":"Sridharan, M., Gopan, D., Shan, L., Bod\u00edk, R.: Demand-driven points-to analysis for java. In: OOPSLA. pp. 59\u201376 (2005)","DOI":"10.1145\/1103845.1094817"},{"issue":"2","key":"5_CR63","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1006\/inco.1997.2697","volume":"142","author":"M Thorup","year":"1998","unstructured":"Thorup, M.: All structured programs have small tree width and good register allocation. Information and Computation 142(2), 159\u2013181 (1998)","journal-title":"Information and Computation"},{"key":"5_CR64","unstructured":"Torczon, L., Cooper, K.: Engineering a Compiler. Morgan Kaufmann, 2nd edn. (2011)"},{"key":"5_CR65","unstructured":"Vall\u00e9e-Rai, R., Co, P., Gagnon, E., Hendren, L.J., Lam, P., Sundaresan, V.: Soot - a Java bytecode optimization framework. In: CASCON. p. 13 (1999)"},{"key":"5_CR66","doi-asserted-by":"crossref","unstructured":"Xu, G., Rountev, A., Sridharan, M.: Scaling cfl-reachability-based points-to analysis using context-sensitive must-not-alias analysis. In: ECOOP (2009)","DOI":"10.1007\/978-3-642-03013-0_6"},{"key":"5_CR67","doi-asserted-by":"crossref","unstructured":"Yan, D., Xu, G., Rountev, A.: Demand-driven context-sensitive alias analysis for java. In: ISSTA. pp. 155\u2013165 (2011)","DOI":"10.1145\/2001420.2001440"},{"issue":"04","key":"5_CR68","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1142\/S012962649700036X","volume":"07","author":"X Yuan","year":"1997","unstructured":"Yuan, X., Gupta, R., Melhem, R.: Demand-driven data flow analysis for communication optimization. Parallel Processing Letters 07(04), 359\u2013370 (1997)","journal-title":"Parallel Processing Letters"},{"key":"5_CR69","doi-asserted-by":"crossref","unstructured":"Zheng, X., Rugina, R.: Demand-driven alias analysis for c. In: POPL. pp. 197\u2013208 (2008)","DOI":"10.1145\/1328897.1328464"}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-44914-8_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,30]],"date-time":"2022-06-30T17:09:47Z","timestamp":1656608987000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-44914-8_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030449131","9783030449148"],"references-count":69,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-44914-8_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"18 April 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ESOP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Symposium on Programming","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dublin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ireland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 April 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 April 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"esop2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.etaps.org\/2020\/esop","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":"87","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":"27","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":"31% - 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,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":"11-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":"The conference could not take place due to the COVID-19 pandemic. There was an online event on July 2, 2020.","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)"}}]}}