The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
Angora: Efficient Fuzzing by Principled Search
Open accessAbstract
Fuzzing is a popular technique for finding software bugs. However, the performance of the state-of-the-art fuzzers leaves a lot to be desired. Fuzzers based on symbolic execution produce quality inputs but run slow, while fuzzers based on random mutation run fast but have difficulty producing quality inputs. We propose Angora, a new mutation-based fuzzer that outperforms the state-of-the-art fuzzers by a wide margin. The main goal of Angora is to increase branch coverage by solving path constraints without symbolic execution. To solve path constraints efficiently, we introduce several key techniques: scalable byte-level taint tracking, context-sensitive branch count, search based on gradient descent, and input length exploration. On the LAVA-M data set, Angora found almost all the injected bugs, found more bugs than any other fuzzer that we compared with, and found eight times as many bugs as the second-best fuzzer in the program who. Angora also found 103 bugs that the LAVA authors injected but could not trigger. We also tested Angora on eight popular, mature open source programs. Angora found 6, 52, 29, 40 and 48 new bugs infile,jhead,nm,objdumpandsize, respectively. We measured the coverage of Angora and evaluated how its key techniques contribute to its impressive performance.
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
LLVM: A compilation framework for lifelong program analysis & transformation
Lattner, C., & Adve, V. (2004) · International Symposium on Code Generation and Optimization, 2004. CGO 2004. · doi:10.1109/cgo.2004.1281665 · Cited by 2,681
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
Enck (2014) · doi:10.1145/2619091 · Cited by 1,203
Automated Whitebox Fuzz Testing.
Godefroid, P., Levin, M. Y., & Molnar, D. A. (2008) · Cited by 1,095
SOK: (State of) The Art of War: Offensive Techniques in Binary Analysis
Shoshitaishvili, Y., Wang, R., Salls, C., Stephens, N., Polino, M., Dutcher, A., Grosen, J., Feng, S., Hauser, C., Kruegel, C., et al. (2016) · 2016 IEEE Symposium on Security and Privacy (SP) · doi:10.1109/sp.2016.17 · Cited by 957
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
Symbolic execution for software testing: three decades later
Cadar, C., & Sen, K. (2013) · Communications of the ACM · doi:10.1145/2408776.2408795 · Cited by 776
Coverage-based Greybox Fuzzing as Markov Chain
Böhme, M., Pham, V.-T., & Roychoudhury, A. (2016) · Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/2976749.2978428 · Cited by 649
VUzzer: Application-aware Evolutionary Fuzzing
Rawat, S., Jain, V., Kumar, A., Cojocar, L., Giuffrida, C., & Bos, H. (2017) · Proceedings 2017 Network and Distributed System Security Symposium · doi:10.14722/ndss.2017.23404 · Cited by 584
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
TaintScope: A Checksum-Aware Directed Fuzzing Tool for Automatic Software Vulnerability Detection
Wang, T., Wei, T., Gu, G., & Zou, W. (2010) · 2010 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2010.37 · Cited by 380
Taint-based directed whitebox fuzzing
Ganesh, V., Leek, T., & Rinard, M. (2009) · 2009 IEEE 31st International Conference on Software Engineering · doi:10.1109/icse.2009.5070546 · Cited by 348
LAVA: Large-Scale Automated Vulnerability Addition
Dolan-Gavitt, B., Hulin, P., Kirda, E., Leek, T., Mambretti, A., Robertson, W., Ulrich, F., & Whelan, R. (2016) · 2016 IEEE Symposium on Security and Privacy (SP) · doi:10.1109/sp.2016.15 · Cited by 300
Steelix: program-state based binary fuzzing
Li, Y., Chen, B., Chandramohan, M., Lin, S.-W., Liu, Y., & Tiu, A. (2017) · Proceedings of the 2017 11th Joint Meeting on Foundations of Software Engineering · doi:10.1145/3106237.3106295 · Cited by 269
Optimizing Seed Selection for Fuzzing
Rebert, A., Cha, S. K., Avgerinos, T., Foote, J. M., Warren, D., Grieco, G., & Brumley, D. (2018) · KiltHub Repository · doi:10.1184/r1/6469118 · Cited by 231
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
Portokalidis, G., Slowinska, A., & Bos, H. (2006) · Proceedings of the 1st ACM SIGOPS/EuroSys European Conference on Computer Systems 2006 · doi:10.1145/1217935.1217938 · Cited by 212
TaintART: A Practical Multi-level Information-Flow Tracking System for Android RunTime
Sun, M.-S., Wei, T., & Lui, J. C. S. (2016) · Conference on Computer and Communications Security · doi:10.1145/2976749.2978343 · Cited by 199
Dowsing for overflows: a guided fuzzer to find buffer boundary violations
Haller, I., Slowinska, A., Neugschwandtner, M., & Bos, H. (2013) · VU Research Portal · Cited by 194
Scheduling black-box mutational fuzzing
Woo, M., Cha, S. K., Gottlieb, S., & Brumley, D. (2013) · Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security - CCS '13 · doi:10.1145/2508859.2516736 · Cited by 182
Detecting and Debugging Insecure Information Flows
Masri, W., Podgurski, A., & Leon, D. (2005) · Proceedings/Proceedings - International Symposium on Software Reliability Engineering · doi:10.1109/issre.2004.17 · Cited by 81
Efficient forward computation of dynamic slices using reduced ordered binary decision diagrams
Zhang, X., Gupta, R., & Zhang, Y. (2004) · doi:10.5555/998675.999454 · Cited by 66
Efficient forward computation of dynamic slices using reduced ordered binary decision diagrams
Zhang, X., Gupta, R., & Zhang, Y. (2004) · ACM/IEEE International Conference on Software Engineering: Companion Proceedings (ICSE-Companion) · doi:10.1109/icse.2004.1317472 · Cited by 18
Cited by
Klees, G., Ruef, A., Cooper, B., Wei, S., & Hicks, M. (2018) · Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/3243734.3243804 · Cited by 633
(2021) · doi:10.1109/tse.2019.2946563 · Cited by 574
FairFuzz: a targeted mutation strategy for increasing greybox fuzz testing coverage
Lemieux, C., & Sen, K. (2018) · Proceedings of the 33rd ACM/IEEE International Conference on Automated Software Engineering · doi:10.1145/3238147.3238176 · Cited by 477
LEMNA: Explaining Deep Learning based Security Applications
Guo, W., Mu, D., Xu, J., Su, P., Wang, G., & Xing, X. (2018) · Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/3243734.3243792 · Cited by 287
Learning to Fuzz from Symbolic Execution with Application to Smart Contracts
He, J., Balunović, M., Ambroladze, N., Tsankov, P., & Vechev, M. (2019) · Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/3319535.3363230 · Cited by 269
Metadata
- Authors
- Chen, P., & Chen, H.
- Venue
- 2018 IEEE Symposium on Security and Privacy (SP)
- Publisher
- IEEE
- Published
- 2018-05
- Pages
- 711-725
- ISSN
- 1081-6011 (ISSN-L)
- OpenAlex
- W2964097210
- Cited by
- 552
- References
- 24
- FWCI
- 39.72
- Type
- conference paper
- Language
- en
- Open access
- bronze
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.