{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T08:46:19Z","timestamp":1780994779312,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":41,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T00:00:00Z","timestamp":1726012800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"ONR","award":["N00014-17-1-2891"],"award-info":[{"award-number":["N00014-17-1-2891"]}]},{"name":"NSF","award":["1918667"],"award-info":[{"award-number":["1918667"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,9,11]]},"DOI":"10.1145\/3650212.3680301","type":"proceedings-article","created":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T11:44:25Z","timestamp":1726055065000},"page":"541-552","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Scalable, Sound, and Accurate Jump Table Analysis"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0003-3976-9941","authenticated-orcid":false,"given":"Huan","family":"Nguyen","sequence":"first","affiliation":[{"name":"Stony Brook University, Stony Brook, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-8375-9857","authenticated-orcid":false,"given":"Soumyakant","family":"Priyadarshan","sequence":"additional","affiliation":[{"name":"Stony Brook University, Stony Brook, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-9135-3296","authenticated-orcid":false,"given":"R.","family":"Sekar","sequence":"additional","affiliation":[{"name":"Stony Brook University, Stony Brook, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2024,9,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","unstructured":"Jim Alves-Foss and Jia Song. 2019. Function boundary detection in stripped binaries. In ACSAC. https:\/\/doi.org\/10.1145\/3359789.3359825 10.1145\/3359789.3359825","DOI":"10.1145\/3359789.3359825"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/EuroSP.2017.11"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","unstructured":"G. Balakrishnan and T. Reps. 2004. Analyzing memory accesses in x86 executables. In Compiler Construction. https:\/\/doi.org\/10.1007\/978-3-540-24723-4_2 10.1007\/978-3-540-24723-4_2","DOI":"10.1007\/978-3-540-24723-4_2"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","unstructured":"D. Brumley I. Jager T. Avgerinos and E. Schwartz. 2011. Bap: a binary analysis platform. In CAV. https:\/\/doi.org\/10.1007\/978-3-642-22110-1_37 10.1007\/978-3-642-22110-1_37","DOI":"10.1007\/978-3-642-22110-1_37"},{"key":"e_1_3_2_1_5_1","unstructured":"Sanchuan Chen Zhiqiang Lin and Yinqian Zhang. 2021. SelectiveTaint: Efficient Data Flow Tracking With Static Binary Rewriting. In USENIX Security."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","unstructured":"Patrick Cousot and Radhia Cousot. 1977. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In ACM Principles of programming languages. https:\/\/doi.org\/10.1145\/512950.512973 10.1145\/512950.512973","DOI":"10.1145\/512950.512973"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2968455.2968514"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3033019.3033028"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","unstructured":"Matt Elder Junghee Lim Tushar Sharma Tycho Andersen and Thomas Reps. 2014. Abstract domains of affine relations. ACM TOPLAS https:\/\/doi.org\/10.1145\/2651361 10.1145\/2651361","DOI":"10.1145\/2651361"},{"key":"e_1_3_2_1_10_1","unstructured":"Antonio Flores-Montoya and Eric Schulte. 2020. Datalog disassembly. In USENIX Security."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","unstructured":"Laune C Harris and Barton P Miller. 2005. Practical analysis of stripped binary code. ACM SIGARCH https:\/\/doi.org\/10.1145\/1127577.1127590 10.1145\/1127577.1127590","DOI":"10.1145\/1127577.1127590"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","unstructured":"Niranjan Hasabnis and R Sekar. 2016. Lifting assembly to intermediate representation: A novel approach leveraging compilers. In ASPLOS. https:\/\/doi.org\/10.1145\/2872362.2872380 10.1145\/2872362.2872380","DOI":"10.1145\/2872362.2872380"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","unstructured":"Michael Karr. 1976. Affine relationships among variables of a program. Acta Informatica https:\/\/doi.org\/10.1007\/BF00268497 10.1007\/BF00268497","DOI":"10.1007\/BF00268497"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","unstructured":"Sun Hyoung Kim Cong Sun Dongrui Zeng and Gang Tan. 2021. Refining Indirect Call Targets at the Binary Level. In NDSS. https:\/\/doi.org\/10.14722\/ndss.2021.24386 10.14722\/ndss.2021.24386","DOI":"10.14722\/ndss.2021.24386"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","unstructured":"Hyungjoon Koo Yaohui Chen Long Lu Vasileios P Kemerlis and Michalis Polychronakis. 2018. Compiler-assisted code randomization. In Security and Privacy. https:\/\/doi.org\/10.1109\/SP.2018.00029 10.1109\/SP.2018.00029","DOI":"10.1109\/SP.2018.00029"},{"key":"e_1_3_2_1_16_1","volume-title":"CBAT: A Comparative Binary Analysis Tool. ONR TPCP.","author":"Laboratory Draper","year":"2022","unstructured":"Draper Laboratory. 2022. CBAT: A Comparative Binary Analysis Tool. ONR TPCP."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","unstructured":"Fan Long Stelios Sidiroglou-Douskos and Martin Rinard. 2014. Automatic runtime error repair and containment via recovery shepherding. PLDI https:\/\/doi.org\/10.1145\/2666356.2594337 10.1145\/2666356.2594337","DOI":"10.1145\/2666356.2594337"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","unstructured":"Xiaozhu Meng and Barton P Miller. 2016. Binary code is not easy. In ISSTA. https:\/\/doi.org\/10.1145\/2931037.2931047 10.1145\/2931037.2931047","DOI":"10.1145\/2931037.2931047"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","unstructured":"Markus M\u00fcller-Olm and Helmut Seidl. 2004. A note on Karr\u2019s algorithm. In International Colloquium on Automata Languages and Programming. https:\/\/doi.org\/10.1007\/978-3-540-27836-8_85 10.1007\/978-3-540-27836-8_85","DOI":"10.1007\/978-3-540-27836-8_85"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","unstructured":"Huan Nguyen. [n. d.]. Static Jump Table Analysis. https:\/\/doi.org\/10.5281\/zenodo.12670597 10.5281\/zenodo.12670597","DOI":"10.5281\/zenodo.12670597"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/CGO.2019.8661201"},{"key":"e_1_3_2_1_22_1","unstructured":"Chengbin Pang. [n. d.]. Dataset. https:\/\/github.com\/junxzm1990\/x86-sok"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP40001.2021.00012"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","unstructured":"Vasilis Pappas Michalis Polychronakis and Angelos D Keromytis. 2012. Smashing the gadgets: Hindering return-oriented programming using in-place code randomization. In Security and Privacy. https:\/\/doi.org\/10.1109\/SP.2012.41 10.1109\/SP.2012.41","DOI":"10.1109\/SP.2012.41"},{"key":"e_1_3_2_1_25_1","volume-title":"SAFER: Efficient and Error-Tolerant Binary Instrumentation. In USENIX Security.","author":"Priyadarshan Soumyakant","year":"2023","unstructured":"Soumyakant Priyadarshan, Huan Nguyen, Rohit Chouhan, and R Sekar. 2023. SAFER: Efficient and Error-Tolerant Binary Instrumentation. In USENIX Security."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","unstructured":"Soumyakant Priyadarshan Huan Nguyen and R. Sekar. 2020. Practical Fine-Grained Binary Code Randomization. In ACSAC. https:\/\/doi.org\/10.1145\/3427228.3427292 10.1145\/3427228.3427292","DOI":"10.1145\/3427228.3427292"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","unstructured":"Rui Qiao and R Sekar. 2017. A Principled Approach for Function Recognition in COTS Binaries. In Dependable Systems and Networks (DSN). https:\/\/doi.org\/10.1109\/DSN.2017.29 10.1109\/DSN.2017.29","DOI":"10.1109\/DSN.2017.29"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-22038-9_23"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","unstructured":"Thomas Reps Mooly Sagiv and Greta Yorsh. 2004. Symbolic implementation of the best transformer. In VMCAI. https:\/\/doi.org\/10.1007\/978-3-540-24622-0_21 10.1007\/978-3-540-24622-0_21","DOI":"10.1007\/978-3-540-24622-0_21"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3338503.3357725"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","unstructured":"Prateek Saxena R Sekar and Varun Puranik. 2008. Efficient fine-grained binary instrumentation with applications to taint-tracking. In CGO. https:\/\/doi.org\/10.1145\/1356058.1356069 10.1145\/1356058.1356069","DOI":"10.1145\/1356058.1356069"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","unstructured":"Yan Shoshitaishvili Ruoyu Wang Christopher Salls Nick Stephens Mario Polino Andrew Dutcher John Grosen Siji Feng Christophe Hauser and Christopher Kruegel. 2016. Sok:(state of) the art of war: Offensive techniques in binary analysis. In Security and Privacy (SP). https:\/\/doi.org\/10.1109\/SP.2016.17 10.1109\/SP.2016.17","DOI":"10.1109\/SP.2016.17"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","unstructured":"Victor Van der Veen Dennis Andriesse Enes G\u00f6kta\u015f Ben Gras Lionel Sambuc Asia Slowinska Herbert Bos and Cristiano Giuffrida. 2015. Practical context-sensitive CFI. In ACM CCS. https:\/\/doi.org\/10.1145\/2810103.2813673 10.1145\/2810103.2813673","DOI":"10.1145\/2810103.2813673"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","unstructured":"Victor Van Der Veen Enes G\u00f6ktas Moritz Contag Andre Pawoloski Xi Chen Sanjay Rawat Herbert Bos Thorsten Holz Elias Athanasopoulos and Cristiano Giuffrida. 2016. A tough call: Mitigating advanced code-reuse attacks at the binary level. In Security and Privacy (SP). https:\/\/doi.org\/10.1109\/SP.2016.60 10.1109\/SP.2016.60","DOI":"10.1109\/SP.2016.60"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2017.23225"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.1984.5010248"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/3373376.3378470"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","unstructured":"Miuyin Yong Wong Matthew Landen Manos Antonakakis Douglas M Blough Elissa M Redmiles and Mustaque Ahamad. 2021. An inside look into the practice of malware analysis. In ACM CCS. https:\/\/doi.org\/10.1145\/3460120.3484759 10.1145\/3460120.3484759","DOI":"10.1145\/3460120.3484759"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2013.44"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","unstructured":"Mingwei Zhang Rui Qiao Niranjan Hasabnis and R Sekar. 2014. A platform for secure static binary instrumentation. ACM VEE https:\/\/doi.org\/10.1145\/2576195.2576208 10.1145\/2576195.2576208","DOI":"10.1145\/2576195.2576208"},{"key":"e_1_3_2_1_41_1","unstructured":"Mingwei Zhang and R Sekar. 2013. Control flow integrity for COTS binaries. In USENIX Security."}],"event":{"name":"ISSTA '24: 33rd ACM SIGSOFT International Symposium on Software Testing and Analysis","location":"Vienna Austria","acronym":"ISSTA '24","sponsor":["SIGSOFT ACM Special Interest Group on Software Engineering","AITO"]},"container-title":["Proceedings of the 33rd ACM SIGSOFT International Symposium on Software Testing and Analysis"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3650212.3680301","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3650212.3680301","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T22:50:07Z","timestamp":1750287007000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3650212.3680301"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,9,11]]},"references-count":41,"alternative-id":["10.1145\/3650212.3680301","10.1145\/3650212"],"URL":"https:\/\/doi.org\/10.1145\/3650212.3680301","relation":{},"subject":[],"published":{"date-parts":[[2024,9,11]]},"assertion":[{"value":"2024-09-11","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}