{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T01:03:55Z","timestamp":1780448635534,"version":"3.54.1"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031069741","type":"print"},{"value":"9783031069758","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-06975-8_29","type":"book-chapter","created":{"date-parts":[[2022,6,2]],"date-time":"2022-06-02T19:03:42Z","timestamp":1654196622000},"page":"507-523","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An Efficient Use-after-Free Mitigation Approach via\u00a0Static Dangling Pointer Nullification"],"prefix":"10.1007","author":[{"given":"Yue","family":"Yu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiaoqi","family":"Jia","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xun","family":"An","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shengzhi","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,6,3]]},"reference":[{"key":"29_CR1","unstructured":"Akritidis, P., et al.: Cling: a memory allocator to mitigate dangling pointers. In: USENIX Security Symposium, pp. 177\u2013192. Washington DC (2010)"},{"key":"29_CR2","unstructured":"Andersen, L.O.: Program analysis and specialization for the C programming language. Ph.D. thesis (1994)"},{"key":"29_CR3","doi-asserted-by":"crossref","unstructured":"Berger, E.D., Zorn, B.G.: Diehard: probabilistic memory safety for unsafe languages. 41, 158\u2013168. ACM New York, NY, USA (2006)","DOI":"10.1145\/1133255.1134000"},{"key":"29_CR4","doi-asserted-by":"crossref","unstructured":"Caballero, J., Grieco, G., Marron, M., Nappa, A.: Undangle: early detection of dangling pointers in use-after-free and double-free vulnerabilities. In: Proceedings of the 2012 International Symposium on Software Testing and Analysis, pp. 133\u2013143 (2012)","DOI":"10.1145\/2338965.2336769"},{"key":"29_CR5","doi-asserted-by":"crossref","unstructured":"Lee, B., et al.: Preventing use-after-free with dangling pointers nullification. In: NDSS (2015)","DOI":"10.14722\/ndss.2015.23238"},{"key":"29_CR6","doi-asserted-by":"crossref","unstructured":"Liu, D., Zhang, M., Wang, H.: A robust and efficient defense against use-after-free exploits via concurrent pointer sweeping. In: Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, pp. 1635\u20131648 (2018)","DOI":"10.1145\/3243734.3243826"},{"key":"29_CR7","doi-asserted-by":"crossref","unstructured":"Nagarakatte, S., Zhao, J., Martin, M.M., Zdancewic, S.: CETS: compiler enforced temporal safety for c. In: Proceedings of the 2010 International Symposium on Memory Management, pp. 31\u201340 (2010)","DOI":"10.1145\/1806651.1806657"},{"key":"29_CR8","doi-asserted-by":"crossref","unstructured":"Novark, G., Berger, E.D.: Dieharder: securing the heap. In: Proceedings of the 17th ACM Conference on Computer and Communications Security, pp. 573\u2013584 (2010)","DOI":"10.1145\/1866307.1866371"},{"issue":"11\u201312","key":"29_CR9","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1016\/S0950-5849(98)00093-7","volume":"40","author":"T Reps","year":"1998","unstructured":"Reps, T.: Program analysis via graph reachability. Inf. Softw. Technol. 40(11\u201312), 701\u2013726 (1998)","journal-title":"Inf. Softw. Technol."},{"key":"29_CR10","doi-asserted-by":"crossref","unstructured":"Shin, J., Kwon, D., Seo, J., Cho, Y., Paek, Y.: CRCount: Pointer invalidation with reference counting to mitigate use-after-free in legacy c\/c++. In: NDSS (2019)","DOI":"10.14722\/ndss.2019.23541"},{"issue":"6","key":"29_CR11","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1145\/1133255.1134027","volume":"41","author":"M Sridharan","year":"2006","unstructured":"Sridharan, M., Bod\u00edk, R.: Refinement-based context-sensitive points-to analysis for java. ACM SIGPLAN Not. 41(6), 387\u2013400 (2006)","journal-title":"ACM SIGPLAN Not."},{"key":"29_CR12","doi-asserted-by":"crossref","unstructured":"Sui, Y., Xue, J.: SVF: interprocedural static value-flow analysis in llvm. In: Proceedings of the 25th International Conference on Compiler Construction, pp. 265\u2013266. ACM (2016)","DOI":"10.1145\/2892208.2892235"},{"issue":"8","key":"29_CR13","doi-asserted-by":"publisher","first-page":"812","DOI":"10.1109\/TSE.2018.2869336","volume":"46","author":"Y Sui","year":"2018","unstructured":"Sui, Y., Xue, J.: Value-flow-based demand-driven pointer analysis for c and c++. IEEE Trans. Softw. Eng. 46(8), 812\u2013835 (2018)","journal-title":"IEEE Trans. Softw. Eng."},{"key":"29_CR14","doi-asserted-by":"crossref","unstructured":"Van Der Kouwe, E., Nigade, V., Giuffrida, C.: Dangsan: scalable use-after-free detection. In: Proceedings of the Twelfth European Conference on Computer Systems, pp. 405\u2013419 (2017)","DOI":"10.1145\/3064176.3064211"},{"key":"29_CR15","doi-asserted-by":"crossref","unstructured":"Yan, D., Xu, G., Rountev, A.: Demand-driven context-sensitive alias analysis for java. In: Proceedings of the 2011 International Symposium on Software Testing and Analysis, pp. 155\u2013165 (2011)","DOI":"10.1145\/2001420.2001440"},{"key":"29_CR16","doi-asserted-by":"crossref","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: 2018 IEEE\/ACM 40th International Conference on Software Engineering (ICSE), pp. 327\u2013337. IEEE (2018)","DOI":"10.1145\/3180155.3180178"},{"key":"29_CR17","doi-asserted-by":"crossref","unstructured":"Younan, Y.: FreeSentry: protecting against use-after-free vulnerabilities due to dangling pointers. In: NDSS (2015)","DOI":"10.14722\/ndss.2015.23190"},{"key":"29_CR18","doi-asserted-by":"crossref","unstructured":"Zhang, Q., Lyu, M.R., Yuan, H., Su, Z.: Fast algorithms for dyck-cfl-reachability with applications to alias analysis. In: Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation, pp. 435\u2013446 (2013)","DOI":"10.1145\/2491956.2462159"},{"key":"29_CR19","doi-asserted-by":"crossref","unstructured":"Zhang, Q., Xiao, X., Zhang, C., Yuan, H., Su, Z.: Efficient subcubic alias analysis for c. In: Proceedings of the 2014 ACM International Conference on Object Oriented Programming Systems Languages & Applications, pp. 829\u2013845 (2014)","DOI":"10.1145\/2660193.2660213"},{"key":"29_CR20","doi-asserted-by":"crossref","unstructured":"Zheng, X., Rugina, R.: Demand-driven alias analysis for c. In: Proceedings of the 35th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 197\u2013208 (2008)","DOI":"10.1145\/1328438.1328464"}],"container-title":["IFIP Advances in Information and Communication Technology","ICT Systems Security and Privacy Protection"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-06975-8_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T00:05:53Z","timestamp":1780445153000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-06975-8_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031069741","9783031069758"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-06975-8_29","relation":{},"ISSN":["1868-4238","1868-422X"],"issn-type":[{"value":"1868-4238","type":"print"},{"value":"1868-422X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"3 June 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SEC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"IFIP International Conference on ICT Systems Security and Privacy Protection","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Copenhagen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Denmark","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 June 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"37","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sec2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ifipsec2022.compute.dtu.dk\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-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":"127","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":"29","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":"23% - 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":"4","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","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}