{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,20]],"date-time":"2025-07-20T04:06:32Z","timestamp":1752984392695,"version":"3.40.3"},"publisher-location":"Cham","reference-count":54,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030888053"},{"type":"electronic","value":"9783030888060"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-88806-0_2","type":"book-chapter","created":{"date-parts":[[2021,10,13]],"date-time":"2021-10-13T17:25:06Z","timestamp":1634145906000},"page":"25-48","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Hash Consed Points-To Sets"],"prefix":"10.1007","author":[{"given":"Mohamad","family":"Barbar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yulei","family":"Sui","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,10,13]]},"reference":[{"key":"2_CR1","unstructured":"Andersen, L.O.: Program analysis and specialization for the C programming language. Ph.D. thesis, University of Copenhagen, Denmark (1994)"},{"key":"2_CR2","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":"2_CR3","doi-asserted-by":"publisher","unstructured":"Ball, T., Rajamani, S.K.: Bebop: a path-sensitive interprocedural dataflow engine. In: Proceedings of the 2001 ACM SIGPLAN-SIGSOFT Workshop on Program Analysis for Software Tools and Engineering, PASTE 2001, pp. 97\u2013103. ACM, USA (2001). https:\/\/doi.org\/10.1145\/379605.379690","DOI":"10.1145\/379605.379690"},{"key":"2_CR4","doi-asserted-by":"publisher","unstructured":"Barbar, M., Sui, Y., Chen, S.: Object versioning for flow-sensitive pointer analysis. In: 2021 IEEE\/ACM International Symposium on Code Generation and Optimization, CGO 2021, pp. 222\u2013235. IEEE Computer Society, USA (2021). https:\/\/doi.org\/10.1109\/CGO51591.2021.9370334","DOI":"10.1109\/CGO51591.2021.9370334"},{"key":"2_CR5","doi-asserted-by":"publisher","unstructured":"Berndl, M., Lhot\u00e1k, O., Qian, F., Hendren, L., Umanee, N.: Points-to analysis using BDDs. In: Proceedings of the ACM SIGPLAN 2003 Conference on Programming Language Design and Implementation, PLDI 2003, pp. 103\u2013114. ACM, USA (2003). https:\/\/doi.org\/10.1145\/781131.781144","DOI":"10.1145\/781131.781144"},{"key":"2_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/978-3-642-23702-7_9","volume-title":"Static Analysis","author":"S Blackshear","year":"2011","unstructured":"Blackshear, S., Chang, B.-Y.E., Sankaranarayanan, S., Sridharan, M.: The flow-insensitive precision of Andersen\u2019s analysis in practice. In: Yahav, E. (ed.) SAS 2011. LNCS, vol. 6887, pp. 60\u201376. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-23702-7_9"},{"issue":"3","key":"2_CR7","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/s10817-014-9306-0","volume":"53","author":"T Braibant","year":"2014","unstructured":"Braibant, T., Jourdan, J.H., Monniaux, D.: Implementing and reasoning about hash-consed data structures in Coq. J. Autom. Reason. 53(3), 271\u2013304 (2014). https:\/\/doi.org\/10.1007\/s10817-014-9306-0","journal-title":"J. Autom. Reason."},{"key":"2_CR8","doi-asserted-by":"publisher","unstructured":"Bravenboer, M., Smaragdakis, Y.: Strictly declarative specification of sophisticated points-to analyses. In: Proceedings of the 24th ACM SIGPLAN Conference on Object Oriented Programming Systems Languages and Applications, OOPSLA 2009, pp. 243\u2013262. ACM, USA (2009). https:\/\/doi.org\/10.1145\/1640089.1640108","DOI":"10.1145\/1640089.1640108"},{"key":"2_CR9","unstructured":"Chen, H., et al.: MUZZ: thread-aware grey-box fuzzing for effective bug hunting in multithreaded programs. In: 29th USENIX Security Symposium, USENIX Security 2020, pp. 2325\u20132342 (2020)"},{"issue":"3","key":"2_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3436877","volume":"30","author":"X Cheng","year":"2021","unstructured":"Cheng, X., Wang, H., Hua, J., Xu, G., Sui, Y.: DeepWukong: statically detecting software vulnerabilities using deep graph neural network. ACM Trans. Softw. Eng. Methodol. (TOSEM) 30(3), 1\u201333 (2021). https:\/\/doi.org\/10.1145\/3436877","journal-title":"ACM Trans. Softw. Eng. Methodol. (TOSEM)"},{"issue":"8","key":"2_CR11","doi-asserted-by":"publisher","first-page":"818","DOI":"10.1016\/j.infsof.2011.03.003","volume":"53","author":"W Choi","year":"2011","unstructured":"Choi, W., Choe, K.M.: Cycle elimination for invocation graph-based context-sensitive pointer analysis. Inf. Softw. Technol. 53(8), 818\u2013833 (2011). https:\/\/doi.org\/10.1016\/j.infsof.2011.03.003","journal-title":"Inf. Softw. Technol."},{"key":"2_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/978-3-642-33826-7_16","volume-title":"Software Engineering and Formal Methods","author":"P Cuoq","year":"2012","unstructured":"Cuoq, P., Kirchner, F., Kosmatov, N., Prevosto, V., Signoles, J., Yakobowski, B.: Frama-C. In: Eleftherakis, G., Hinchey, M., Holcombe, M. (eds.) SEFM 2012. LNCS, vol. 7504, pp. 233\u2013247. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33826-7_16"},{"key":"2_CR13","doi-asserted-by":"publisher","unstructured":"F\u00e4hndrich, M., Foster, J.S., Su, Z., Aiken, A.: Partial online cycle elimination in inclusion constraint graphs. In: Proceedings of the ACM SIGPLAN 1998 Conference on Programming Language Design and Implementation, PLDI 1998, pp. 85\u201396. ACM, USA (1998). https:\/\/doi.org\/10.1145\/277650.277667","DOI":"10.1145\/277650.277667"},{"key":"2_CR14","doi-asserted-by":"publisher","unstructured":"Fan, X., Sui, Y., Liao, X., Xue, J.: Boosting the precision of virtual call integrity protection with partial pointer analysis for C++. In: Proceedings of the 26th ACM SIGSOFT International Symposium on Software Testing and Analysis, ISSTA 2017, pp. 329\u2013340. ACM, USA (2017). https:\/\/doi.org\/10.1145\/3092703.3092729","DOI":"10.1145\/3092703.3092729"},{"key":"2_CR15","doi-asserted-by":"publisher","unstructured":"Farkhani, R.M., Jafari, S., Arshad, S., Robertson, W., Kirda, E., Okhravi, H.: On the effectiveness of type-based control flow integrity. In: Proceedings of the 34th Annual Computer Security Applications Conference, ACSAC 2018, pp. 28\u201339. ACM, USA (2018). https:\/\/doi.org\/10.1145\/3274694.3274739","DOI":"10.1145\/3274694.3274739"},{"key":"2_CR16","doi-asserted-by":"publisher","unstructured":"Filli\u00e2tre, J.C., Conchon, S.: Type-safe modular hash-consing. In: Proceedings of the 2006 Workshop on ML, ML 2006, pp. 12\u201319. ACM, USA (2006). https:\/\/doi.org\/10.1145\/1159876.1159880","DOI":"10.1145\/1159876.1159880"},{"key":"2_CR17","doi-asserted-by":"publisher","unstructured":"Fink, S.J., Yahav, E., Dor, N., Ramalingam, G., Geay, E.: Effective typestate verification in the presence of aliasing. ACM Trans. Softw. Eng. Methodol. 17(2) (2008). https:\/\/doi.org\/10.1145\/1348250.1348255","DOI":"10.1145\/1348250.1348255"},{"key":"2_CR18","unstructured":"Gosling, J., Joy, B., Steele, G.L., Bracha, G., Buckley, A.: The Java Language Specification, Java SE 8 Edition, 1st edn. Addison-Wesley Professional (2014)"},{"key":"2_CR19","unstructured":"Goubault, J.: Implementing functional languages with fast equality, sets and maps: an exercise in hash consing. Journ\u00e9es Francophones des Langages Applicatifs, 222\u2013238 (1994)"},{"key":"2_CR20","doi-asserted-by":"publisher","unstructured":"Hardekopf, B., Lin, C.: The ant and the grasshopper: fast and accurate pointer analysis for millions of lines of code. In: Proceedings of the 28th ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2007, pp. 290\u2013299. ACM, USA (2007). https:\/\/doi.org\/10.1145\/1250734.1250767","DOI":"10.1145\/1250734.1250767"},{"key":"2_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/978-3-540-74061-2_17","volume-title":"Static Analysis","author":"B Hardekopf","year":"2007","unstructured":"Hardekopf, B., Lin, C.: Exploiting pointer and location equivalence to optimize pointer analysis. In: Nielson, H.R., Fil\u00e9, G. (eds.) SAS 2007. LNCS, vol. 4634, pp. 265\u2013280. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74061-2_17"},{"key":"2_CR22","doi-asserted-by":"publisher","unstructured":"Hardekopf, B., Lin, C.: Semi-sparse flow-sensitive pointer analysis. In: Proceedings of the 36th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2009, pp. 226\u2013238. ACM, USA (2009). https:\/\/doi.org\/10.1145\/1480881.1480911","DOI":"10.1145\/1480881.1480911"},{"key":"2_CR23","doi-asserted-by":"publisher","unstructured":"Hardekopf, B., Lin, C.: Flow-sensitive pointer analysis for millions of lines of code. In: Proceedings of the 9th Annual IEEE\/ACM International Symposium on Code Generation and Optimization, CGO 2011, pp. 289\u2013298. IEEE Computer Society, USA (2011). https:\/\/doi.org\/10.1109\/CGO.2011.5764696","DOI":"10.1109\/CGO.2011.5764696"},{"key":"2_CR24","unstructured":"Hash consing (2020). https:\/\/en.wikipedia.org\/wiki\/Hash_consing"},{"key":"2_CR25","unstructured":"Heintze, N.: Analysis of large code bases: the compile-link-analyze model (1999, unpublished). http:\/\/web.archive.org\/web\/20050513012825\/cm.bell-labs.com\/cm\/cs\/who\/nch\/cla.ps"},{"key":"2_CR26","doi-asserted-by":"publisher","unstructured":"Heintze, N., Tardieu, O.: Ultra-fast aliasing analysis using CLA: a million lines of C code in a second. In: Proceedings of the ACM SIGPLAN 2001 Conference on Programming Language Design and Implementation, PLDI 2001, pp. 254\u2013263. ACM, USA (2001). https:\/\/doi.org\/10.1145\/378795.378855","DOI":"10.1145\/378795.378855"},{"key":"2_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/978-3-642-18070-5_7","volume-title":"Formal Verification of Object-Oriented Software","author":"L Hubert","year":"2011","unstructured":"Hubert, L., et al.: Sawja: static analysis workshop for Java. In: Beckert, B., March\u00e9, C. (eds.) FoVeOOS 2010. LNCS, vol. 6528, pp. 92\u2013106. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-18070-5_7"},{"key":"2_CR28","doi-asserted-by":"publisher","unstructured":"Lattner, C., Adve, V.: LLVM: a compilation framework for lifelong program analysis & transformation. In: Proceedings of the International Symposium on Code Generation and Optimization: Feedback-Directed and Runtime Optimization, CGO 2004, p. 75. IEEE Computer Society, USA (2004). https:\/\/doi.org\/10.1109\/CGO.2004.1281665","DOI":"10.1109\/CGO.2004.1281665"},{"key":"2_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/978-3-030-32304-2_3","volume-title":"Static Analysis","author":"Y Lei","year":"2019","unstructured":"Lei, Y., Sui, Y.: Fast and precise handling of positive weight cycles for field-sensitive pointer analysis. In: Chang, B.-Y.E. (ed.) SAS 2019. LNCS, vol. 11822, pp. 27\u201347. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-32304-2_3"},{"key":"2_CR30","doi-asserted-by":"publisher","unstructured":"Lhot\u00e1k, O., Chung, K.C.A.: Points-to analysis with efficient strong updates. In: Proceedings of the 38th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2011, pp. 3\u201316. ACM, USA (2011). https:\/\/doi.org\/10.1145\/1926385.1926389","DOI":"10.1145\/1926385.1926389"},{"key":"2_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/3-540-36579-6_12","volume-title":"Compiler Construction","author":"O Lhot\u00e1k","year":"2003","unstructured":"Lhot\u00e1k, O., Hendren, L.: Scaling Java points-to analysis using Spark. In: Hedin, G. (ed.) CC 2003. LNCS, vol. 2622, pp. 153\u2013169. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36579-6_12"},{"key":"2_CR32","doi-asserted-by":"publisher","unstructured":"Livshits, V.B., Lam, M.S.: Tracking pointers with path and context sensitivity for bug detection in C programs. In: Proceedings of the 9th European Software Engineering Conference Held Jointly with 11th ACM SIGSOFT International Symposium on Foundations of Software Engineering, ESEC\/FSE 2011, pp. 317\u2013326. ACM, USA (2003). https:\/\/doi.org\/10.1145\/940071.940114","DOI":"10.1145\/940071.940114"},{"key":"2_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/3-540-45789-5_16","volume-title":"Static Analysis","author":"R Manevich","year":"2002","unstructured":"Manevich, R., Ramalingam, G., Field, J., Goyal, D., Sagiv, M.: Compactly representing first-order structures for static analysis. In: Hermenegildo, M.V., Puebla, G. (eds.) SAS 2002. LNCS, vol. 2477, pp. 196\u2013212. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45789-5_16"},{"key":"2_CR34","doi-asserted-by":"publisher","unstructured":"Pearce, D.J., Kelly, P.H., Hankin, C.: Online cycle detection and difference propagation for pointer analysis. In: Proceedings of the Third IEEE International Workshop on Source Code Analysis and Manipulation, SCAM 2003, pp. 3\u201312. IEEE Computer Society, USA (2003). https:\/\/doi.org\/10.1109\/SCAM.2003.1238026","DOI":"10.1109\/SCAM.2003.1238026"},{"key":"2_CR35","doi-asserted-by":"publisher","unstructured":"Pearce, D.J., Kelly, P.H., Hankin, C.: Efficient field-sensitive pointer analysis of C. ACM Trans. Program. Lang. Syst. 30(1), 4:1\u20134:42 (2007). https:\/\/doi.org\/10.1145\/1290520.1290524","DOI":"10.1145\/1290520.1290524"},{"key":"2_CR36","doi-asserted-by":"publisher","unstructured":"Pereira, F.M.Q., Berlin, D.: Wave propagation and deep propagation for pointer analysis. In: Proceedings of the 7th Annual IEEE\/ACM International Symposium on Code Generation and Optimization, CGO 2009, pp. 126\u2013135. IEEE Computer Society, USA (2009). https:\/\/doi.org\/10.1109\/CGO.2009.9","DOI":"10.1109\/CGO.2009.9"},{"key":"2_CR37","doi-asserted-by":"publisher","unstructured":"Pratikakis, P., Foster, J.S., Hicks, M.: LOCKSMITH: context-sensitive correlation analysis for race detection. In: Proceedings of the 27th ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2006, pp. 320\u2013331. ACM, USA (2006). https:\/\/doi.org\/10.1145\/1133981.1134019","DOI":"10.1145\/1133981.1134019"},{"key":"2_CR38","unstructured":"What is Referential Transparency? (2017). https:\/\/www.sitepoint.com\/what-is-referential-transparency"},{"key":"2_CR39","doi-asserted-by":"publisher","unstructured":"Rountev, A., Chandra, S.: Off-line variable substitution for scaling points-to analysis. In: Proceedings of the ACM SIGPLAN 2000 Conference on Programming Language Design and Implementation, PLDI 2000, pp. 47\u201356. ACM, USA (2000). https:\/\/doi.org\/10.1145\/349299.349310","DOI":"10.1145\/349299.349310"},{"key":"2_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/978-3-030-17465-1_22","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"PD Schubert","year":"2019","unstructured":"Schubert, P.D., Hermann, B., Bodden, E.: PhASAR: an inter-procedural static analysis framework for C\/C++. In: Vojnar, T., Zhang, L. (eds.) TACAS 2019. LNCS, vol. 11428, pp. 393\u2013410. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17465-1_22"},{"key":"2_CR41","doi-asserted-by":"crossref","unstructured":"Smaragdakis, Y., Bravenboer, M., Lhot\u00e1k, O.: Pick your contexts well: understanding object-sensitivity. In: Proceedings of the 38th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2011, pp. 17\u201330. ACM, USA (2011)","DOI":"10.1145\/1925844.1926390"},{"issue":"6","key":"2_CR42","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1007\/BF00277387","volume":"27","author":"H Sondergaard","year":"1990","unstructured":"Sondergaard, H., Sestoft, P.: Referential transparency, definiteness and unfoldability. Acta Informatica 27(6), 505\u2013517 (1990)","journal-title":"Acta Informatica"},{"key":"2_CR43","unstructured":"Soot (2021). https:\/\/github.com\/soot-oss\/soot"},{"key":"2_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/978-3-642-03237-0_15","volume-title":"Static Analysis","author":"M Sridharan","year":"2009","unstructured":"Sridharan, M., Fink, S.J.: The complexity of Andersen\u2019s analysis in practice. In: Palsberg, J., Su, Z. (eds.) SAS 2009. LNCS, vol. 5673, pp. 205\u2013221. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03237-0_15"},{"key":"2_CR45","doi-asserted-by":"publisher","unstructured":"Sui, Y., Cheng, X., Zhang, G., Wang, H.: Flow2Vec: value-flow-based precise code embedding. Proc. ACM Program. Lang. 4(OOPSLA), 1\u201327 (2020). https:\/\/doi.org\/10.1145\/3428301","DOI":"10.1145\/3428301"},{"key":"2_CR46","doi-asserted-by":"publisher","unstructured":"Sui, Y., Xue, J.: On-demand strong update analysis via value-flow refinement. In: Proceedings of the 2016 24th ACM SIGSOFT International Symposium on Foundations of Software Engineering, FSE 2016, pp. 460\u2013473. ACM, USA (2016). https:\/\/doi.org\/10.1145\/2950290.2950296","DOI":"10.1145\/2950290.2950296"},{"key":"2_CR47","doi-asserted-by":"publisher","unstructured":"Sui, Y., Xue, J.: SVF: Interprocedural static value-flow analysis in LLVM. In: Proceedings of the 25th International Conference on Compiler Construction, CC 2016, pp. 265\u2013266. ACM, USA (2016). https:\/\/doi.org\/10.1145\/2892208.2892235","DOI":"10.1145\/2892208.2892235"},{"key":"2_CR48","doi-asserted-by":"publisher","unstructured":"Trabish, D., Kapus, T., Rinetzky, N., Cadar, C.: Past-sensitive pointer analysis for symbolic execution. In: Proceedings of the 28th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering, ESEC\/FSE 2020, pp. 197\u2013208. ACM, USA (2020). https:\/\/doi.org\/10.1145\/3368089.3409698","DOI":"10.1145\/3368089.3409698"},{"key":"2_CR49","doi-asserted-by":"publisher","unstructured":"Trabish, D., Mattavelli, A., Rinetzky, N., Cadar, C.: Chopped symbolic execution. In: Proceedings of the 40th International Conference on Software Engineering, ICSE 2018, pp. 350\u2013360. ACM, USA (2018). https:\/\/doi.org\/10.1145\/3180155.3180251","DOI":"10.1145\/3180155.3180251"},{"key":"2_CR50","unstructured":"The T. J. Watson libraries for analysis (WALA) (2021). http:\/\/wala.sf.net\/"},{"key":"2_CR51","doi-asserted-by":"publisher","unstructured":"Wang, H., et al.: Typestate-guided fuzzer for discovering use-after-free vulnerabilities. In: Proceedings of the ACM\/IEEE 42nd International Conference on Software Engineering, ICSE 2020, pp. 999\u20131010. ACM, USA (2020). https:\/\/doi.org\/10.1145\/3377811.3380386","DOI":"10.1145\/3377811.3380386"},{"key":"2_CR52","unstructured":"Whaley, J.: Context-sensitive pointer analysis using binary decision diagrams. Ph.D. thesis, Stanford University, USA (2007)"},{"key":"2_CR53","doi-asserted-by":"publisher","unstructured":"Yan, H., Sui, Y., Chen, S., Xue, J.: Spatio-temporal context reduction: a pointer-analysis-based static approach for detecting use-after-free vulnerabilities. In: Proceedings of the 40th International Conference on Software Engineering, ICSE 2018, pp. 327\u2013337. ACM, USA (2018). https:\/\/doi.org\/10.1145\/3180155.3180178","DOI":"10.1145\/3180155.3180178"},{"key":"2_CR54","doi-asserted-by":"publisher","unstructured":"Zhu, J., Calman, S.: Symbolic pointer analysis revisited. In: Proceedings of the ACM SIGPLAN 2004 Conference on Programming Language Design and Implementation, PLDI 2004, pp. 145\u2013157. ACM, USA (2004). https:\/\/doi.org\/10.1145\/996841.996860","DOI":"10.1145\/996841.996860"}],"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-030-88806-0_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,13]],"date-time":"2021-10-13T17:26:16Z","timestamp":1634145976000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-88806-0_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030888053","9783030888060"],"references-count":54,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-88806-0_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"13 October 2021","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":"Chicago, IL","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 October 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 October 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sas2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/staticanalysis.org\/","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":"40","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":"18","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":"4","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":"45% - 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":"6","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)"}}]}}