{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,30]],"date-time":"2026-01-30T00:19:43Z","timestamp":1769732383042,"version":"3.49.0"},"publisher-location":"Cham","reference-count":56,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031747755","type":"print"},{"value":"9783031747762","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-74776-2_2","type":"book-chapter","created":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T05:35:21Z","timestamp":1737351321000},"page":"26-60","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Trace Partitioning as\u00a0an\u00a0Optimization Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0000-8598-2485","authenticated-orcid":false,"given":"M. Charles","family":"Babu","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1081-0467","authenticated-orcid":false,"given":"Matthieu","family":"Lemerre","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6509-3506","authenticated-orcid":false,"given":"S\u00e9bastien","family":"Bardin","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0002-8262-3887","authenticated-orcid":false,"given":"Jean-Yves","family":"Marion","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,1,21]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Abramsky, S., Gabbay, D.M., Maibaum, T.S.E. (eds.): Handbook of Logic in Computer Science (Vol. 3): Semantic Structures. Oxford University Press, Inc., USA (1995)","DOI":"10.1093\/oso\/9780198537625.001.0001"},{"key":"2_CR2","unstructured":"Aho, A.V., Sethi, R., Ullman, J.D.: Compilers: Principles, Techniques, and Tools. Addison-Wesley series in computer science\/World student series edition, Addison-Wesley, USA (1986). https:\/\/www.worldcat.org\/oclc\/12285707"},{"key":"2_CR3","doi-asserted-by":"publisher","unstructured":"Ammons, G., Larus, J.R.: Improving data-flow analysis with path profiles. In: Davidson, J.W., Cooper, K.D., Berman, A.M. (eds.) Proceedings of the ACM SIGPLAN \u201998 Conference on Programming Language Design and Implementation (PLDI), Montreal, Canada, 17\u201319 June 1998, pp. 72\u201384. ACM, Montreal, Canada (1998). https:\/\/doi.org\/10.1145\/277650.277665","DOI":"10.1145\/277650.277665"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Baier, D., et al.: Cpachecker 2.3 with strategy selection - (competition contribution). In: TACAS (3). LNCS, vol. 14572, pp. 359\u2013364. Springer (2024)","DOI":"10.1007\/978-3-031-57256-2_21"},{"key":"2_CR5","doi-asserted-by":"publisher","unstructured":"Balakrishnan, G., Sankaranarayanan, S., Ivancic, F., Gupta, A.: Refining the control structure of loops using static analysis. In: Chakraborty, S., Halbwachs, N. (eds.) Proceedings of the 9th ACM & IEEE International conference on Embedded software, EMSOFT 2009, Grenoble, France, 12\u201316 October 2009, pp. 49\u201358. ACM, Grenoble, France (2009). https:\/\/doi.org\/10.1145\/1629335.1629343","DOI":"10.1145\/1629335.1629343"},{"key":"2_CR6","doi-asserted-by":"publisher","unstructured":"Ball, T., Majumdar, R., Millstein, T.D., Rajamani, S.K.: Automatic predicate abstraction of C programs. In: Burke, M., Soffa, M.L. (eds.) Proceedings of the 2001 ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), Snowbird, Utah, USA, 20\u201322 June 2001, pp. 203\u2013213. ACM, Utah, USA (2001). https:\/\/doi.org\/10.1145\/378795.378846","DOI":"10.1145\/378795.378846"},{"key":"2_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/3-540-45139-0_7","volume-title":"Model Checking Software","author":"T Ball","year":"2001","unstructured":"Ball, T., Rajamani, S.K.: Automatically validating temporal safety properties of interfaces. In: Dwyer, M. (ed.) SPIN 2001. LNCS, vol. 2057, pp. 102\u2013122. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45139-0_7"},{"key":"2_CR8","doi-asserted-by":"publisher","unstructured":"Ball, T., Rajamani, S.K.: The SLAM project: debugging system software via static analysis. 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, 16\u201318 January 2002, pp.\u00a01\u20133. ACM, Portland, OR, USA (2002). https:\/\/doi.org\/10.1145\/503272.503274","DOI":"10.1145\/503272.503274"},{"key":"2_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/978-3-642-18275-4_6","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"S Bardin","year":"2011","unstructured":"Bardin, S., Herrmann, P., V\u00e9drine, F.: Refinement-based CFG reconstruction from unstructured programs. In: Jhala, R., Schmidt, D. (eds.) VMCAI 2011. LNCS, vol. 6538, pp. 54\u201369. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-18275-4_6"},{"key":"2_CR10","doi-asserted-by":"publisher","unstructured":"Beyer, D.: Competition on software verification and witness validation: SV-COMP 2023. In: Sankaranarayanan, S., Sharygina, N. (eds.) Tools and Algorithms for the Construction and Analysis of Systems - 29th International Conference, TACAS 2023, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022, Paris, France, 22\u201327 April 2023, Proceedings, Part II. LNCS, vol. 13994, pp. 495\u2013522. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30820-8_29","DOI":"10.1007\/978-3-031-30820-8_29"},{"key":"2_CR11","doi-asserted-by":"publisher","unstructured":"Beyer, D., L\u00f6we, S.: Explicit-state software model checking based on CEGAR and interpolation. In: Cortellessa, V., Varr\u00f3, D. (eds.) Fundamental Approaches to Software Engineering - 16th International Conference, FASE 2013, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2013, Rome, Italy, March 16-24, 2013. Proceedings. LNCS, vol.\u00a07793, pp. 146\u2013162. Springer, Rome, Italy (2013). https:\/\/doi.org\/10.1007\/978-3-642-37057-1_11","DOI":"10.1007\/978-3-642-37057-1_11"},{"key":"2_CR12","doi-asserted-by":"publisher","unstructured":"Bourdoncle, F.: Abstract interpretation by dynamic partitioning. J. Funct. Program. 2(4), 407\u2013423 (1992). https:\/\/doi.org\/10.1017\/S0956796800000496","DOI":"10.1017\/S0956796800000496"},{"key":"2_CR13","doi-asserted-by":"publisher","unstructured":"Bourdoncle, F.: Efficient chaotic iteration strategies with widenings. In: Bj\u00f8rner, D., Broy, M., Pottosin, I.V. (eds.) Formal Methods in Programming and Their Applications, International Conference, Akademgorodok, Novosibirsk, Russia, June 28\u2013July 2 1993, Proceedings. LNCS, vol.\u00a0735, pp. 128\u2013141. Springer, Cham (1993). https:\/\/doi.org\/10.1007\/BFb0039704","DOI":"10.1007\/BFb0039704"},{"key":"2_CR14","doi-asserted-by":"publisher","unstructured":"Bruni, R., Giacobazzi, R., Gori, R., Garcia-Contreras, I., Pavlovic, D.: Abstract extensionality: on the properties of incomplete abstract interpretations. Proc. ACM Program. Lang. 4(POPL), 28:1\u201328:28 (2020). https:\/\/doi.org\/10.1145\/3371096","DOI":"10.1145\/3371096"},{"key":"2_CR15","doi-asserted-by":"publisher","unstructured":"Bruni, R., Giacobazzi, R., Gori, R., Ranzato, F.: A logic for locally complete abstract interpretations. In: 36th Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS 2021, Rome, Italy, June 29\u2013July 2 2021, pp. 1\u201313. IEEE, Rome, Italy (2021). https:\/\/doi.org\/10.1109\/LICS52264.2021.9470608","DOI":"10.1109\/LICS52264.2021.9470608"},{"key":"2_CR16","doi-asserted-by":"publisher","unstructured":"Bruni, R., Giacobazzi, R., Gori, R., Ranzato, F.: Abstract interpretation repair. In: Jhala, R., Dillig, I. (eds.) PLDI \u201922: 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation, San Diego, CA, USA, June 13\u201317 2022, pp. 426\u2013441. ACM, CA, USA (2022). https:\/\/doi.org\/10.1145\/3519939.3523453","DOI":"10.1145\/3519939.3523453"},{"key":"2_CR17","doi-asserted-by":"publisher","unstructured":"Clarke, E.M., Grumberg, O., Jha, S., Lu, Y., Veith, H.: Counterexample-guided abstraction refinement. In: Emerson, E.A., Sistla, A.P. (eds.) Computer Aided Verification, 12th International Conference, CAV 2000, Chicago, IL, USA, 15\u201319 July 2000, Proceedings. LNCS, vol.\u00a01855, pp. 154\u2013169. Springer, Chicago, IL, USA (2000). https:\/\/doi.org\/10.1007\/10722167_15","DOI":"10.1007\/10722167_15"},{"key":"2_CR18","unstructured":"Cousot, P.: Semantic foundations of program analysis. In: Program Flow Analysis: Theory and Applications, pp. 303\u2013342. Prentice Hall, New Jersey (1981)"},{"key":"2_CR19","volume-title":"Principles of Abstract Interpretation","author":"P Cousot","year":"2021","unstructured":"Cousot, P.: Principles of Abstract Interpretation. MIT Press, Cambridge, Massachusetts (2021)"},{"key":"2_CR20","doi-asserted-by":"publisher","unstructured":"Cousot, P., Cousot, R.: Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: Graham, R.M., Harrison, M.A., Sethi, R. (eds.) Conference Record of the Fourth ACM Symposium on Principles of Programming Languages, Los Angeles, California, USA, January 1977, pp. 238\u2013252. ACM, California, USA (1977). https:\/\/doi.org\/10.1145\/512950.512973","DOI":"10.1145\/512950.512973"},{"key":"2_CR21","doi-asserted-by":"publisher","unstructured":"Cyphert, J., Breck, J., Kincaid, Z., Reps, T.W.: Refinement of path expressions for static analysis. Proc. ACM Program. Lang. 3(POPL), 45:1\u201345:29 (2019). https:\/\/doi.org\/10.1145\/3290358","DOI":"10.1145\/3290358"},{"key":"2_CR22","doi-asserted-by":"publisher","unstructured":"Das, M., Lerner, S., Seigle, M.: ESP: path-sensitive program verification in polynomial time. In: Knoop, J., Hendren, L.J. (eds.) Proceedings of the 2002 ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), Berlin, Germany, 17\u201319 June 2002, pp. 57\u201368. ACM, Berlin, Germany (2002). https:\/\/doi.org\/10.1145\/512529.512538","DOI":"10.1145\/512529.512538"},{"key":"2_CR23","doi-asserted-by":"publisher","unstructured":"Flanagan, C., Leino, K.R.M., Lillibridge, M., Nelson, G., Saxe, J.B., Stata, R.: Extended static checking for java. In: Knoop, J., Hendren, L.J. (eds.) Proceedings of the 2002 ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), Berlin, Germany, 17\u201319 June 2002, pp. 234\u2013245. ACM, Berlin, Germany (2002). https:\/\/doi.org\/10.1145\/512529.512558","DOI":"10.1145\/512529.512558"},{"key":"2_CR24","doi-asserted-by":"publisher","unstructured":"Giacobazzi, R., Logozzo, F., Ranzato, F.: Analyzing program analyses. 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, 15\u201317 January 2015, pp. 261\u2013273. ACM, Mumbai, India (2015). https:\/\/doi.org\/10.1145\/2676726.2676987","DOI":"10.1145\/2676726.2676987"},{"key":"2_CR25","doi-asserted-by":"publisher","unstructured":"Giacobazzi, R., Ranzato, F., Scozzari, F.: Making abstract interpretations complete. J. ACM 47(2), 361\u2013416 (2000). https:\/\/doi.org\/10.1145\/333979.333989","DOI":"10.1145\/333979.333989"},{"key":"2_CR26","doi-asserted-by":"publisher","unstructured":"Gulwani, S., Jain, S., Koskinen, E.: Control-flow refinement and progress invariants for bound analysis. In: Hind, M., Diwan, A. (eds.) Proceedings of the 2009 ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2009, Dublin, Ireland, 15\u201321 June 2009, pp. 375\u2013385. ACM, Dublin, Ireland (2009). https:\/\/doi.org\/10.1145\/1542476.1542518","DOI":"10.1145\/1542476.1542518"},{"key":"2_CR27","doi-asserted-by":"publisher","unstructured":"Gulwani, S., Zuleger, F.: The reachability-bound problem. In: Zorn, B.G., Aiken, A. (eds.) Proceedings of the 2010 ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2010, Toronto, Ontario, Canada, 5\u201310 June 2010, pp. 292\u2013304. ACM, Toronto, Ontario (2010). https:\/\/doi.org\/10.1145\/1806596.1806630","DOI":"10.1145\/1806596.1806630"},{"key":"2_CR28","doi-asserted-by":"publisher","unstructured":"Guyer, S.Z., Lin, C.: Client-driven pointer analysis. In: Cousot, R. (ed.) Static Analysis, 10th International Symposium, SAS 2003, San Diego, CA, USA, 11\u201313 June 2003, Proceedings. LNCS, vol.\u00a02694, pp. 214\u2013236. Springer, CA, USA (2003). https:\/\/doi.org\/10.1007\/3-540-44898-5_12","DOI":"10.1007\/3-540-44898-5_12"},{"key":"2_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/3-540-49727-7_12","volume-title":"Static Analysis","author":"M Handjieva","year":"1998","unstructured":"Handjieva, M., Tzolovski, S.: Refining static analyses by trace-based partitioning using control flow. In: Levi, G. (ed.) SAS 1998. LNCS, vol. 1503, pp. 200\u2013214. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/3-540-49727-7_12"},{"key":"2_CR30","doi-asserted-by":"publisher","unstructured":"Heizmann, M., Hoenicke, J., Podelski, A.: Refinement of trace abstraction. In: Palsberg, J., Su, Z. (eds.) Static Analysis, 16th International Symposium, SAS 2009, Los Angeles, CA, USA, 9\u201311 August 2009. Proceedings. LNCS, vol.\u00a05673, pp. 69\u201385. Springer, CA, USA (2009). https:\/\/doi.org\/10.1007\/978-3-642-03237-0_7","DOI":"10.1007\/978-3-642-03237-0_7"},{"key":"2_CR31","doi-asserted-by":"publisher","unstructured":"Henzinger, T.A., Jhala, R., Majumdar, R., Sutre, G.: Lazy abstraction. 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, 16\u201318 January 2002, pp. 58\u201370. ACM, Portland,OR, USA (2002). https:\/\/doi.org\/10.1145\/503272.503279","DOI":"10.1145\/503272.503279"},{"key":"2_CR32","doi-asserted-by":"publisher","unstructured":"Holley, L.H., Rosen, B.K.: Qualified data flow problems. IEEE Trans. Softw. Eng. 7(1), 60\u201378 (1981). https:\/\/doi.org\/10.1109\/TSE.1981.234509","DOI":"10.1109\/TSE.1981.234509"},{"key":"2_CR33","doi-asserted-by":"publisher","unstructured":"Jeannet, B.: Dynamic partitioning in linear relation analysis: application to the verification of reactive systems. Form. Methods Syst. Des. 23(1), 5\u201337 (2003). https:\/\/doi.org\/10.1023\/A:1024480913162","DOI":"10.1023\/A:1024480913162"},{"key":"2_CR34","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\u2013July 2 2009. Proceedings. LNCS, vol.\u00a05643, pp. 661\u2013667. Springer, Grenoble (2009). https:\/\/doi.org\/10.1007\/978-3-642-02658-4_52","DOI":"10.1007\/978-3-642-02658-4_52"},{"key":"2_CR35","doi-asserted-by":"publisher","unstructured":"Kastrinis, G., Smaragdakis, Y.: Hybrid context-sensitivity for points-to analysis. In: Boehm, H., Flanagan, C. (eds.) ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI \u201913, Seattle, WA, USA, June 16\u201319 2013, pp. 423\u2013434. ACM, Seattle, USA (2013). https:\/\/doi.org\/10.1145\/2491956.2462191","DOI":"10.1145\/2491956.2462191"},{"key":"2_CR36","doi-asserted-by":"publisher","unstructured":"Kildall, G.A.: A unified approach to global program optimization. In: Fischer, P.C., Ullman, J.D. (eds.) Conference Record of the ACM Symposium on Principles of Programming Languages, Boston, Massachusetts, USA, October 1973, pp. 194\u2013206. ACM Press, Massachusetts, USA (1973). https:\/\/doi.org\/10.1145\/512927.512945","DOI":"10.1145\/512927.512945"},{"key":"2_CR37","doi-asserted-by":"publisher","unstructured":"Kim, S., Rival, X., Ryu, S.: A theoretical foundation of sensitivity in an abstract interpretation framework. ACM Trans. Program. Lang. Syst. 40(3), 13:1\u201313:44 (2018). https:\/\/doi.org\/10.1145\/3230624","DOI":"10.1145\/3230624"},{"key":"2_CR38","doi-asserted-by":"publisher","unstructured":"Korf, R.E.: Depth-first iterative-deepening: an optimal admissible tree search. Artif. Intell. 27(1), 97\u2013109 (1985). https:\/\/doi.org\/10.1016\/0004-3702(85)90084-0","DOI":"10.1016\/0004-3702(85)90084-0"},{"key":"2_CR39","doi-asserted-by":"publisher","unstructured":"Li, H., Berenger, F., Chang, B.E., Rival, X.: Semantic-directed clumping of disjunctive abstract states. In: Castagna, G., Gordon, A.D. (eds.) Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, POPL 2017, Paris, France, 18\u201320 January 2017, pp. 32\u201345. ACM, Paris, France (2017). https:\/\/doi.org\/10.1145\/3009837.3009881","DOI":"10.1145\/3009837.3009881"},{"key":"2_CR40","doi-asserted-by":"publisher","unstructured":"Liang, P., Tripp, O., Naik, M.: Learning minimal abstractions. In: Ball, T., Sagiv, M. (eds.) Proceedings of the 38th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2011, Austin, TX, USA, 26\u201328 January 2011, pp. 31\u201342. ACM, Austin, TX, USA (2011). https:\/\/doi.org\/10.1145\/1926385.1926391","DOI":"10.1145\/1926385.1926391"},{"key":"2_CR41","unstructured":"Martin, F.: Generating program analyzers. Ph.D. thesis, Saarland University, Saarbr\u00fccken, Germany (1999). http:\/\/scidok.sulb.uni-saarland.de\/volltexte\/2004\/203\/index.html"},{"key":"2_CR42","doi-asserted-by":"publisher","unstructured":"Mauborgne, L., Rival, X.: Trace partitioning in abstract interpretation based static analyzers. 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, 4\u20138 April 2005, Proceedings. LNCS, vol.\u00a03444, pp. 5\u201320. Springer, Edinburgh, UK (2005). https:\/\/doi.org\/10.1007\/978-3-540-31987-0_2","DOI":"10.1007\/978-3-540-31987-0_2"},{"key":"2_CR43","doi-asserted-by":"publisher","unstructured":"Milanova, A.L., Rountev, A., Ryder, B.G.: Parameterized object sensitivity for points-to analysis for java. ACM Trans. Softw. Eng. Methodol. 14(1), 1\u201341 (2005). https:\/\/doi.org\/10.1145\/1044834.1044835","DOI":"10.1145\/1044834.1044835"},{"key":"2_CR44","doi-asserted-by":"publisher","unstructured":"Rival, X.: Understanding the origin of alarms in Astr\u00e9e. In: Hankin, C., Siveroni, I. (eds.) Static Analysis, 12th International Symposium, SAS 2005, London, UK, 7\u20139 September 2005, Proceedings. LNCS, vol.\u00a03672, pp. 303\u2013319. Springer, London, UK (2005). https:\/\/doi.org\/10.1007\/11547662_21","DOI":"10.1007\/11547662_21"},{"key":"2_CR45","doi-asserted-by":"publisher","unstructured":"Rival, X., Mauborgne, L.: The trace partitioning abstract domain. ACM Trans. Program. Lang. Syst. 29(5), 26 (2007). https:\/\/doi.org\/10.1145\/1275497.1275501","DOI":"10.1145\/1275497.1275501"},{"key":"2_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/11823230_2","volume-title":"Static Analysis","author":"S Sankaranarayanan","year":"2006","unstructured":"Sankaranarayanan, S., Ivan\u010di\u0107, F., Shlyakhter, I., Gupta, A.: Static analysis in disjunctive numerical domains. In: Yi, K. (ed.) SAS 2006. LNCS, vol. 4134, pp. 3\u201317. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11823230_2"},{"key":"2_CR47","unstructured":"Sharir, M., Pnueli, A., et al.: Two approaches to interprocedural data flow analysis. New York University. Courant Institute of Mathematical Sciences .., New York (1978)"},{"key":"2_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1007\/978-3-642-22110-1_57","volume-title":"Computer Aided Verification","author":"R Sharma","year":"2011","unstructured":"Sharma, R., Dillig, I., Dillig, T., Aiken, A.: Simplifying loop invariant generation using splitter predicates. In: Gopalakrishnan, G., Qadeer, S. (eds.) CAV 2011. LNCS, vol. 6806, pp. 703\u2013719. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22110-1_57"},{"key":"2_CR49","unstructured":"Shivers, O.G.: Control-flow analysis of higher-order languages or taming lambda. Carnegie Mellon University (1991)"},{"key":"2_CR50","doi-asserted-by":"publisher","unstructured":"Silva, J.P.M., Sakallah, K.A.: GRASP - a new search algorithm for satisfiability. In: Rutenbar, R.A., Otten, R.H.J.M. (eds.) Proceedings of the 1996 IEEE\/ACM International Conference on Computer-Aided Design, ICCAD 1996, San Jose, CA, USA, 10\u201314 November 1996, pp. 220\u2013227. IEEE Computer Society\/ACM (1996). https:\/\/doi.org\/10.1109\/ICCAD.1996.569607","DOI":"10.1109\/ICCAD.1996.569607"},{"key":"2_CR51","doi-asserted-by":"publisher","unstructured":"Smaragdakis, Y., Balatsouras, G.: Pointer analysis. Found. Trends Program. Lang. 2(1), 1\u201369 (2015). https:\/\/doi.org\/10.1561\/2500000014","DOI":"10.1561\/2500000014"},{"key":"2_CR52","doi-asserted-by":"publisher","unstructured":"Smaragdakis, Y., Bravenboer, M., Lhot\u00e1k, O.: Pick your contexts well: understanding object-sensitivity. In: Ball, T., Sagiv, M. (eds.) Proceedings of the 38th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2011, Austin, TX, USA, 26\u201328 January 2011, pp. 17\u201330. ACM, USA (2011). https:\/\/doi.org\/10.1145\/1926385.1926390","DOI":"10.1145\/1926385.1926390"},{"key":"2_CR53","doi-asserted-by":"publisher","unstructured":"Sridharan, M., Bod\u00edk, R.: Refinement-based context-sensitive points-to analysis for java. In: Schwartzbach, M.I., Ball, T. (eds.) Proceedings of the ACM SIGPLAN 2006 Conference on Programming Language Design and Implementation, Ottawa, Ontario, Canada, 11\u201314 June 2006, pp. 387\u2013400. ACM, Canada (2006). https:\/\/doi.org\/10.1145\/1133981.1134027","DOI":"10.1145\/1133981.1134027"},{"key":"2_CR54","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, 20\u201325 June 2021, pp. 282\u2013295. ACM, Canada (2021). https:\/\/doi.org\/10.1145\/3453483.3454044","DOI":"10.1145\/3453483.3454044"},{"key":"2_CR55","doi-asserted-by":"publisher","unstructured":"Vechev, M.T., Yahav, E., Yorsh, G.: Abstraction-guided synthesis of synchronization. In: Hermenegildo, M.V., Palsberg, J. (eds.) Proceedings of the 37th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2010, Madrid, Spain, 17\u201323 January 2010, pp. 327\u2013338. ACM, Madrid, Spain (2010). https:\/\/doi.org\/10.1145\/1706299.1706338","DOI":"10.1145\/1706299.1706338"},{"key":"2_CR56","doi-asserted-by":"publisher","unstructured":"Zhang, X., Naik, M., Yang, H.: Finding optimum abstractions in parametric dataflow analysis. In: Boehm, H., Flanagan, C. (eds.) ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI \u201913, Seattle, WA, USA, 16\u201319 June 2013, pp. 365\u2013376. ACM, Seattle, WA (2013). https:\/\/doi.org\/10.1145\/2491956.2462185","DOI":"10.1145\/2491956.2462185"}],"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-031-74776-2_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T05:35:26Z","timestamp":1737351326000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-74776-2_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031747755","9783031747762"],"references-count":56,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-74776-2_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"21 January 2025","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":"Pasadena, CA","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":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 October 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 October 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sas2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/2024.splashcon.org\/home\/sas-2024","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}