{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T03:52:47Z","timestamp":1768276367015,"version":"3.49.0"},"publisher-location":"Cham","reference-count":59,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031300431","type":"print"},{"value":"9783031300448","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,4,17]],"date-time":"2023-04-17T00:00:00Z","timestamp":1681689600000},"content-version":"vor","delay-in-days":106,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We construct novel thread-modular analyses that track relational information for potentially overlapping clusters of global variables \u2013 given that they are protected by common mutexes. We provide a framework to systematically increase the precision of clustered relational analyses by splitting control locations based on abstractions of <jats:italic>local traces<\/jats:italic>. As one instance, we obtain an analysis of dynamic thread creation and joining. Interestingly, tracking <jats:italic>less relational<\/jats:italic> information for globals may result in higher precision. We consider the class of 2-decomposable domains that encompasses many weakly relational domains (e.g., <jats:italic>Octagons<\/jats:italic>). For these domains, we prove that maximal precision is attained already for clusters of globals of sizes at most 2.<\/jats:p>","DOI":"10.1007\/978-3-031-30044-8_2","type":"book-chapter","created":{"date-parts":[[2023,4,16]],"date-time":"2023-04-16T20:28:25Z","timestamp":1681676905000},"page":"28-58","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["Clustered Relational Thread-Modular Abstract Interpretation with Local Traces"],"prefix":"10.1007","author":[{"given":"Michael","family":"Schwarz","sequence":"first","affiliation":[]},{"given":"Simmo","family":"Saan","sequence":"additional","affiliation":[]},{"given":"Helmut","family":"Seidl","sequence":"additional","affiliation":[]},{"given":"Julian","family":"Erhard","sequence":"additional","affiliation":[]},{"given":"Vesal","family":"Vojdani","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,4,17]]},"reference":[{"key":"2_CR1","doi-asserted-by":"publisher","unstructured":"Agarwal, S., Barik, R., Sarkar, V., Shyamasundar, R.K.: May-happen-in-parallel analysis of x10 programs. In: PPoPP \u201907, p. 183\u2013193, ACM (2007), https:\/\/doi.org\/10.1145\/1229428.1229471","DOI":"10.1145\/1229428.1229471"},{"key":"2_CR2","doi-asserted-by":"publisher","unstructured":"Albert, E., Flores-Montoya, A., Genaim, S.: Analysis of may-happen-in-parallel in concurrent objects. In: Giese, H., Rosu, G. (eds.) Formal Techniques for Distributed Systems - Joint 14th IFIP WG 6.1 International Conference, FMOODS 2012 and 32nd IFIP WG 6.1 International Conference, FORTE 2012, Stockholm, Sweden, June 13-16, 2012. Proceedings, Lecture Notes in Computer Science, vol. 7273, pp. 35\u201351, Springer (2012), https:\/\/doi.org\/10.1007\/978-3-642-30793-5_3","DOI":"10.1007\/978-3-642-30793-5_3"},{"key":"2_CR3","doi-asserted-by":"publisher","unstructured":"Albert, E., Genaim, S., Gordillo, P.: May-happen-in-parallel analysis for asynchronous programs with inter-procedural synchronization. In: Blazy, S., Jensen, T.P. (eds.) Static Analysis - 22nd International Symposium, SAS 2015, Saint-Malo, France, September 9-11, 2015, Proceedings, Lecture Notes in Computer Science, vol. 9291, pp. 72\u201389, Springer (2015), https:\/\/doi.org\/10.1007\/978-3-662-48288-9_5","DOI":"10.1007\/978-3-662-48288-9_5"},{"key":"2_CR4","doi-asserted-by":"publisher","unstructured":"Albert, E., Genaim, S., Gordillo, P.: May-happen-in-parallel analysis with returned futures. In: D\u2019Souza, D., Kumar, K.N. (eds.) Automated Technology for Verification and Analysis - 15th International Symposium, ATVA 2017, Pune, India, October 3-6, 2017, Proceedings, Lecture Notes in Computer Science, vol. 10482, pp. 42\u201358, Springer (2017), https:\/\/doi.org\/10.1007\/978-3-319-68167-2_3","DOI":"10.1007\/978-3-319-68167-2_3"},{"key":"2_CR5","doi-asserted-by":"publisher","unstructured":"Apinis, K., Seidl, H., Vojdani, V.: Side-effecting constraint systems: a swiss army knife for program analysis. In: APLAS \u201912, pp. 157\u2013172, Springer (2012), https:\/\/doi.org\/10.1007\/978-3-642-35182-2_12","DOI":"10.1007\/978-3-642-35182-2_12"},{"key":"2_CR6","doi-asserted-by":"publisher","unstructured":"Arceri, V., Olliaro, M., Cortesi, A., Ferrara, P.: Relational string abstract domains. In: Finkbeiner, B., Wies, T. (eds.) Verification, Model Checking, and Abstract Interpretation - 23rd International Conference, VMCAI 2022, Philadelphia, PA, USA, January 16-18, 2022, Proceedings, Lecture Notes in Computer Science, vol. 13182, pp. 20\u201342, Springer (2022), https:\/\/doi.org\/10.1007\/978-3-030-94583-1_2","DOI":"10.1007\/978-3-030-94583-1_2"},{"key":"2_CR7","doi-asserted-by":"publisher","unstructured":"Barik, R.: Efficient computation of may-happen-in-parallel information for concurrent Java programs. In: LCPC \u201906, vol. 4339 LNCS, pp. 152\u2013169, Springer (2006), https:\/\/doi.org\/10.1007\/978-3-540-69330-7_11","DOI":"10.1007\/978-3-540-69330-7_11"},{"key":"2_CR8","doi-asserted-by":"publisher","unstructured":"Blanchet, B., Cousot, P., Cousot, R., Feret, J., Mauborgne, L., Min\u00e9, A., Monniaux, D., Rival, X.: A static analyzer for large safety-critical software. In: Proceedings of the ACM SIGPLAN 2003 Conference on Programming Language Design and Implementation, p. 196\u2013207, PLDI \u201903, Association for Computing Machinery, New York, NY, USA (2003), ISBN 1581136625, https:\/\/doi.org\/10.1145\/781131.781153","DOI":"10.1145\/781131.781153"},{"key":"2_CR9","doi-asserted-by":"publisher","unstructured":"Bod\u00edk, R., Gupta, R., Soffa, M.L.: Refining data flow information using infeasible paths. SIGSOFT Softw. Eng. Notes 22(6), 361\u2013377 (Nov 1997), ISSN 0163-5948, https:\/\/doi.org\/10.1145\/267896.267921","DOI":"10.1145\/267896.267921"},{"key":"2_CR10","doi-asserted-by":"publisher","unstructured":"Botbol, V., Chailloux, E., Gall, T.L.: Static analysis of communicating processes using symbolic transducers. In: Bouajjani, A., Monniaux, D. (eds.) Verification, Model Checking, and Abstract Interpretation - 18th International Conference, VMCAI 2017, Paris, France, January 15-17, 2017, Proceedings, Lecture Notes in Computer Science, vol. 10145, pp. 73\u201390, Springer (2017), https:\/\/doi.org\/10.1007\/978-3-319-52234-0_5","DOI":"10.1007\/978-3-319-52234-0_5"},{"key":"2_CR11","doi-asserted-by":"publisher","unstructured":"Chen, L., Liu, J., Min\u00e9, A., Kapur, D., Wang, J.: An abstract domain to infer octagonal constraints with absolute value. In: M\u00fcller-Olm, M., Seidl, H. (eds.) Static Analysis - 21st International Symposium, SAS 2014, Munich, Germany, September 11-13, 2014. Proceedings, Lecture Notes in Computer Science, vol. 8723, pp. 101\u2013117, Springer (2014), https:\/\/doi.org\/10.1007\/978-3-319-10936-7_7","DOI":"10.1007\/978-3-319-10936-7_7"},{"key":"2_CR12","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. 129, pp. 325\u2013336 (2013), https:\/\/doi.org\/10.4204\/EPTCS.129.19","DOI":"10.4204\/EPTCS.129.19"},{"key":"2_CR13","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":"2_CR14","doi-asserted-by":"publisher","unstructured":"Cousot, P., Cousot, R., Feret, J., Mauborgne, L., Min\u00e9, A., Rival, X.: Why does astr\u00e9e scale up? Form. Methods Syst. Des. 35(3), 229\u2013264 (dec 2009), ISSN 0925-9856, https:\/\/doi.org\/10.1007\/s10703-009-0089-6","DOI":"10.1007\/s10703-009-0089-6"},{"key":"2_CR15","doi-asserted-by":"publisher","unstructured":"Cousot, P., Giacobazzi, R., Ranzato, F.: $$a^2i$$: Abstract$$^2$$ interpretation. Proc. ACM Program. Lang. 3(POPL) (Jan 2019), https:\/\/doi.org\/10.1145\/3290355","DOI":"10.1145\/3290355"},{"key":"2_CR16","doi-asserted-by":"publisher","unstructured":"Cousot, P., Halbwachs, N.: Automatic discovery of linear restraints among variables of a program. In: Aho, A.V., Zilles, S.N., Szymanski, T.G. (eds.) Conference Record of the Fifth Annual ACM Symposium on Principles of Programming Languages, Tucson, Arizona, USA, January 1978, pp. 84\u201396, ACM Press (1978), https:\/\/doi.org\/10.1145\/512760.512770","DOI":"10.1145\/512760.512770"},{"key":"2_CR17","doi-asserted-by":"publisher","unstructured":"Di, P., Sui, Y., Ye, D., Xue, J.: Region-based may-happen-in-parallel analysis for C programs. In: ICPP, pp. 889\u2013898, IEEE (2015), ISBN 978-1-4673-7587-0, https:\/\/doi.org\/10.1109\/ICPP.2015.98","DOI":"10.1109\/ICPP.2015.98"},{"key":"2_CR18","doi-asserted-by":"publisher","unstructured":"Dwyer, M.B., Clarke, L.A.: Data flow analysis for verifying properties of concurrent programs. ACM SIGSOFT Software Engineering Notes 19(5), 62\u201375 (dec 1994), https:\/\/doi.org\/10.1145\/195274.195295","DOI":"10.1145\/195274.195295"},{"key":"2_CR19","doi-asserted-by":"publisher","unstructured":"Farzan, A., Kincaid, Z.: Verification of parameterized concurrent programs by modular reasoning about data and control. In: Proceedings of the 39th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, p. 297\u2013308, POPL \u201912, Association for Computing Machinery, New York, NY, USA (2012), ISBN 9781450310833, https:\/\/doi.org\/10.1145\/2103656.2103693","DOI":"10.1145\/2103656.2103693"},{"key":"2_CR20","doi-asserted-by":"publisher","unstructured":"Feret, J.: Abstract interpretation of mobile systems. J. Log. Algebraic Methods Program. 63(1), 59\u2013130 (2005), https:\/\/doi.org\/10.1016\/j.jlap.2004.01.005","DOI":"10.1016\/j.jlap.2004.01.005"},{"key":"2_CR21","doi-asserted-by":"publisher","unstructured":"Fulara, J., Durnoga, K., Jakubczyk, K., Schubert, A.: Relational abstract domain of weighted hexagons. Electron. Notes Theor. Comput. Sci. 267(1), 59\u201372 (2010), https:\/\/doi.org\/10.1016\/j.entcs.2010.09.006","DOI":"10.1016\/j.entcs.2010.09.006"},{"key":"2_CR22","doi-asserted-by":"publisher","unstructured":"Giacobazzi, R., Ranzato, F.: The reduced relative power operation on abstract domains. Theor. Comput. Sci. 216(1-2), 159\u2013211 (1999), https:\/\/doi.org\/10.1016\/S0304-3975(98)00194-7","DOI":"10.1016\/S0304-3975(98)00194-7"},{"key":"2_CR23","doi-asserted-by":"publisher","unstructured":"Halbwachs, N., Merchat, D., Gonnord, L.: Some ways to reduce the space dimension in polyhedra computations. Formal Methods in System Design 29(1), 79\u201395 (Jul 2006), ISSN 1572-8102, https:\/\/doi.org\/10.1007\/s10703-006-0013-2","DOI":"10.1007\/s10703-006-0013-2"},{"key":"2_CR24","doi-asserted-by":"crossref","unstructured":"Halbwachs, N., Merchat, D., Parent-Vigouroux, C.: Cartesian factoring of polyhedra in linear relation analysis. In: Cousot, R. (ed.) Static Analysis, pp. 355\u2013365, Springer Berlin Heidelberg, Berlin, Heidelberg (2003), ISBN 978-3-540-44898-3","DOI":"10.1007\/3-540-44898-5_20"},{"key":"2_CR25","doi-asserted-by":"crossref","unstructured":"Handjieva, M., Tzolovski, S.: Refining static analyses by trace-based partitioning using control flow. In: Levi, G. (ed.) Static Analysis, pp. 200\u2013214, Springer Berlin Heidelberg, Berlin, Heidelberg (1998), ISBN 978-3-540-49727-1","DOI":"10.1007\/3-540-49727-7_12"},{"key":"2_CR26","doi-asserted-by":"crossref","unstructured":"Heo, K., Oh, H., Yang, H.: Learning a variable-clustering strategy for octagon from labeled data generated by a static analysis. In: Rival, X. (ed.) Static Analysis, pp. 237\u2013256, Springer Berlin Heidelberg, Berlin, Heidelberg (2016), ISBN 978-3-662-53413-7","DOI":"10.1007\/978-3-662-53413-7_12"},{"key":"2_CR27","doi-asserted-by":"publisher","unstructured":"Holley, L.H., Rosen, B.K.: Qualified data flow problems. In: Proceedings of the 7th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, p. 68\u201382, POPL \u201980, Association for Computing Machinery, New York, NY, USA (1980), ISBN 0897910117, https:\/\/doi.org\/10.1145\/567446.567454","DOI":"10.1145\/567446.567454"},{"key":"2_CR28","doi-asserted-by":"publisher","unstructured":"Howe, J.M., King, A.: Logahedra: A new weakly relational domain. In: Liu, Z., Ravn, A.P. (eds.) Automated Technology for Verification and Analysis, 7th International Symposium, ATVA 2009, Macao, China, October 14-16, 2009. Proceedings, Lecture Notes in Computer Science, vol. 5799, pp. 306\u2013320, Springer (2009), https:\/\/doi.org\/10.1007\/978-3-642-04761-9_23","DOI":"10.1007\/978-3-642-04761-9_23"},{"key":"2_CR29","doi-asserted-by":"publisher","unstructured":"Jeannet, B., Min\u00e9, A.: Apron: A library of numerical abstract domains for static analysis. In: Bouajjani, A., Maler, O. (eds.) Computer Aided Verification, 21st International Conference, CAV 2009, Grenoble, France, June 26 - July 2, 2009. Proceedings, LNCS, vol. 5643, pp. 661\u2013667, Springer (2009), https:\/\/doi.org\/10.1007\/978-3-642-02658-4_52","DOI":"10.1007\/978-3-642-02658-4_52"},{"key":"2_CR30","doi-asserted-by":"publisher","unstructured":"Karr, M.: Affine relationships among variables of a program. Acta Informatica 6, 133\u2013151 (1976), https:\/\/doi.org\/10.1007\/BF00268497","DOI":"10.1007\/BF00268497"},{"key":"2_CR31","doi-asserted-by":"publisher","unstructured":"Kusano, M., Wang, C.: Flow-sensitive composition of thread-modular abstract interpretation. In: Proceedings of the 2016 24th ACM SIGSOFT International Symposium on Foundations of Software Engineering, p. 799\u2013809, FSE 2016, Association for Computing Machinery, New York, NY, USA (2016), ISBN 9781450342186, https:\/\/doi.org\/10.1145\/2950290.2950291","DOI":"10.1145\/2950290.2950291"},{"key":"2_CR32","doi-asserted-by":"publisher","unstructured":"Kusano, M., Wang, C.: Thread-modular static analysis for relaxed memory models. In: Proceedings of the 2017 11th Joint Meeting on Foundations of Software Engineering, p. 337\u2013348, ESEC\/FSE 2017, Association for Computing Machinery, New York, NY, USA (2017), ISBN 9781450351058, https:\/\/doi.org\/10.1145\/3106237.3106243","DOI":"10.1145\/3106237.3106243"},{"key":"2_CR33","doi-asserted-by":"publisher","unstructured":"Logozzo, F., F\u00e4hndrich, M.: Pentagons: A weakly relational abstract domain for the efficient validation of array accesses. In: Proceedings of the 2008 ACM Symposium on Applied Computing, p. 184\u2013188, SAC \u201908, Association for Computing Machinery, New York, NY, USA (2008), ISBN 9781595937537, https:\/\/doi.org\/10.1145\/1363686.1363736","DOI":"10.1145\/1363686.1363736"},{"key":"2_CR34","doi-asserted-by":"crossref","unstructured":"Mauborgne, L., Rival, X.: Trace partitioning in abstract interpretation based static analyzers. In: Sagiv, M. (ed.) Programming Languages and Systems, pp. 5\u201320, Springer Berlin Heidelberg, Berlin, Heidelberg (2005), ISBN 978-3-540-31987-0","DOI":"10.1007\/978-3-540-31987-0_2"},{"key":"2_CR35","doi-asserted-by":"publisher","unstructured":"Min\u00e9, A.: A new numerical abstract domain based on difference-bound matrices. In: Danvy, O., Filinski, A. (eds.) Programs as Data Objects, Second Symposium, PADO 2001, Aarhus, Denmark, May 21-23, 2001, Proceedings, LNCS, vol. 2053, pp. 155\u2013172, Springer (2001), https:\/\/doi.org\/10.1007\/3-540-44978-7_10","DOI":"10.1007\/3-540-44978-7_10"},{"key":"2_CR36","doi-asserted-by":"publisher","unstructured":"Min\u00e9, A.: The octagon abstract domain. In: WCRE\u2019 01, p. 310, IEEE Computer Society (2001), https:\/\/doi.org\/10.1109\/WCRE.2001.957836","DOI":"10.1109\/WCRE.2001.957836"},{"key":"2_CR37","doi-asserted-by":"publisher","unstructured":"Min\u00e9, A.: The octagon abstract domain. Higher Order Symbol. Comput. 19(1), 31\u2013100 (mar 2006), ISSN 1388-3690, https:\/\/doi.org\/10.1007\/s10990-006-8609-1","DOI":"10.1007\/s10990-006-8609-1"},{"key":"2_CR38","doi-asserted-by":"crossref","unstructured":"Min\u00e9, A.: Static analysis of run-time errors in embedded real-time parallel C programs. Logical Methods in Computer Science 8(1), 1\u201363 (mar 2012), DOI: 10.2168\/LMCS-8(1:26)2012.","DOI":"10.2168\/LMCS-8(1:26)2012"},{"key":"2_CR39","doi-asserted-by":"publisher","unstructured":"Min\u00e9, A.: Static analysis of run-time errors in embedded real-time parallel C programs. Logical Methods in Computer Science 8(1), 1\u201363 (mar 2012), https:\/\/doi.org\/10.2168\/LMCS-8(1:26)2012","DOI":"10.2168\/LMCS-8(1:26)2012"},{"key":"2_CR40","doi-asserted-by":"publisher","unstructured":"Monat, R., Min\u00e9, A.: Precise thread-modular abstract interpretation of concurrent programs using relational interference abstractions. In: VMCAI \u201917, vol. 10145 LNCS, pp. 386\u2013404, Springer (2017), https:\/\/doi.org\/10.1007\/978-3-319-52234-0_21","DOI":"10.1007\/978-3-319-52234-0_21"},{"key":"2_CR41","doi-asserted-by":"publisher","unstructured":"Montagu, B., Jensen, T.: Trace-based control-flow analysis. In: PLDI \u201921, p. 482\u2013496, ACM (2021), https:\/\/doi.org\/10.1145\/3453483.3454057","DOI":"10.1145\/3453483.3454057"},{"key":"2_CR42","doi-asserted-by":"publisher","unstructured":"Mukherjee, S., Padon, O., Shoham, S., D\u2019Souza, D., Rinetzky, N.: Thread-local semantics and its efficient sequential abstractions for race-free programs. In: SAS \u201917, vol. LNCS 10422, pp. 253\u2013276, Springer (2017), https:\/\/doi.org\/10.1007\/978-3-319-66706-5_13","DOI":"10.1007\/978-3-319-66706-5_13"},{"key":"2_CR43","doi-asserted-by":"publisher","unstructured":"Naumovich, G., Avrunin, G.S., Clarke, L.A.: An efficient algorithm for computing mhp information for concurrent Java programs. In: ESEC\/FSE \u201999, vol. 1687 LNCS, pp. 338\u2013354, Springer (1999), https:\/\/doi.org\/10.1007\/3-540-48166-4_21","DOI":"10.1007\/3-540-48166-4_21"},{"key":"2_CR44","doi-asserted-by":"publisher","unstructured":"Oh, H., Heo, K., Lee, W., Lee, W., Park, D., Kang, J., Yi, K.: Global sparse analysis framework. ACM Trans. Program. Lang. Syst. 36(3) (sep 2014), ISSN 0164-0925, https:\/\/doi.org\/10.1145\/2590811","DOI":"10.1145\/2590811"},{"key":"2_CR45","doi-asserted-by":"publisher","unstructured":"Oh, H., Lee, W., Heo, K., Yang, H., Yi, K.: Selective x-sensitive analysis guided by impact pre-analysis. ACM Trans. Program. Lang. Syst. 38(2) (Dec 2015), ISSN 0164-0925, https:\/\/doi.org\/10.1145\/2821504","DOI":"10.1145\/2821504"},{"key":"2_CR46","doi-asserted-by":"publisher","unstructured":"P\u00e9ron, M., Halbwachs, N.: An abstract domain extending difference-bound matrices with disequality constraints. In: Cook, B., Podelski, A. (eds.) Verification, Model Checking, and Abstract Interpretation, 8th International Conference, VMCAI 2007, Nice, France, January 14-16, 2007, Proceedings, Lecture Notes in Computer Science, vol. 4349, pp. 268\u2013282, Springer (2007), https:\/\/doi.org\/10.1007\/978-3-540-69738-1_20","DOI":"10.1007\/978-3-540-69738-1_20"},{"key":"2_CR47","doi-asserted-by":"publisher","unstructured":"Rival, X., Mauborgne, L.: The trace partitioning abstract domain. ACM Trans. Program. Lang. Syst. 29(5), 26\u2013es (Aug 2007), ISSN 0164-0925, https:\/\/doi.org\/10.1145\/1275497.1275501","DOI":"10.1145\/1275497.1275501"},{"key":"2_CR48","doi-asserted-by":"publisher","unstructured":"Schwarz, M., Saan, S., Seidl, H., Apinis, K., Erhard, J., Vojdani, V.: Improving thread-modular abstract interpretation. In: SAS \u201921, vol. 12913 LNCS, pp. 359\u2013383, Springer (2021), https:\/\/doi.org\/10.1007\/978-3-030-88806-0_18","DOI":"10.1007\/978-3-030-88806-0_18"},{"key":"2_CR49","unstructured":"Schwarz, M., Saan, S., Seidl, H., Erhard, J., Vojdani, V.: Clustered relational thread-modular abstract interpretation with local traces. CoRR abs\/2301.06439 (2023), URL https:\/\/arxiv.org\/abs\/2301.06439"},{"key":"2_CR50","doi-asserted-by":"publisher","unstructured":"Schwarz, M., Saan, S., Seidl, H., Erhard, J., Vojdani, V.: Clustered Relational Thread-Modular Abstract Interpretation with Local Traces (Jan 2023), https:\/\/doi.org\/10.5281\/zenodo.7505428","DOI":"10.5281\/zenodo.7505428"},{"key":"2_CR51","doi-asserted-by":"publisher","unstructured":"Seidl, H., Vogler, R.: Three improvements to the top-down solver. Math. Struct. Comput. Sci. 31(9), 1090\u20131134 (2021), https:\/\/doi.org\/10.1017\/S0960129521000499","DOI":"10.1017\/S0960129521000499"},{"key":"2_CR52","doi-asserted-by":"publisher","unstructured":"Sharma, D., Sharma, S.: Thread-modular analysis of release-acquire concurrency. In: Dragoi, C., Mukherjee, S., Namjoshi, K.S. (eds.) Static Analysis - 28th International Symposium, SAS 2021, Chicago, IL, USA, October 17-19, 2021, Proceedings, LNCS, vol. 12913, pp. 384\u2013404, Springer (2021), https:\/\/doi.org\/10.1007\/978-3-030-88806-0_19","DOI":"10.1007\/978-3-030-88806-0_19"},{"key":"2_CR53","doi-asserted-by":"publisher","unstructured":"Simon, A., King, A., Howe, J.M.: Two variables per linear inequality as an abstract domain. In: Leuschel, M. (ed.) Logic Based Program Synthesis and Tranformation, 12th International Workshop, LOPSTR 2002, Madrid, Spain, September 17-20,2002, Revised Selected Papers, LNCS, vol. 2664, pp. 71\u201389, Springer (2002), https:\/\/doi.org\/10.1007\/3-540-45013-0_7","DOI":"10.1007\/3-540-45013-0_7"},{"key":"2_CR54","doi-asserted-by":"publisher","unstructured":"Singh, G., P\u00fcschel, M., Vechev, M.: Fast polyhedra abstract domain. In: Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, p. 46\u201359, POPL 2017, Association for Computing Machinery, New York, NY, USA (2017), ISBN 9781450346603, https:\/\/doi.org\/10.1145\/3009837.3009885","DOI":"10.1145\/3009837.3009885"},{"key":"2_CR55","doi-asserted-by":"crossref","unstructured":"Singh, G., P\u00fcschel, M., Vechev, M.: Fast numerical program analysis with reinforcement learning. In: Chockler, H., Weissenbacher, G. (eds.) Computer Aided Verification, pp. 211\u2013229, Springer International Publishing, Cham (2018), ISBN 978-3-319-96145-3","DOI":"10.1007\/978-3-319-96145-3_12"},{"key":"2_CR56","doi-asserted-by":"publisher","unstructured":"Singh, G., P\u00fcschel, M., Vechev, M.: A practical construction for decomposing numerical abstract domains. Proc. ACM Program. Lang. 2(POPL) (dec 2018), https:\/\/doi.org\/10.1145\/3158143","DOI":"10.1145\/3158143"},{"key":"2_CR57","doi-asserted-by":"publisher","unstructured":"Suzanne, T., Min\u00e9, A.: Relational thread-modular abstract interpretation under relaxed memory models. In: APLAS \u201918, vol. LNCS 11275, pp. 109\u2013128, Springer (dec 2018), https:\/\/doi.org\/10.1007\/978-3-030-02768-1_6","DOI":"10.1007\/978-3-030-02768-1_6"},{"key":"2_CR58","doi-asserted-by":"publisher","unstructured":"Vojdani, V., Apinis, K., R\u00f5tov, V., Seidl, H., Vene, V., Vogler, R.: Static Race Detection for Device Drivers: The Goblint Approach. In: ASE \u201916, pp. 391\u2013402, ACM (2016), https:\/\/doi.org\/10.1145\/2970276.2970337","DOI":"10.1145\/2970276.2970337"},{"key":"2_CR59","doi-asserted-by":"publisher","unstructured":"Zhou, Q., Li, L., Wang, L., Xue, J., Feng, X.: May-happen-in-parallel analysis with static vector clocks. In: CGO \u201918, pp. 228\u2013240, ACM (2018), https:\/\/doi.org\/10.1145\/3168813","DOI":"10.1145\/3168813"}],"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-30044-8_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,7]],"date-time":"2023-06-07T09:03:20Z","timestamp":1686128600000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-30044-8_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031300431","9783031300448"],"references-count":59,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-30044-8_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"17 April 2023","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":"Paris","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 April 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 April 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"32","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"esop2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/etaps.org\/2023\/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":"55","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":"20","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":"36% - 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":"5.5","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)"}}]}}