{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,12]],"date-time":"2025-11-12T14:03:20Z","timestamp":1762956200401},"publisher-location":"Cham","reference-count":62,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030323035"},{"type":"electronic","value":"9783030323042"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-32304-2_4","type":"book-chapter","created":{"date-parts":[[2019,10,5]],"date-time":"2019-10-05T09:04:01Z","timestamp":1570266241000},"page":"48-72","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Per-Dereference Verification of Temporal Heap Safety via Adaptive Context-Sensitive Analysis"],"prefix":"10.1007","author":[{"given":"Hua","family":"Yan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shiping","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yulei","family":"Sui","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yueqian","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Changwei","family":"Zou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jingling","family":"Xue","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,10,2]]},"reference":[{"key":"4_CR1","unstructured":"Juliet Test Suite 1.2. https:\/\/samate.nist.gov\/srd\/testsuite.php"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Aiken, A., Bugrara, S., Dillig, I., Dillig, T., Hackett, B., Hawkins, P.: An overview of the Saturn project. In: PASTE 2007, pp. 43\u201348 (2007)","DOI":"10.1145\/1251535.1251543"},{"key":"4_CR3","unstructured":"Clang Static Analyzer. http:\/\/clang-analyzer.llvm.org\/"},{"key":"4_CR4","unstructured":"Andersen, L.O.: Program analysis and specialization for the C programming language. Ph.D. thesis, DIKU, University of Copenhagen (1994)"},{"issue":"5","key":"4_CR5","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1145\/381694.378846","volume":"36","author":"Thomas Ball","year":"2001","unstructured":"Ball, T., Majumdar, R., Millstein, T., Rajamani, S.K.: Automatic predicate abstraction of C programs. In: PLDI 2001, pp. 203\u2013213 (2001)","journal-title":"ACM SIGPLAN Notices"},{"key":"4_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/978-3-642-22110-1_15","volume-title":"Computer Aided Verification","author":"J Berdine","year":"2011","unstructured":"Berdine, J., Cook, B., Ishtiaq, S.: SLAyer: memory safety for systems-level code. In: Gopalakrishnan, G., Qadeer, S. (eds.) CAV 2011. LNCS, vol. 6806, pp. 178\u2013183. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22110-1_15"},{"key":"4_CR7","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"},{"issue":"1","key":"4_CR8","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1145\/1594834.1480917","volume":"44","author":"Cristiano Calcagno","year":"2009","unstructured":"Calcagno, C., Distefano, D., O\u2019Hearn, P., Yang, H.: Compositional shape analysis by means of bi-abduction. In: POPL 2009, pp. 289\u2013300 (2009)","journal-title":"ACM SIGPLAN Notices"},{"issue":"6","key":"4_CR9","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1145\/1273442.1250789","volume":"42","author":"Sigmund Cherem","year":"2007","unstructured":"Cherem, S., Princehouse, L., Rugina, R.: Practical memory leak detection using guarded value-flow analysis. In: PLDI 2007, pp. 480\u2013491 (2007)","journal-title":"ACM SIGPLAN Notices"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Cifuentes, C., et al.: Static deep error checking in large system applications using parfait. In: ESEC\/FSE 2011, pp. 432\u2013435 (2011)","DOI":"10.1145\/2025113.2025183"},{"issue":"4","key":"4_CR11","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1145\/115372.115320","volume":"13","author":"R Cytron","year":"1991","unstructured":"Cytron, R., Ferrante, J., Rosen, B.K., Wegman, M.N., Kenneth Zadeck, F.: Efficiently computing static single assignment form and the control dependence graph. ACM Trans. Program. Lang. Syst. (TOPLAS) 13(4), 451\u2013490 (1991)","journal-title":"ACM Trans. Program. Lang. Syst. (TOPLAS)"},{"issue":"5","key":"4_CR12","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1145\/543552.512538","volume":"37","author":"Manuvir Das","year":"2002","unstructured":"Das, M., Lerner, S., Seigle, M.: ESP: path-sensitive program verification in polynomial time. In: PLDI 2002, pp. 57\u201368 (2002)","journal-title":"ACM SIGPLAN Notices"},{"key":"4_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"684","DOI":"10.1007\/978-3-642-39799-8_46","volume-title":"Computer Aided Verification","author":"I Dillig","year":"2013","unstructured":"Dillig, I., Dillig, T.: Explain: a tool for performing abductive inference. In: Sharygina, N., Veith, H. (eds.) CAV 2013. LNCS, vol. 8044, pp. 684\u2013689. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39799-8_46"},{"issue":"6","key":"4_CR14","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1145\/1379022.1375615","volume":"43","author":"Isil Dillig","year":"2008","unstructured":"Dillig, I., Dillig, T., Aiken A.: Sound, complete and scalable path-sensitive analysis. In: PLDI 2008, pp. 270\u2013280 (2008)","journal-title":"ACM SIGPLAN Notices"},{"key":"4_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/11691372_19","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"D Distefano","year":"2006","unstructured":"Distefano, D., O\u2019Hearn, P.W., Yang, H.: A local shape analysis based on separation logic. In: Hermanns, H., Palsberg, J. (eds.) TACAS 2006. LNCS, vol. 3920, pp. 287\u2013302. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11691372_19"},{"key":"4_CR16","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1145\/1348250.1348255","volume":"17","author":"SJ Fink","year":"2008","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. (TOSEM) 17, 9 (2008)","journal-title":"ACM Trans. Softw. Eng. Methodol. (TOSEM)"},{"key":"4_CR17","doi-asserted-by":"crossref","unstructured":"Hackett, B., Aiken, A.: How is aliasing used in systems software? In: FSE 2006, pp. 69\u201380 (2006)","DOI":"10.1145\/1181775.1181785"},{"key":"4_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/978-3-662-46681-0_42","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"A Haran","year":"2015","unstructured":"Haran, A., Carter, M., Emmi, M., Lal, A., Qadeer, S., Rakamari\u0107, Z.: SMACK+Corral: a modular verifier. In: Baier, C., Tinelli, C. (eds.) TACAS 2015. LNCS, vol. 9035, pp. 451\u2013454. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46681-0_42"},{"issue":"1","key":"4_CR19","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1145\/1594834.1480911","volume":"44","author":"Ben Hardekopf","year":"2009","unstructured":"Hardekopf, B., Lin, C.: Semi-sparse flow-sensitive pointer analysis. In: POPL 2009, pp. 226\u2013238 (2009)","journal-title":"ACM SIGPLAN Notices"},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"Heintze, N., Tardieu, O.: Demand-driven pointer analysis. In: PLDI 2001, pp. 24\u201334 (2001)","DOI":"10.1145\/381694.378802"},{"issue":"1","key":"4_CR21","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1145\/982962.964021","volume":"39","author":"Thomas A. Henzinger","year":"2004","unstructured":"Henzinger, T.A., Jhala, R., Majumdar, R., McMillan, K.L.: Abstractions from proofs. In: POPL 2004, pp. 232\u2013244 (2004)","journal-title":"ACM SIGPLAN Notices"},{"key":"4_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1007\/3-540-45657-0_45","volume-title":"Computer Aided Verification","author":"TA Henzinger","year":"2002","unstructured":"Henzinger, T.A., Necula, G.C., Jhala, R., Sutre, G., Majumdar, R., Weimer, W.: Temporal-safety proofs for systems code. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol. 2404, pp. 526\u2013538. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45657-0_45"},{"issue":"OOPSLA","key":"4_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3133924","volume":"1","author":"Sehun Jeong","year":"2017","unstructured":"Jeong, S., Jeon, M., Cha, S., Oh, H.: Data-driven context-sensitivity for points-to analysis. In: OOPSLA 2014, pp. 100:1\u2013100:28 (2017)","journal-title":"Proceedings of the ACM on Programming Languages"},{"issue":"4","key":"4_CR24","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1145\/1592434.1592438","volume":"41","author":"R Jhala","year":"2009","unstructured":"Jhala, R., Majumdar, R.: Software model checking. ACM Comput. Surv. (CSUR) 41(4), 21 (2009)","journal-title":"ACM Comput. Surv. (CSUR)"},{"issue":"6","key":"4_CR25","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1145\/2499370.2462191","volume":"48","author":"George Kastrinis","year":"2013","unstructured":"Kastrinis, G., Smaragdakis, Y.: Hybrid context-sensitivity for points-to analysis. In: PLDI 2013, pp. 423\u2013434 (2013)","journal-title":"ACM SIGPLAN Notices"},{"key":"4_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/978-3-642-54862-8_26","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"D Kroening","year":"2014","unstructured":"Kroening, D., Tautschnig, M.: CBMC \u2013 C bounded model checker. In: \u00c1brah\u00e1m, E., Havelund, K. (eds.) TACAS 2014. LNCS, vol. 8413, pp. 389\u2013391. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54862-8_26"},{"key":"4_CR27","unstructured":"Lattner, C., Adve, V.: LLVM: a compilation framework for lifelong program analysis & transformation. In: CGO 2004, pp. 75\u201386 (2004)"},{"key":"4_CR28","doi-asserted-by":"crossref","unstructured":"Lee, B., et al.: Preventing use-after-free with dangling pointers nullification. In: NDSS 2015 (2015)","DOI":"10.14722\/ndss.2015.23238"},{"key":"4_CR29","doi-asserted-by":"crossref","unstructured":"Lhot\u00e1k, O., Chung, K.-C.A.: Points-to analysis with efficient strong updates. In: POPL 2011, pp. 3\u201316 (2011)","DOI":"10.1145\/1925844.1926389"},{"key":"4_CR30","doi-asserted-by":"crossref","unstructured":"Li, L., Cifuentes, C., Keynes, N.: Practical and effective symbolic analysis for buffer overflow detection. In: FSE 2010, pp. 317\u2013326 (2010)","DOI":"10.1145\/1882291.1882338"},{"key":"4_CR31","doi-asserted-by":"crossref","unstructured":"Li, L., Cifuentes, C., Keynes, N.: Boosting the performance of flow-sensitive points-to analysis using value flow. In: ESEC\/FSE 2011, pp. 343\u2013353 (2011)","DOI":"10.1145\/2025113.2025160"},{"issue":"OOPSLA","key":"4_CR32","first-page":"1","volume":"2","author":"Yue Li","year":"2018","unstructured":"Li, Y., Tan, T., M\u00f8ller, A., Smaragdakis, Y.: Precision-guided context sensitivity for pointer analysis. In: OOPSLA 2018, p. 141 (2018)","journal-title":"Proceedings of the ACM on Programming Languages"},{"key":"4_CR33","doi-asserted-by":"crossref","unstructured":"Liang, P., Tripp, O., Naik, M.: Learning minimal abstractions. In: POPL 2011, pp. 31\u201342 (2011)","DOI":"10.1145\/1925844.1926391"},{"key":"4_CR34","doi-asserted-by":"crossref","unstructured":"Loginov, A., Yahav, E., Chandra, S., Fink, S., Rinetzky, N., Nanda, M.: Verifying dereference safety via expanding-scope analysis. In: ISSTA 2008, pp. 213\u2013224 (2008)","DOI":"10.1145\/1390630.1390657"},{"key":"4_CR35","doi-asserted-by":"crossref","unstructured":"Lu, K., Song, C., Kim, T., Lee, W.: UniSan: proactive kernel memory initialization to eliminate data leakages. In: CCS 2016, pp. 920\u2013932 (2016)","DOI":"10.1145\/2976749.2978366"},{"issue":"10","key":"4_CR36","doi-asserted-by":"publisher","first-page":"1033","DOI":"10.1145\/2076021.2048144","volume":"46","author":"Ravichandhran Madhavan","year":"2011","unstructured":"Madhavan, R., Komondoor, R.: Null dereference verification via over-approximated weakest pre-conditions analysis. In: OOSPLA 2011, pp. 1033\u20131052 (2011)","journal-title":"ACM SIGPLAN Notices"},{"issue":"1","key":"4_CR37","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1044834.1044835","volume":"14","author":"A Milanova","year":"2005","unstructured":"Milanova, A., Rountev, A., Ryder, B.G.: Parameterized object sensitivity for points-to analysis for java. ACM Trans. Softw. Eng. Methodol. (TOSEM) 14(1), 1\u201341 (2005)","journal-title":"ACM Trans. Softw. Eng. Methodol. (TOSEM)"},{"key":"4_CR38","doi-asserted-by":"crossref","unstructured":"Musuvathi, M., Park, D.Y.W., Chou, A., Engler, D.R., Dill, D.L.: CMC: a pragmatic approach to model checking real code. In: OSDI 2002, pp. 75\u201388 (2002)","DOI":"10.1145\/844128.844136"},{"key":"4_CR39","doi-asserted-by":"crossref","unstructured":"Nagarakatte, S., Zhao, J., Martin, M.M.K., Zdancewic, S.: CETS: compiler enforced temporal safety for C. In: ISMM 2010, pp. 31\u201340 (2010)","DOI":"10.1145\/1806651.1806657"},{"issue":"6","key":"4_CR40","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1145\/2666356.2594318","volume":"49","author":"Hakjoo Oh","year":"2014","unstructured":"Oh, H., Lee, W., Heo, K., Yang, H., Yi, K.: Selective context-sensitivity guided by impact pre-analysis. In: PLDI 2014, pp. 475\u2013484 (2014)","journal-title":"ACM SIGPLAN Notices"},{"key":"4_CR41","doi-asserted-by":"crossref","unstructured":"Reps, T., Horwitz, S., Sagiv, M.: Precise interprocedural dataflow analysis via graph reachability. In: POPL 1995, pp. 49\u201361 (1995)","DOI":"10.1145\/199448.199462"},{"key":"4_CR42","unstructured":"Reynolds, J.C.: Separation logic: a logic for shared mutable data structures. In: LICS 2002, pp. 55\u201374 (2002)"},{"key":"4_CR43","unstructured":"Coverity Scan. https:\/\/scan.coverity.com\/"},{"issue":"4","key":"4_CR44","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1145\/3296979.3192418","volume":"53","author":"Qingkai Shi","year":"2018","unstructured":"Shi, Q., Xiao, X., Wu, R., Zhou, J., Fan, G., Zhang, C.: Pinpoint: fast and precise sparse value flow analysis for million lines of code. In: PLDI 2018, pp. 693\u2013706 (2018)","journal-title":"ACM SIGPLAN Notices"},{"issue":"1","key":"4_CR45","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1145\/1925844.1926390","volume":"46","author":"Yannis Smaragdakis","year":"2011","unstructured":"Smaragdakis, Y., Bravenboer, M., Lhot\u00e1k, O.: Pick your contexts well: understanding object-sensitivity. In: POPL 2011, pp. 17\u201330 (2011)","journal-title":"ACM SIGPLAN Notices"},{"issue":"6","key":"4_CR46","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1145\/2666356.2594320","volume":"49","author":"Yannis Smaragdakis","year":"2014","unstructured":"Smaragdakis, Y., Kastrinis, G., Balatsouras, G.: Introspective analysis: context-sensitivity, across the board. In: PLDI 2014, pp. 485\u2013495 (2014)","journal-title":"ACM SIGPLAN Notices"},{"key":"4_CR47","unstructured":"Sp\u00e4th, J., Do, L.N.Q., Ali, K., Bodden, E.: Boomerang: demand-driven flow-and context-sensitive pointer analysis for Java. In: ECOOP 2016, pp. 22:1\u201322:26 (2016)"},{"issue":"6","key":"4_CR48","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1145\/1133255.1134027","volume":"41","author":"Manu Sridharan","year":"2006","unstructured":"Sridharan, M., Bod\u00edk, R.: Refinement-based context-sensitive points-to analysis for Java. In: PLDI 2016, pp. 387\u2013400 (2006)","journal-title":"ACM SIGPLAN Notices"},{"key":"4_CR49","doi-asserted-by":"crossref","unstructured":"Sui, Y., Xue, J.: On-demand strong update analysis via value-flow refinement. In: FSE 2016, pp. 460\u2013473 (2016)","DOI":"10.1145\/2950290.2950296"},{"key":"4_CR50","doi-asserted-by":"crossref","unstructured":"Sui, Y., Xue, J.: SVF: interprocedural static value-flow analysis in LLVM. In: CC 2016, pp. 265\u2013266 (2016)","DOI":"10.1145\/2892208.2892235"},{"key":"4_CR51","doi-asserted-by":"crossref","unstructured":"Sui, Y., Xue, J.: Value-flow-based demand-driven pointer analysis for C and C++. IEEE Trans. Softw. Eng. (TSE) (2018)","DOI":"10.1109\/TSE.2018.2869336"},{"key":"4_CR52","doi-asserted-by":"crossref","unstructured":"Sui, Y., Ye, D., Xue, J.: Static memory leak detection using full-sparse value-flow analysis. In: ISSTA 2012, pp. 254\u2013264 (2012)","DOI":"10.1145\/2338965.2336784"},{"key":"4_CR53","unstructured":"Symbiotic. https:\/\/github.com\/staticafi\/symbiotic"},{"key":"4_CR54","doi-asserted-by":"crossref","unstructured":"Szekeres, L., Payer, M., Wei, T., Song, D.: SoK: eternal war in memory. In: SP 2013, pp. 48\u201362 (2013)","DOI":"10.1109\/SP.2013.13"},{"issue":"6","key":"4_CR55","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1145\/3140587.3062360","volume":"52","author":"Tian Tan","year":"2017","unstructured":"Tan, T., Li, Y., Xue, J.: Efficient and precise points-to analysis: modeling the heap by merging equivalent automata. In: PLDI 2017, pp. 278\u2013291 (2017)","journal-title":"ACM SIGPLAN Notices"},{"key":"4_CR56","doi-asserted-by":"crossref","unstructured":"Yan, H., Sui, Y., Chen, S., Xue, J.: Machine-learning-guided typestate analysis for static use-after-free detection. In: ACSAC 2017, pp. 42\u201354 (2017)","DOI":"10.1145\/3134600.3134620"},{"key":"4_CR57","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: ICSE 2018, pp. 327\u2013337 (2018)","DOI":"10.1145\/3180155.3180178"},{"key":"4_CR58","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/978-3-540-70545-1_36","volume-title":"Computer Aided Verification","author":"H Yang","year":"2008","unstructured":"Yang, H., et al.: Scalable shape analysis for systems code. In: Gupta, A., Malik, S. (eds.) CAV 2008. LNCS, vol. 5123, pp. 385\u2013398. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-70545-1_36"},{"key":"4_CR59","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1007\/3-540-45931-6_28","volume-title":"Foundations of Software Science and Computation Structures","author":"H Yang","year":"2002","unstructured":"Yang, H., O\u2019Hearn, P.: A semantic basis for local reasoning. In: Nielsen, M., Engberg, U. (eds.) FoSSaCS 2002. LNCS, vol. 2303, pp. 402\u2013416. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45931-6_28"},{"key":"4_CR60","doi-asserted-by":"crossref","unstructured":"Ye, D., Sui, Y., Xue, J.: Accelerating dynamic detection of uses of undefined values with static value-flow analysis. In: CGO 2014, pp. 154\u2013164 (2014)","DOI":"10.1145\/2581122.2544154"},{"key":"4_CR61","doi-asserted-by":"crossref","unstructured":"Yu, H., Xue, J., Huo, W., Feng, X., Zhang, Z.: Level by level: making flow-and context-sensitive pointer analysis scalable for millions of lines of code. In: CGO 2010, pp. 218\u2013229 (2010)","DOI":"10.1145\/1772954.1772985"},{"issue":"6","key":"4_CR62","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1145\/2666356.2594327","volume":"49","author":"Xin Zhang","year":"2014","unstructured":"Zhang, X., Mangal, R., Grigore, R., Naik, M., Yang, H.: On abstraction refinement for program analyses in datalog. In: PLDI 2014, pp. 239\u2013248 (2014)","journal-title":"ACM SIGPLAN Notices"}],"container-title":["Lecture Notes in Computer Science","Static Analysis"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-32304-2_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,21]],"date-time":"2023-09-21T09:19:51Z","timestamp":1695287991000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-32304-2_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030323035","9783030323042"],"references-count":62,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-32304-2_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"2 October 2019","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":"Porto","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 October 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 October 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sas2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/staticanalysis.org\/sas2019\/","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":"50","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":"40% - 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.44","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.2","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)"}}]}}