{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,18]],"date-time":"2026-05-18T03:23:46Z","timestamp":1779074626478,"version":"3.51.4"},"publisher-location":"Cham","reference-count":46,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031572661","type":"print"},{"value":"9783031572678","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,4,5]],"date-time":"2024-04-05T00:00:00Z","timestamp":1712275200000},"content-version":"vor","delay-in-days":95,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Sound static analyses are an important ingredient for compiler optimizations and program verification tools. However, mathematically proving that a static analysis is sound is a difficult task due to two problems. First, soundness proofs relate two complicated program semantics (the static and the dynamic semantics) which are hard to reason about. Second, the more the static and dynamic semantics differ, the more work a soundness proof needs to do to bridge the impedance mismatch. These problems increase the effort and complexity of soundness proofs. Existing soundness theories address these problems by deriving both the dynamic and static semantics from the same artifact, often called <jats:italic>generic interpreter<\/jats:italic>. A generic interpreter provides a common structure along which a soundness proof can be composed, which avoids having to reason about the analysis as a whole. However, a generic interpreter restricts which analyses can be derived, as all derived analyses must roughly follow the program execution order.<\/jats:p><jats:p>To lift this restriction, we develop a soundness theory for the blackboard analysis architecture, which is capable of describing backward, demand-driven, and summary-based analyses. The architecture describes static analyses with small independent modules, which communicate via a central store. Soundness of a compound analysis follows from soundness of all of its modules. Furthermore, modules can be proven sound independently, even though modules depend on each other. We evaluate our theory by proving soundness of four analyses: a pointer and call-graph analysis, a reflection analysis, an immutability analysis, and a demand-driven reaching definitions analysis.<\/jats:p>","DOI":"10.1007\/978-3-031-57267-8_14","type":"book-chapter","created":{"date-parts":[[2024,4,4]],"date-time":"2024-04-04T16:02:01Z","timestamp":1712246521000},"page":"361-390","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A Modular Soundness Theory for the Blackboard Analysis Architecture"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4278-2181","authenticated-orcid":false,"given":"Sven","family":"Keidel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-6425-8630","authenticated-orcid":false,"given":"Dominik","family":"Helm","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6561-0430","authenticated-orcid":false,"given":"Tobias","family":"Roth","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6563-7537","authenticated-orcid":false,"given":"Mira","family":"Mezini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,4,5]]},"reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"Afonso, V.M., de\u00a0Geus, P.L., Bianchi, A., Fratantonio, Y., Kruegel, C., Vigna, G., Doup\u00e9, A., Polino, M.: Going native: Using a large-scale analysis of android apps to create a practical native-code sandboxing policy. In: 23rd Annual Network and Distributed System Security Symposium, NDSS 2016, San Diego, California, USA, February 21-24, 2016. The Internet Society (2016)","DOI":"10.14722\/ndss.2016.23384"},{"key":"14_CR2","doi-asserted-by":"publisher","unstructured":"Assaf, M., Naumann, D.A., Signoles, J., Totel, E., Tronel, F.: Hypercollecting semantics and its application to static analysis of information flow. In: Castagna, G., Gordon, A.D. (eds.) Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, POPL 2017, Paris, France, January 18-20, 2017. pp. 874\u2013887. ACM (2017). https:\/\/doi.org\/10.1145\/3009837.3009889","DOI":"10.1145\/3009837.3009889"},{"key":"14_CR3","doi-asserted-by":"publisher","unstructured":"Bertot, Y., Cast\u00e9ran, P.: Interactive Theorem Proving and Program Development - Coq\u2019Art: The Calculus of Inductive Constructions. Texts in Theoretical Computer Science. An EATCS Series, Springer (2004). https:\/\/doi.org\/10.1007\/978-3-662-07964-5","DOI":"10.1007\/978-3-662-07964-5"},{"key":"14_CR4","doi-asserted-by":"publisher","unstructured":"Beyer, D., Henzinger, T.A., Th\u00e9oduloz, G.: Configurable software verification: Concretizing the convergence of model checking and program analysis. In: Damm, W., Hermanns, H. (eds.) Computer Aided Verification, 19th International Conference, CAV 2007, Berlin, Germany, July 3-7, 2007, Proceedings. Lecture Notes in Computer Science, vol.\u00a04590, pp. 504\u2013518. Springer (2007). https:\/\/doi.org\/10.1007\/978-3-540-73368-3_51","DOI":"10.1007\/978-3-540-73368-3_51"},{"key":"14_CR5","doi-asserted-by":"publisher","unstructured":"Bodin, M., Gardner, P., Jensen, T.P., Schmitt, A.: Skeletal semantics and their interpretations. Proc. ACM Program. Lang. 3(POPL), 44:1\u201344:31 (2019). https:\/\/doi.org\/10.1145\/3290357","DOI":"10.1145\/3290357"},{"key":"14_CR6","doi-asserted-by":"publisher","unstructured":"Bogdanas, D., Rosu, G.: K-java: A complete semantics of java. In: Rajamani, S.K., Walker, D. (eds.) Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2015, Mumbai, India, January 15-17, 2015. pp. 445\u2013456. ACM (2015). https:\/\/doi.org\/10.1145\/2676726.2676982","DOI":"10.1145\/2676726.2676982"},{"key":"14_CR7","doi-asserted-by":"publisher","unstructured":"Bravenboer, M., Smaragdakis, Y.: Strictly declarative specification of sophisticated points-to analyses. In: Arora, S., Leavens, G.T. (eds.) Proceedings of the 24th Annual ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications, OOPSLA 2009, October 25-29, 2009, Orlando, Florida, USA. pp. 243\u2013262. ACM (2009). https:\/\/doi.org\/10.1145\/1640089.1640108","DOI":"10.1145\/1640089.1640108"},{"key":"14_CR8","doi-asserted-by":"publisher","unstructured":"Calzavara, S., Grishchenko, I., Maffei, M.: Horndroid: Practical and sound static analysis of android applications by SMT solving. In: IEEE European Symposium on Security and Privacy, EuroS &P 2016, Saarbr\u00fccken, Germany, March 21-24, 2016. pp. 47\u201362. IEEE (2016). https:\/\/doi.org\/10.1109\/EuroSP.2016.16","DOI":"10.1109\/EuroSP.2016.16"},{"key":"14_CR9","doi-asserted-by":"publisher","unstructured":"Cortesi, A., Costantini, G., Ferrara, P.: A survey on product operators in abstract interpretation. In: Banerjee, A., Danvy, O., Doh, K., Hatcliff, J. (eds.) Semantics, Abstract Interpretation, and Reasoning about Programs: Essays Dedicated to David A. Schmidt on the Occasion of his Sixtieth Birthday, Manhattan, Kansas, USA, 19-20th September 2013. EPTCS, vol.\u00a0129, pp. 325\u2013336 (2013). https:\/\/doi.org\/10.4204\/EPTCS.129.19","DOI":"10.4204\/EPTCS.129.19"},{"key":"14_CR10","doi-asserted-by":"publisher","unstructured":"Cousot, P., Cousot, R.: Constructive versions of Tarski\u2019s fixed point theorems. Pacific Journal of Mathematics 81(1), 43\u201357 (1979). https:\/\/doi.org\/10.2140\/pjm.1979.82.43","DOI":"10.2140\/pjm.1979.82.43"},{"key":"14_CR11","doi-asserted-by":"publisher","unstructured":"Cousot, P.: Syntactic and semantic soundness of structural dataflow analysis. In: Chang, B.E. (ed.) Static Analysis - 26th International Symposium, SAS 2019, Porto, Portugal, October 8-11, 2019, Proceedings. Lecture Notes in Computer Science, vol. 11822, pp. 96\u2013117. Springer (2019). https:\/\/doi.org\/10.1007\/978-3-030-32304-2_6","DOI":"10.1007\/978-3-030-32304-2_6"},{"key":"14_CR12","doi-asserted-by":"publisher","unstructured":"Cousot, P., Cousot, R.: Systematic design of program analysis frameworks. In: Aho, A.V., Zilles, S.N., Rosen, B.K. (eds.) Conference Record of the Sixth Annual ACM Symposium on Principles of Programming Languages, San Antonio, Texas, USA, January 1979. pp. 269\u2013282. ACM Press (1979). https:\/\/doi.org\/10.1145\/567752.567778","DOI":"10.1145\/567752.567778"},{"key":"14_CR13","doi-asserted-by":"publisher","unstructured":"Cousot, P., Cousot, R., Feret, J., Mauborgne, L., Min\u00e9, A., Monniaux, D., Rival, X.: The astre\u00e9 analyzer. In: Sagiv, S. (ed.) Programming Languages and Systems, 14th European Symposium on Programming,ESOP 2005, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2005, Edinburgh, UK, April 4-8, 2005, Proceedings. Lecture Notes in Computer Science, vol.\u00a03444, pp. 21\u201330. Springer (2005). https:\/\/doi.org\/10.1007\/978-3-540-31987-0_3","DOI":"10.1007\/978-3-540-31987-0_3"},{"key":"14_CR14","doi-asserted-by":"publisher","unstructured":"Darais, D., Might, M., Horn, D.V.: Galois transformers and modular abstract interpreters: reusable metatheory for program analysis. In: Aldrich, J., Eugster, P. (eds.) Proceedings of the 2015 ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and Applications, OOPSLA 2015, part of SPLASH 2015, Pittsburgh, PA, USA, October 25-30, 2015. pp. 552\u2013571. ACM (2015). https:\/\/doi.org\/10.1145\/2814270.2814308","DOI":"10.1145\/2814270.2814308"},{"key":"14_CR15","doi-asserted-by":"publisher","unstructured":"Eichberg, M., Hermann, B.: A software product line for static analyses: the OPAL framework. In: Arzt, S., Santelices, R.A. (eds.) Proceedings of the 3rd ACM SIGPLAN International Workshop on the State Of the Art in Java Program analysis, SOAP 2014, Edinburgh, UK, Co-located with PLDI 2014, June 12, 2014. pp. 2:1\u20132:6. ACM (2014). https:\/\/doi.org\/10.1145\/2614628.2614630","DOI":"10.1145\/2614628.2614630"},{"key":"14_CR16","doi-asserted-by":"publisher","unstructured":"Gehr, T., Mirman, M., Drachsler-Cohen, D., Tsankov, P., Chaudhuri, S., Vechev, M.T.: AI2: safety and robustness certification of neural networks with abstract interpretation. In: 2018 IEEE Symposium on Security and Privacy, SP 2018, Proceedings, 21-23 May 2018, San Francisco, California, USA. pp. 3\u201318. IEEE Computer Society (2018). https:\/\/doi.org\/10.1109\/SP.2018.00058","DOI":"10.1109\/SP.2018.00058"},{"key":"14_CR17","doi-asserted-by":"publisher","unstructured":"Glanz, L., M\u00fcller, P., Baumg\u00e4rtner, L., Reif, M., Amann, S., Anthonysamy, P., Mezini, M.: Hidden in plain sight: Obfuscated strings threatening your privacy. In: Sun, H., Shieh, S., Gu, G., Ateniese, G. (eds.) ASIA CCS \u201920: The 15th ACM Asia Conference on Computer and Communications Security, Taipei, Taiwan, October 5-9, 2020. pp. 694\u2013707. ACM (2020). https:\/\/doi.org\/10.1145\/3320269.3384745","DOI":"10.1145\/3320269.3384745"},{"key":"14_CR18","doi-asserted-by":"publisher","unstructured":"Haas, A., Rossberg, A., Schuff, D.L., Titzer, B.L., Holman, M., Gohman, D., Wagner, L., Zakai, A., Bastien, J.F.: Bringing the web up to speed with webassembly. In: Cohen, A., Vechev, M.T. (eds.) Proceedings of the 38th ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2017, Barcelona, Spain, June 18-23, 2017. pp. 185\u2013200. ACM (2017). https:\/\/doi.org\/10.1145\/3062341.3062363","DOI":"10.1145\/3062341.3062363"},{"key":"14_CR19","doi-asserted-by":"publisher","unstructured":"Helm, D., K\u00fcbler, F., Eichberg, M., Reif, M., Mezini, M.: A unified lattice model and framework for purity analyses. In: Huchard, M., K\u00e4stner, C., Fraser, G. (eds.) Proceedings of the 33rd ACM\/IEEE International Conference on Automated Software Engineering, ASE 2018, Montpellier, France, September 3-7, 2018. pp. 340\u2013350. ACM (2018). https:\/\/doi.org\/10.1145\/3238147.3238226","DOI":"10.1145\/3238147.3238226"},{"key":"14_CR20","doi-asserted-by":"publisher","unstructured":"Helm, D., K\u00fcbler, F., K\u00f6lzer, J.T., Haller, P., Eichberg, M., Salvaneschi, G., Mezini, M.: A programming model for semi-implicit parallelization of static analyses. In: Khurshid, S., Pasareanu, C.S. (eds.) ISSTA \u201920: 29th ACM SIGSOFT International Symposium on Software Testing and Analysis, Virtual Event, USA, July 18-22, 2020. pp. 428\u2013439. ACM (2020). https:\/\/doi.org\/10.1145\/3395363.3397367","DOI":"10.1145\/3395363.3397367"},{"key":"14_CR21","doi-asserted-by":"publisher","unstructured":"Helm, D., K\u00fcbler, F., Reif, M., Eichberg, M., Mezini, M.: Modular collaborative program analysis in OPAL. In: Devanbu, P., Cohen, M.B., Zimmermann, T. (eds.) ESEC\/FSE \u201920: 28th ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering, Virtual Event, USA, November 8-13, 2020. pp. 184\u2013196. ACM (2020). https:\/\/doi.org\/10.1145\/3368089.3409765","DOI":"10.1145\/3368089.3409765"},{"key":"14_CR22","doi-asserted-by":"publisher","unstructured":"Horn, D.V., Might, M.: Abstracting abstract machines. In: Hudak, P., Weirich, S. (eds.) Proceeding of the 15th ACM SIGPLAN international conference on Functional programming, ICFP 2010, Baltimore, Maryland, USA, September 27-29, 2010. pp. 51\u201362. ACM (2010). https:\/\/doi.org\/10.1145\/1863543.1863553","DOI":"10.1145\/1863543.1863553"},{"key":"14_CR23","doi-asserted-by":"publisher","unstructured":"Hughes, J.: Generalising monads to arrows. Sci. Comput. Program. 37(1-3), 67\u2013111 (2000). https:\/\/doi.org\/10.1016\/S0167-6423(99)00023-4","DOI":"10.1016\/S0167-6423(99)00023-4"},{"key":"14_CR24","doi-asserted-by":"crossref","unstructured":"Johnson, N.P., Fix, J., Beard, S.R., Oh, T., Jablin, T.B., August, D.I.: A collaborative dependence analysis framework. In: Reddi, V.J., Smith, A., Tang, L. (eds.) Proceedings of the 2017 International Symposium on Code Generation and Optimization, CGO 2017, Austin, TX, USA, February 4-8, 2017. pp. 148\u2013159. ACM (2017)","DOI":"10.1109\/CGO.2017.7863736"},{"key":"14_CR25","unstructured":"Jourdan, J.: Verasco: a Formally Verified C Static Analyzer. (Verasco: un analyseur statique pour C formellement v\u00e9rifi\u00e9). Ph.D. thesis, Paris Diderot University, France (2016)"},{"key":"14_CR26","doi-asserted-by":"publisher","unstructured":"Jourdan, J., Laporte, V., Blazy, S., Leroy, X., Pichardie, D.: A formally-verified C static analyzer. In: Rajamani, S.K., Walker, D. (eds.) Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2015, Mumbai, India, January 15-17, 2015. pp. 247\u2013259. ACM (2015). https:\/\/doi.org\/10.1145\/2676726.2676966","DOI":"10.1145\/2676726.2676966"},{"key":"14_CR27","doi-asserted-by":"publisher","unstructured":"Keidel, S., Erdweg, S.: Sound and reusable components for abstract interpretation. Proc. ACM Program. Lang. 3(OOPSLA), 176:1\u2013176:28 (2019). https:\/\/doi.org\/10.1145\/3360602","DOI":"10.1145\/3360602"},{"key":"14_CR28","doi-asserted-by":"publisher","unstructured":"Keidel, S., Poulsen, C.B., Erdweg, S.: Compositional soundness proofs of abstract interpreters. Proc. ACM Program. Lang. 2(ICFP), 72:1\u201372:26 (2018). https:\/\/doi.org\/10.1145\/3236767","DOI":"10.1145\/3236767"},{"key":"14_CR29","doi-asserted-by":"publisher","unstructured":"Kester, D., Mwebesa, M., Bradbury, J.S.: How good is static analysis at finding concurrency bugs? In: Tenth IEEE International Working Conference on Source Code Analysis and Manipulation, SCAM 2010, Timisoara, Romania, 12-13 September 2010. pp. 115\u2013124. IEEE Computer Society (2010). https:\/\/doi.org\/10.1109\/SCAM.2010.26","DOI":"10.1109\/SCAM.2010.26"},{"key":"14_CR30","doi-asserted-by":"publisher","unstructured":"Landman, D., Serebrenik, A., Vinju, J.J.: Challenges for static analysis of java reflection: literature review and empirical study. In: Uchitel, S., Orso, A., Robillard, M.P. (eds.) Proceedings of the 39th International Conference on Software Engineering, ICSE 2017, Buenos Aires, Argentina, May 20-28, 2017. pp. 507\u2013518. IEEE \/ ACM (2017). https:\/\/doi.org\/10.1109\/ICSE.2017.53","DOI":"10.1109\/ICSE.2017.53"},{"key":"14_CR31","doi-asserted-by":"publisher","unstructured":"Lerner, S., Grove, D., Chambers, C.: Composing dataflow analyses and transformations. In: Launchbury, J., Mitchell, J.C. (eds.) Conference Record of POPL 2002: The 29th SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Portland, OR, USA, January 16-18, 2002. pp. 270\u2013282. ACM (2002). https:\/\/doi.org\/10.1145\/503272.503298","DOI":"10.1145\/503272.503298"},{"key":"14_CR32","doi-asserted-by":"crossref","unstructured":"Leroy, X.: A formally verified compiler back-end. Journal of Automated Reasoning 43(4), 363-446 (dec 2009). 10.1007\/s10817-009-9155-4, https:\/\/doi.org\/10.1007\/s10817-009-9155-4","DOI":"10.1007\/s10817-009-9155-4"},{"key":"14_CR33","unstructured":"Leroy, X., Blazy, S., K\u00e4stner, D., Schommer, B., Pister, M., Ferdinand, C.: CompCert - A Formally Verified Optimizing Compiler. In: ERTS 2016: Embedded Real Time Software and Systems, 8th European Congress. SEE, Toulouse, France (Jan 2016)"},{"key":"14_CR34","doi-asserted-by":"publisher","unstructured":"Livshits, B., Sridharan, M., Smaragdakis, Y., Lhot\u00e1k, O., Amaral, J.N., Chang, B.E., Guyer, S.Z., Khedker, U.P., M\u00f8ller, A., Vardoulakis, D.: In defense of soundiness: a manifesto. Commun. ACM 58(2), 44\u201346 (2015). https:\/\/doi.org\/10.1145\/2644805","DOI":"10.1145\/2644805"},{"key":"14_CR35","doi-asserted-by":"publisher","unstructured":"Livshits, V.B., Whaley, J., Lam, M.S.: Reflection analysis for java. In: Yi, K. (ed.) Programming Languages and Systems, Third Asian Symposium, APLAS 2005, Tsukuba, Japan, November 2-5, 2005, Proceedings. Lecture Notes in Computer Science, vol.\u00a03780, pp. 139\u2013160. Springer (2005). https:\/\/doi.org\/10.1007\/11575467_11","DOI":"10.1007\/11575467_11"},{"key":"14_CR36","doi-asserted-by":"publisher","unstructured":"Madsen, M., Lhot\u00e1k, O.: Safe and sound program analysis with flix. In: Tip, F., Bodden, E. (eds.) Proceedings of the 27th ACM SIGSOFT International Symposium on Software Testing and Analysis, ISSTA 2018, Amsterdam, The Netherlands, July 16-21, 2018. pp. 38\u201348. ACM (2018). https:\/\/doi.org\/10.1145\/3213846.3213847","DOI":"10.1145\/3213846.3213847"},{"key":"14_CR37","doi-asserted-by":"publisher","unstructured":"Madsen, M., Yee, M., Lhot\u00e1k, O.: From datalog to flix: a declarative language for fixed points on lattices. In: Krintz, C., Berger, E.D. (eds.) Proceedings of the 37th ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2016, Santa Barbara, CA, USA, June 13-17, 2016. pp. 194\u2013208. ACM (2016). https:\/\/doi.org\/10.1145\/2908080.2908096","DOI":"10.1145\/2908080.2908096"},{"key":"14_CR38","doi-asserted-by":"publisher","unstructured":"Nielson, F., Nielson, H.R., Hankin, C.: Principles of program analysis. Springer (1999). https:\/\/doi.org\/10.1007\/978-3-662-03811-6","DOI":"10.1007\/978-3-662-03811-6"},{"key":"14_CR39","unstructured":"Nii, H.P.: Blackboard systems, part one: The blackboard model of problem solving and the evolution of blackboard architectures. AI Mag. 7(2), 38\u201353 (1986)"},{"key":"14_CR40","doi-asserted-by":"publisher","unstructured":"Reif, M., K\u00fcbler, F., Eichberg, M., Helm, D., Mezini, M.: Judge: identifying, understanding, and evaluating sources of unsoundness in call graphs. In: Zhang, D., M\u00f8ller, A. (eds.) Proceedings of the 28th ACM SIGSOFT International Symposium on Software Testing and Analysis, ISSTA 2019, Beijing, China, July 15-19, 2019. pp. 251\u2013261. ACM (2019). https:\/\/doi.org\/10.1145\/3293882.3330555","DOI":"10.1145\/3293882.3330555"},{"key":"14_CR41","doi-asserted-by":"publisher","unstructured":"Roth, T., Helm, D., Reif, M., Mezini, M.: Cifi: Versatile analysis of class and field immutability. In: 36th IEEE\/ACM International Conference on Automated Software Engineering, ASE 2021, Melbourne, Australia, November 15-19, 2021. pp. 979\u2013990. IEEE (2021). https:\/\/doi.org\/10.1109\/ASE51524.2021.9678903","DOI":"10.1109\/ASE51524.2021.9678903"},{"key":"14_CR42","doi-asserted-by":"publisher","unstructured":"Schubert, P.D., Leer, R., Hermann, B., Bodden, E.: Into the woods: Experiences from building a dataflow analysis framework for C\/C++. In: 21st IEEE International Working Conference on Source Code Analysis and Manipulation, SCAM 2021, Luxembourg, September 27-28, 2021. pp. 18\u201323. IEEE (2021). https:\/\/doi.org\/10.1109\/SCAM52516.2021.00011","DOI":"10.1109\/SCAM52516.2021.00011"},{"key":"14_CR43","doi-asserted-by":"publisher","unstructured":"Smaragdakis, Y., Kastrinis, G.: Defensive points-to analysis: Effective soundness via laziness. In: Millstein, T.D. (ed.) 32nd European Conference on Object-Oriented Programming, ECOOP 2018, July 16-21, 2018, Amsterdam, The Netherlands. LIPIcs, vol.\u00a0109, pp. 23:1\u201323:28. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2018). https:\/\/doi.org\/10.4230\/LIPIcs.ECOOP.2018.23","DOI":"10.4230\/LIPIcs.ECOOP.2018.23"},{"key":"14_CR44","doi-asserted-by":"publisher","unstructured":"Stein, B., Chang, B.E., Sridharan, M.: Demanded abstract interpretation. In: Freund, S.N., Yahav, E. (eds.) PLDI \u201921: 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, Virtual Event, Canada, June 20-25, 2021. pp. 282\u2013295. ACM (2021). https:\/\/doi.org\/10.1145\/3453483.3454044","DOI":"10.1145\/3453483.3454044"},{"key":"14_CR45","doi-asserted-by":"publisher","unstructured":"Szab\u00f3, T., Bergmann, G., Erdweg, S., Voelter, M.: Incrementalizing lattice-based program analyses in datalog. Proc. ACM Program. Lang. 2(OOPSLA), 139:1\u2013139:29 (2018). https:\/\/doi.org\/10.1145\/3276509","DOI":"10.1145\/3276509"},{"key":"14_CR46","doi-asserted-by":"publisher","unstructured":"Taneja, J., Liu, Z., Regehr, J.: Testing static analyses for precision and soundness. In: CGO \u201920: 18th ACM\/IEEE International Symposium on Code Generation and Optimization, San Diego, CA, USA, February, 2020. pp. 81\u201393. ACM (2020). https:\/\/doi.org\/10.1145\/3368826.3377927","DOI":"10.1145\/3368826.3377927"}],"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-031-57267-8_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,4]],"date-time":"2024-04-04T16:04:34Z","timestamp":1712246674000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-57267-8_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031572661","9783031572678"],"references-count":46,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-57267-8_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"5 April 2024","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":"Luxembourg City","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Luxembourg","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 April 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 April 2024","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":"esop2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/etaps.org\/2024\/conferences\/esop\/","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":"72","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":"25","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":"1","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":"35% - 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.2","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":"8","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 proceedings also contain 4 artifact report that have not been part of the original submission","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)"}}]}}