{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T04:09:58Z","timestamp":1742962198969,"version":"3.40.3"},"publisher-location":"Cham","reference-count":48,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031747755"},{"type":"electronic","value":"9783031747762"}],"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_12","type":"book-chapter","created":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T05:35:00Z","timestamp":1737351300000},"page":"300-326","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Under-Approximating Memory Abstractions"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6215-7359","authenticated-orcid":false,"given":"Marco","family":"Milanese","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6375-3179","authenticated-orcid":false,"given":"Antoine","family":"Min\u00e9","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,1,21]]},"reference":[{"key":"12_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-030-99253-8_2","volume-title":"Foundations of Software Science and Computation Structures","author":"F Ascari","year":"2022","unstructured":"Ascari, F., Bruni, R., Gori, R.: Limits and difficulties in the design of under-approximation abstract domains. In: FoSSaCS 2022. LNCS, vol. 13242, pp. 21\u201339. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-99253-8_2"},{"issue":"5","key":"12_CR2","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1016\/j.comgeo.2009.09.002","volume":"43","author":"R Bagnara","year":"2010","unstructured":"Bagnara, R., Hill, P.M., Zaffanella, E.: Exact join detection for convex polyhedra and other numerical abstractions. Comput. Geom. 43(5), 453\u2013473 (2010). https:\/\/doi.org\/10.1016\/j.comgeo.2009.09.002","journal-title":"Comput. Geom."},{"key":"12_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/11823230_15","volume-title":"Static Analysis","author":"G Balakrishnan","year":"2006","unstructured":"Balakrishnan, G., Reps, T.: Recency-abstraction for heap-allocated storage. In: Yi, K. (ed.) SAS 2006. LNCS, vol. 4134, pp. 221\u2013239. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11823230_15"},{"key":"12_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/978-3-662-53413-7_5","volume-title":"Static Analysis","author":"G Balatsouras","year":"2016","unstructured":"Balatsouras, G., Smaragdakis, Y.: Structure-sensitive points-to analysis for C and C++. In: Rival, X. (ed.) SAS 2016. LNCS, vol. 9837, pp. 84\u2013104. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53413-7_5"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Black, P.E.: Juliet 1.3 test suite: changes from 1.2. US department of commerce, national institute of standards and technology (2018). https:\/\/samate.nist.gov\/SARD\/test-suites\/112","DOI":"10.6028\/NIST.TN.1995"},{"key":"12_CR6","doi-asserted-by":"publisher","unstructured":"Bourdoncle, F.: Abstract debugging of higher-order imperative languages. In: Proceedings of the ACM SIGPLAN 1993 Conference on Programming Language Design and Implementation, p. 46\u201355. PLDI 1993, Association for Computing Machinery, New York, NY, USA (1993). https:\/\/doi.org\/10.1145\/155090.155095","DOI":"10.1145\/155090.155095"},{"key":"12_CR7","doi-asserted-by":"publisher","unstructured":"Bruni, R., Giacobazzi, R., Gori, R., Ranzato, F.: A correctness and incorrectness program logic. J. ACM 70(2) (2023). https:\/\/doi.org\/10.1145\/3582267","DOI":"10.1145\/3582267"},{"key":"12_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/978-3-642-20398-5_33","volume-title":"NASA Formal Methods","author":"C Calcagno","year":"2011","unstructured":"Calcagno, C., Distefano, D.: Infer: an automatic program verifier for memory safety of C programs. In: Bobaru, M., Havelund, K., Holzmann, G.J., Joshi, R. (eds.) NFM 2011. LNCS, vol. 6617, pp. 459\u2013465. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20398-5_33"},{"key":"12_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-00515-2_1","volume-title":"Logic-Based Program Synthesis and Transformation","author":"C Calcagno","year":"2009","unstructured":"Calcagno, C., Distefano, D., O\u2019Hearn, P., Yang, H.: Space invading systems code. In: Hanus, M. (ed.) LOPSTR 2008. LNCS, vol. 5438, pp. 1\u20133. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00515-2_1"},{"key":"12_CR10","doi-asserted-by":"publisher","unstructured":"Calcagno, C., Distefano, D., O\u2019Hearn, P.W., Yang, H.: Compositional shape analysis by means of bi-abduction. J. ACM 58(6) (2011). https:\/\/doi.org\/10.1145\/2049697.2049700","DOI":"10.1145\/2049697.2049700"},{"key":"12_CR11","doi-asserted-by":"publisher","unstructured":"Chang, B.Y.E., Rival, X.: Relational inductive shape analysis. In: Proceedings of the 35th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 247\u2013260. POPL 2008, Association for Computing Machinery, New York, NY, USA (2008). https:\/\/doi.org\/10.1145\/1328438.1328469","DOI":"10.1145\/1328438.1328469"},{"key":"12_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1007\/978-3-540-74061-2_24","volume-title":"Static Analysis","author":"B-YE Chang","year":"2007","unstructured":"Chang, B.-Y.E., Rival, X., Necula, G.C.: Shape analysis with structural invariant checkers. In: Nielson, H.R., Fil\u00e9, G. (eds.) SAS 2007. LNCS, vol. 4634, pp. 384\u2013401. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74061-2_24"},{"key":"12_CR13","volume-title":"Principles of Abstract Interpretation","author":"P Cousot","year":"2021","unstructured":"Cousot, P.: Principles of Abstract Interpretation. The MIT Press, Cambridge (2021)"},{"key":"12_CR14","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: Proceedings of the 4th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, pp. 238\u2013252. POPL 1977, Association for Computing Machinery, New York, NY, USA (1977). https:\/\/doi.org\/10.1145\/512950.512973","DOI":"10.1145\/512950.512973"},{"key":"12_CR15","doi-asserted-by":"publisher","unstructured":"Cousot, P., Cousot, R.: Systematic design of program analysis frameworks. In: Proceedings of the 6th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, pp. 269\u2013282. POPL 1979, Association for Computing Machinery, New York, NY, USA (1979). https:\/\/doi.org\/10.1145\/567752.567778","DOI":"10.1145\/567752.567778"},{"issue":"2","key":"12_CR16","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/0743-1066(92)90030-7","volume":"13","author":"P Cousot","year":"1992","unstructured":"Cousot, P., Cousot, R.: Abstract interpretation and application to logic programs. J. Logic Program. 13(2), 103\u2013179 (1992). https:\/\/doi.org\/10.1016\/0743-1066(92)90030-7","journal-title":"J. Logic Program."},{"issue":"1","key":"12_CR17","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1023\/A:1008649901864","volume":"6","author":"P Cousot","year":"1999","unstructured":"Cousot, P., Cousot, R.: Refining model checking by abstract interpretation. Autom. Softw. Eng. 6(1), 69\u201395 (1999). https:\/\/doi.org\/10.1023\/A:1008649901864","journal-title":"Autom. Softw. Eng."},{"key":"12_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1007\/978-3-642-18275-4_12","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"P Cousot","year":"2011","unstructured":"Cousot, P., Cousot, R., Logozzo, F.: Precondition inference from intermittent assertions and application to contracts on collections. In: Jhala, R., Schmidt, D. (eds.) VMCAI 2011. LNCS, vol. 6538, pp. 150\u2013168. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-18275-4_12"},{"key":"12_CR19","doi-asserted-by":"publisher","unstructured":"Cousot, P., Halbwachs, N.: Automatic discovery of linear restraints among variables of a program. In: Proceedings of the 5th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, pp. 84\u201396. POPL 1978, Association for Computing Machinery, New York, NY, USA (1978). https:\/\/doi.org\/10.1145\/512760.512770","DOI":"10.1145\/512760.512770"},{"key":"12_CR20","doi-asserted-by":"publisher","unstructured":"Floyd, R.W.: Assigning meanings to programs, pp. 65\u201381. Springer Netherlands, Dordrecht (1993). https:\/\/doi.org\/10.1007\/978-94-011-1793-7_4","DOI":"10.1007\/978-94-011-1793-7_4"},{"key":"12_CR21","doi-asserted-by":"publisher","unstructured":"Giet, J., Ridoux, F., Rival, X.: A product of shape and sequence abstractions. In: Hermenegildo, M.V., Morales, J.F. (eds.) Static Analysis, pp. 310\u2013342. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-44245-2_15","DOI":"10.1007\/978-3-031-44245-2_15"},{"key":"12_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1007\/978-3-540-24730-2_38","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"D Gopan","year":"2004","unstructured":"Gopan, D., DiMaio, F., Dor, N., Reps, T., Sagiv, M.: Numeric domains with summarized dimensions. In: Jensen, K., Podelski, A. (eds.) TACAS 2004. LNCS, vol. 2988, pp. 512\u2013529. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24730-2_38"},{"key":"12_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/978-3-319-66706-5_8","volume-title":"Static Analysis","author":"A Gurfinkel","year":"2017","unstructured":"Gurfinkel, A., Navas, J.A.: A context-sensitive memory model for verification of C\/C++ programs. In: Ranzato, F. (ed.) SAS 2017. LNCS, vol. 10422, pp. 148\u2013168. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-66706-5_8"},{"key":"12_CR24","doi-asserted-by":"publisher","unstructured":"Hind, M.: Pointer analysis: haven\u2019t we solved this problem yet? In: Proceedings of the 2001 ACM SIGPLAN-SIGSOFT Workshop on Program Analysis for Software Tools and Engineering, pp. 54\u201361. PASTE 2001, Association for Computing Machinery, New York, NY, USA (2001). https:\/\/doi.org\/10.1145\/379605.379665","DOI":"10.1145\/379605.379665"},{"issue":"10","key":"12_CR25","doi-asserted-by":"publisher","first-page":"576","DOI":"10.1145\/363235.363259","volume":"12","author":"CAR Hoare","year":"1969","unstructured":"Hoare, C.A.R.: An axiomatic basis for computer programming. Commun. ACM 12(10), 576\u2013580 (1969). https:\/\/doi.org\/10.1145\/363235.363259","journal-title":"Commun. ACM"},{"key":"12_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-030-41600-3_1","volume-title":"Verified Software. Theories, Tools, and Experiments","author":"M Journault","year":"2020","unstructured":"Journault, M., Min\u00e9, A., Monat, R., Ouadjaout, A.: Combinations of reusable abstract domains for a multilingual static analyzer. In: Chakraborty, S., Navas, J.A. (eds.) VSTTE 2019. LNCS, vol. 12031, pp. 1\u201318. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-41600-3_1"},{"key":"12_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/978-3-319-99725-4_16","volume-title":"Static Analysis","author":"M Journault","year":"2018","unstructured":"Journault, M., Min\u00e9, A., Ouadjaout, A.: Modular static analysis of string manipulations in C programs. In: Podelski, A. (ed.) SAS 2018. LNCS, vol. 11002, pp. 243\u2013262. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-99725-4_16"},{"key":"12_CR28","doi-asserted-by":"publisher","unstructured":"Lattner, C., Lenharth, A., Adve, V.: Making context-sensitive points-to analysis with heap cloning practical for the real world. In: Proceedings of the 28th ACM SIGPLAN Conference on Programming Language Design and Implementation, pp. 278\u2013289. PLDI 2007, Association for Computing Machinery, New York, NY, USA (2007). https:\/\/doi.org\/10.1145\/1250734.1250766","DOI":"10.1145\/1250734.1250766"},{"key":"12_CR29","doi-asserted-by":"publisher","unstructured":"Le, Q.L., Raad, A., Villard, J., Berdine, J., Dreyer, D., O\u2019Hearn, P.W.: Finding real bugs in big programs with incorrectness logic. Proc. ACM Program. Lang. 6(OOPSLA1) (2022). https:\/\/doi.org\/10.1145\/3527325","DOI":"10.1145\/3527325"},{"key":"12_CR30","unstructured":"Lev-Ami, T., Sagiv, M., Reps, T., Gulwani, S.: Backward analysis for inferring quantified preconditions (2007)"},{"key":"12_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/978-3-662-48288-9_6","volume-title":"Static Analysis","author":"H Li","year":"2015","unstructured":"Li, H., Rival, X., Chang, B.-Y.E.: Shape analysis for unstructured sharing. In: Blazy, S., Jensen, T. (eds.) SAS 2015. LNCS, vol. 9291, pp. 90\u2013108. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48288-9_6"},{"key":"12_CR32","doi-asserted-by":"publisher","unstructured":"Milanese, M., Min\u00e9, A.: Generation of violation witnesses by under-approximating abstract interpretation. In: Dimitrova, R., Lahav, O., Wolff, S. (eds.) Verification, Model Checking, and Abstract Interpretation, pp. 50\u201373. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-50524-9_3","DOI":"10.1007\/978-3-031-50524-9_3"},{"key":"12_CR33","doi-asserted-by":"publisher","unstructured":"Milanese, M., Min\u00e9, A.: Artifact of paper: \u201cUnder-approximating Memory Abstractions\" (2024). https:\/\/doi.org\/10.5281\/zenodo.11217437","DOI":"10.5281\/zenodo.11217437"},{"key":"12_CR34","doi-asserted-by":"publisher","unstructured":"Min\u00e9, A.: Field-sensitive value analysis of embedded c programs with union types and pointer arithmetics. In: Proceedings of the 2006 ACM SIGPLAN\/SIGBED Conference on Language, Compilers, and Tool Support for Embedded Systems, pp. 54\u201363. LCTES 2006, Association for Computing Machinery, New York, NY, USA (2006). https:\/\/doi.org\/10.1145\/1134650.1134659","DOI":"10.1145\/1134650.1134659"},{"key":"12_CR35","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1016\/j.scico.2013.09.014","volume":"93","author":"A Min\u00e9","year":"2014","unstructured":"Min\u00e9, A.: Backward under-approximations in numeric abstract domains to automatically infer sufficient program conditions. Sci. Comput. Program. 93, 154\u2013182 (2014). https:\/\/doi.org\/10.1016\/j.scico.2013.09.014. special Issue on Invariant Generation","journal-title":"Sci. Comput. Program."},{"key":"12_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/978-3-540-78163-9_18","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"Y Moy","year":"2008","unstructured":"Moy, Y.: Sufficient preconditions for modular assertion checking. In: Logozzo, F., Peled, D.A., Zuck, L.D. (eds.) VMCAI 2008. LNCS, vol. 4905, pp. 188\u2013202. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78163-9_18"},{"key":"12_CR37","doi-asserted-by":"publisher","unstructured":"O\u2019Hearn, P.W.: Incorrectness logic. Proc. ACM Program. Lang. 4(POPL) (2019). https:\/\/doi.org\/10.1145\/3371078","DOI":"10.1145\/3371078"},{"key":"12_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/978-3-030-65474-0_11","volume-title":"Static Analysis","author":"A Ouadjaout","year":"2020","unstructured":"Ouadjaout, A., Min\u00e9, A.: A library modeling language for the static analysis of C programs. In: Pichardie, D., Sighireanu, M. (eds.) SAS 2020. LNCS, vol. 12389, pp. 223\u2013247. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-65474-0_11"},{"key":"12_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/978-3-030-53291-8_14","volume-title":"Computer Aided Verification","author":"A Raad","year":"2020","unstructured":"Raad, A., Berdine, J., Dang, H.-H., Dreyer, D., O\u2019Hearn, P., Villard, J.: Local reasoning about the presence of bugs: incorrectness separation logic. In: Lahiri, S.K., Wang, C. (eds.) CAV 2020. LNCS, vol. 12225, pp. 225\u2013252. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-53291-8_14"},{"key":"12_CR40","doi-asserted-by":"publisher","unstructured":"Remil, N.M., Urban, C., Min\u00e9, A.: Automatic detection of vulnerable variables for CTL properties of programs. In: Bjorner, N., Heule, M., Voronkov, A. (eds.) Proceedings of 25th Conference on Logic for Programming, Artificial Intelligence and Reasoning. EPiC Series in Computing, vol.\u00a0100, pp. 116\u2013126. EasyChair (2024). https:\/\/doi.org\/10.29007\/dnpx, https:\/\/easychair.org\/publications\/paper\/n5Rq","DOI":"10.29007\/dnpx"},{"key":"12_CR41","doi-asserted-by":"publisher","unstructured":"Reynolds, J.: Separation logic: a logic for shared mutable data structures. In: Proceedings 17th Annual IEEE Symposium on Logic in Computer Science, pp. 55\u201374 (2002). https:\/\/doi.org\/10.1109\/LICS.2002.1029817","DOI":"10.1109\/LICS.2002.1029817"},{"key":"12_CR42","unstructured":"Rival, X.: https:\/\/www.di.ens.fr\/~rival\/memcad.html"},{"key":"12_CR43","doi-asserted-by":"publisher","unstructured":"Schmidt, D.A.: A calculus of logical relations for over- and underapproximating static analyses. Sci. Comput. Program. 64(1), 29\u201353 (2007). https:\/\/doi.org\/10.1016\/j.scico.2006.03.008, special issue on the 11th Static Analysis Symposium - SAS 2004","DOI":"10.1016\/j.scico.2006.03.008"},{"key":"12_CR44","doi-asserted-by":"publisher","unstructured":"Steensgaard, B.: Points-to analysis by type inference of programs with structures and unions. In: Proceedings of the 6th International Conference on Compiler Construction, pp. 136\u2013150. CC 1996, Springer, Heidelberg (1996). https:\/\/doi.org\/10.5555\/647473.727458","DOI":"10.5555\/647473.727458"},{"key":"12_CR45","doi-asserted-by":"publisher","unstructured":"Steensgaard, B.: Points-to analysis in almost linear time. In: Proceedings of the 23rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 32\u201341. POPL 1996, Association for Computing Machinery, New York, NY, USA (1996). https:\/\/doi.org\/10.1145\/237721.237727","DOI":"10.1145\/237721.237727"},{"key":"12_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1007\/978-3-319-99725-4_24","volume-title":"Static Analysis","author":"C Urban","year":"2018","unstructured":"Urban, C., Ueltschi, S., M\u00fcller, P.: Abstract interpretation of CTL properties. In: Podelski, A. (ed.) SAS 2018. LNCS, vol. 11002, pp. 402\u2013422. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-99725-4_24"},{"key":"12_CR47","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/978-3-642-24690-6_12","volume-title":"Software Engineering and Formal Methods","author":"E de Vries","year":"2011","unstructured":"de Vries, E., Koutavas, V.: Reverse hoare logic. In: Barthe, G., Pardo, A., Schneider, G. (eds.) SEFM 2011. LNCS, vol. 7041, pp. 155\u2013171. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-24690-6_12"},{"key":"12_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1007\/978-3-319-52234-0_29","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"W Wang","year":"2017","unstructured":"Wang, W., Barrett, C., Wies, T.: Partitioned memory models for program analysis. In: Bouajjani, A., Monniaux, D. (eds.) VMCAI 2017. LNCS, vol. 10145, pp. 539\u2013558. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-52234-0_29"}],"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_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T05:35:07Z","timestamp":1737351307000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-74776-2_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031747755","9783031747762"],"references-count":48,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-74776-2_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"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"}}]}}