The DOI matches its Crossref record; 39 of the 39 references it cites were found in a registry or an index.
SOK: (State of) The Art of War: Offensive Techniques in Binary Analysis
Open accessAbstract
Finding and exploiting vulnerabilities in binary code is a challenging task. The lack of high-level, semantically rich information about data structures and control constructs makes the analysis of program properties harder to scale. However, the importance of binary analysis is on the rise. In many situations binary analysis is the only possible way to prove (or disprove) properties about the code that is actually executed. In this paper, we present a binary analysis framework that implements a number of analysis techniques that have been proposed in the past. We present a systematized implementation of these techniques, which allows other researchers to compose them and develop new approaches. In addition, the implementation of these techniques in a unifying framework allows for the direct comparison of these apporaches and the identification of their advantages and disadvantages. The evaluation included in this paper is performed using a recent dataset created by DARPA for evaluating the effectiveness of binary vulnerability analysis techniques. Our framework has been open-sourced and is available to the security community.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
de Moura, L., & Bjørner, N. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-78800-3_24 · Cited by 6,595
IPython: A System for Interactive Scientific Computing
Perez, F., & Granger, B. E. (2007) · Computing in Science & Engineering · doi:10.1109/mcse.2007.53 · Cited by 4,009
KLEE: unassisted and automatic generation of high-coverage tests for complex systems programs
Cadar, C., Dunbar, D., & Engler, D. (2008) · doi:10.5555/1855741.1855756 · Cited by 2,620
DART: directed automated random testing
Godefroid, P., Klarlund, N., & Sen, K. (2005) · ACM SIGPLAN Notices · doi:10.1145/1064978.1065036 · Cited by 2,067
DART: directed automated random testing
Godefroid, P., Klarlund, N., & Sen, K. (2005) · Proceedings of the 2005 ACM SIGPLAN conference on Programming language design and implementation · doi:10.1145/1065010.1065036 · Cited by 1,570
An empirical study of the reliability of UNIX utilities
Miller, B. P., Fredriksen, L., & So, B. (1990) · Communications of the ACM · doi:10.1145/96267.96279 · Cited by 1,281
The geometry of innocent flesh on the bone: return-into-libc without function calls (on the x86)
Shacham, H. (2007) · Proceedings of the 14th ACM conference on Computer and communications security · doi:10.1145/1315245.1315313 · Cited by 1,280
Driller: Augmenting Fuzzing Through Selective Symbolic Execution
Stephens, N., Grosen, J., Salls, C., Dutcher, A., Wang, R., Corbetta, J., Shoshitaishvili, Y., Kruegel, C., & Vigna, G. (2016) · Proceedings 2016 Network and Distributed System Security Symposium · doi:10.14722/ndss.2016.23368 · Cited by 887
Self-citationModeling and Discovering Vulnerabilities with Code Property Graphs
Yamaguchi, F., Golde, N., Arp, D., & Rieck, K. (2014) · 2014 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2014.44 · Cited by 808
EXE: automatically generating inputs of death
Cadar, C., Ganesh, V., Pawlowski, P. M., Dill, D. L., & Engler, D. R. (2006) · Proceedings of the 13th ACM conference on Computer and communications security · doi:10.1145/1180405.1180445 · Cited by 788
Schwartz, E. J., Avgerinos, T., & Brumley, D. (2010) · 2010 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2010.26 · Cited by 717
Thompson, K. (1984) · Communications of the ACM · doi:10.1145/358198.358210 · Cited by 666
Szekeres, L., Payer, M., Wei, T., & Song, D. (2013) · 2013 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2013.13 · Cited by 664
SAGE: whitebox fuzzing for security testing
Godefroid, P., Levin, M. Y., & Molnar, D. (2012) · Communications of the ACM · doi:10.1145/2093548.2093564 · Cited by 567
Unleashing Mayhem on Binary Code
Cha, S. K., Avgerinos, T., Rebert, A., & Brumley, D. (2012) · 2012 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2012.31 · Cited by 518
S2E: a platform for in-vivo multi-path analysis of software systems
Chipounov, V., Kuznetsov, V., & Candea, G. (2011) · Proceedings of the sixteenth international conference on Architectural support for programming languages and operating systems · doi:10.1145/1950365.1950396 · Cited by 514
Firmalice - Automatic Detection of Authentication Bypass Vulnerabilities in Binary Firmware
Shoshitaishvili, Y., Wang, R., Hauser, C., Kruegel, C., & Vigna, G. (2015) · Proceedings 2015 Network and Distributed System Security Symposium · doi:10.14722/ndss.2015.23294 · Cited by 362
Self-citationSAGE: Whitebox Fuzzing for Security Testing: SAGE has had a remarkable impact at Microsoft.
Godefroid, P., Levin, M. Y., & Molnar, D. (2012) · Queue · doi:10.1145/2090147.2094081 · Cited by 328
Cross-Architecture Bug Search in Binary Executables
Pewny, J., Garmany, B., Gawlik, R., Rossow, C., & Holz, T. (2015) · Proceedings - IEEE Symposium on Security and Privacy/Proceedings of the ... IEEE Symposium on Security and Privacy · doi:10.1109/sp.2015.49 · Cited by 314
Static disassembly of obfuscated binaries
Kruegel, C., Robertson, W., Valeur, F., & Vigna, G. (2004) · Cited by 279
Self-citationProspex: Protocol Specification Extraction
Comparetti, P. M., Wondracek, G., Kruegel, C., & Kirda, E. (2009) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/sp.2009.14 · Cited by 276
Self-citationRWset: Attacking Path Explosion in Constraint-Based Test Generation
Boonstoppel, P., Cadar, C., & Engler, D. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-78800-3_27 · Cited by 234
Program-Adaptive Mutational Fuzzing
Cha, S. K., Woo, M., & Brumley, D. (2015) · 2015 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2015.50 · Cited by 231
Enhancing symbolic execution with veritesting
Avgerinos, T., Rebert, A., Cha, S. K., & Brumley, D. (2014) · Proceedings of the 36th International Conference on Software Engineering · doi:10.1145/2568225.2568293 · Cited by 218
AEG: Automatic Exploit Generation
Avgerinos, T., Kil, S., Hao, B. L. T., & Brumley, D. (2018) · doi:10.1184/r1/6468296 · Cited by 202
Efficient state merging in symbolic execution
Kuznetsov, V., Kinder, J., Bucur, S., & Candea, G. (2012) · Proceedings of the 33rd ACM SIGPLAN Conference on Programming Language Design and Implementation · doi:10.1145/2254064.2254088 · Cited by 193
Automatic Inference of Search Patterns for Taint-Style Vulnerabilities
Yamaguchi, F., Maier, A., Gascon, H., & Rieck, K. (2015) · 2015 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2015.54 · Cited by 189
Q: Exploit Hardening Made Easy
Schwartz, E. J., Avgerinos, T., & Brumley, D. (2018) · doi:10.1184/r1/6469187 · Cited by 178
TIE: Principled Reverse Engineering of Types in Binary Programs
Lee, J., Avgerinos, T., & Brumley, D. (2018) · Figshare · doi:10.1184/r1/6469466 · Cited by 164
Loop-extended symbolic execution on binary programs
Saxena, P., Poosankam, P., McCamant, S., & Song, D. (2009) · Proceedings of the eighteenth international symposium on Software testing and analysis · doi:10.1145/1572272.1572299 · Cited by 163
BYTEWEIGHT: Learning to Recognize Functions in Binary Code
Bao, T., Burket, J., Woo, M., Turner, R., & Brumley, D. (2018) · Figshare · doi:10.1184/r1/6468464 · Cited by 160
WYSINWYX: What You See Is Not What You eXecute
Balakrishnan, G., Reps, T., Melski, D., & Teitelbaum, T. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-69149-5_22 · Cited by 157
Under-Constrained Symbolic Execution: Correctness Checking for Real Code
Ramos, D. A., & Engler, D. (2015) · USENIX Security Symposium · Cited by 145
SMT-COMP: Satisfiability Modulo Theories Competition
Barrett, C., de Moura, L., & Stump, A. (2005) · Lecture notes in computer science · doi:10.1007/11513988_4 · Cited by 105
Steering symbolic execution to less traveled paths
Li, Y., Su, Z., Wang, L., & Li, X. (2013) · Conference on Object-Oriented Programming Systems, Languages, and Applications · doi:10.1145/2509136.2509553 · Cited by 94
Engler, D., & Dunbar, D. (2007) · International Symposium on Software Testing and Analysis · doi:10.1145/1273463.1273464 · Cited by 65
Neugschwandtner, M., Comparetti, P. M., Haller, I., & Bos, H. (2015) · ACM Conference on Data and Application Security and Privacy (CODASPY) · doi:10.1145/2699026.2699098 · Cited by 54
Automatic construction of jump-oriented programming shellcode (on the x86)
Chen, P., Xing, X., Mao, B., Li, X., Shen, X., & Yin, X. (2011) · ACM Asia Conference on Computer and Communications Security (ASIA CCS) · doi:10.1145/1966913.1966918 · Cited by 39
Transformation-aware Exploit Generation using a HI-CFG
Caselden, D., Bazhanyuk, A., Payer, M., Szekeres, L., McCamant, S., & Song, D. X. (2013) · doi:10.21236/ada587051 · Cited by 16
Cited by
A survey of symbolic execution techniques
Baldoni, R., Coppa, E., D’elia, D. C., Demetrescu, C., & Finocchi, I. (2019) · ACM Computing Surveys · doi:10.1145/3182657 · Cited by 708
Angora: Efficient Fuzzing by Principled Search
Chen, P., & Chen, H. (2018) · 2018 IEEE Symposium on Security and Privacy (SP) · doi:10.1109/sp.2018.00046 · Cited by 552
Manticore: A User-Friendly Symbolic Execution Framework for Binaries and Smart Contracts
Mossberg, M., Manzano, F., Hennenfent, E., Groce, A., Grieco, G., Feist, J., Brunson, T., & Dinaburg, A. (2019) · 2019 34th IEEE/ACM International Conference on Automated Software Engineering (ASE) · doi:10.1109/ase.2019.00133 · Cited by 391
SgxPectre: Stealing Intel Secrets from SGX Enclaves Via Speculative Execution
Chen, G., Chen, S., Xiao, Y., Zhang, Y., Lin, Z., & Lai, T. H. (2019) · 2019 IEEE European Symposium on Security and Privacy (EuroS&P) · doi:10.1109/eurosp.2019.00020 · Cited by 319
T-Fuzz: Fuzzing by Program Transformation
Peng, H., Shoshitaishvili, Y., & Payer, M. (2018) · 2018 IEEE Symposium on Security and Privacy (SP) · doi:10.1109/sp.2018.00056 · Cited by 293
Self-citation
Metadata
- Authors
- Shoshitaishvili, Y., Wang, R., Salls, C., Stephens, N., Polino, M., Dutcher, A., Grosen, J., Feng, S., Hauser, C., Kruegel, C., & Vigna, G.
- Venue
- 2016 IEEE Symposium on Security and Privacy (SP)
- Publisher
- IEEE
- Published
- 2016-05
- Pages
- 138-157
- ISSN
- 1081-6011 (ISSN-L)
- OpenAlex
- W2514974017
- Cited by
- 957
- References
- 39
- FWCI
- 46.83
- Type
- conference paper
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.