The DOI matches its Crossref record; 33 of the 33 references it cites were found in a registry or an index.
Automatic exploit generation
Abstract
The idea is to identify security-critical software bugs so they can be fixed first.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Symbolic execution and program testing
King, J. C. (1976) · Communications of the ACM · doi:10.1145/360248.360252 · Cited by 3,031
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
CUTE: a concolic unit testing engine for C
Sen, K., Marinov, D., & Agha, G. (2005) · Proceedings of the 10th European software engineering conference held jointly with 13th ACM SIGSOFT international symposium on Foundations of software engineering · doi:10.1145/1081706.1081750 · Cited by 1,651
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
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
On the effectiveness of address-space randomization
Shacham, H., Page, M., Pfaff, B., Goh, E.-J., Modadugu, N., & Boneh, D. (2004) · Proceedings of the 11th ACM conference on Computer and communications security · doi:10.1145/1030083.1030124 · Cited by 861
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
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
Satisfiability modulo theories: introduction and applications
De Moura, L., & Bjørner, N. (2011) · Communications of the ACM · doi:10.1145/1995376.1995394 · Cited by 645
Before we knew it: an empirical study of zero-day attacks in the real world
Bilge, L., & Dumitraş, T. (2012) · Proceedings of the 2012 ACM conference on Computer and communications security · doi:10.1145/2382196.2382284 · Cited by 627
Manadhata, P. K., & Wing, J. M. (2011) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2010.60 · Cited by 625
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
Self-citationBAP: A Binary Analysis Platform
Brumley, D., Jager, I., Avgerinos, T., & Schwartz, E. J. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-22110-1_37 · Cited by 433
Self-citationJhala, R., & Majumdar, R. (2009) · ACM Computing Surveys · doi:10.1145/1592434.1592438 · Cited by 418
Compositional dynamic test generation
Godefroid, P. (2007) · ACM SIGPLAN Notices · doi:10.1145/1190215.1190226 · Cited by 408
SELECT—a formal system for testing and debugging programs by symbolic execution
Boyer, R. S., Elspas, B., & Levitt, K. N. (1975) · ACM SIGPLAN Notices · doi:10.1145/390016.808445 · Cited by 390
Compositional dynamic test generation
Godefroid, P. (2007) · Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/1190216.1190226 · Cited by 314
Automatic Patch-Based Exploit Generation is Possible: Techniques and Implications
Brumley, D., Poosankam, P., Song, D., & Zheng, J. (2008) · 2008 IEEE Symposium on Security and Privacy (sp 2008) · doi:10.1109/sp.2008.17 · Cited by 281
Self-citationAvoiding exponential explosion: generating compact verification conditions
Flanagan, C., & Saxe, J. B. (2001) · Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/360204.360220 · Cited by 220
The S2E Platform: Design, Implementation, and Applications
Chipounov, V., Kuznetsov, V., & Candea, G. (2012) · ACM Transactions on Computer Systems · doi:10.1145/2110356.2110358 · Cited by 206
AEG: Automatic Exploit Generation
Avgerinos, T., Kil, S., Hao, B. L. T., & Brumley, D. (2018) · doi:10.1184/r1/6468296 · Cited by 202
Self-citationMethodology for the Generation of Program Test Data
Howden, W. E. (1975) · IEEE Transactions on Computers · doi:10.1109/t-c.1975.224259 · Cited by 196
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
Q: Exploit Hardening Made Easy
Schwartz, E. J., Avgerinos, T., & Brumley, D. (2018) · doi:10.1184/r1/6469187 · Cited by 178
Self-citationSELECT---a formal system for testing and debugging programs by symbolic execution
Boyer, R. S., Elspas, B., & Levitt, K. N. (1975) · Proceedings of the international conference on Reliable software - · doi:10.1145/800027.808445 · Cited by 166
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
Memory Errors: The Past, the Present, and the Future
van der Veen, V., dutt-Sharma, N., Cavallaro, L., & Bos, H. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-33338-5_5 · Cited by 157
Billions and billions of constraints: whitebox fuzz testing in production
Bounimova, E., Godefroid, P., & Molnár, D. (2013) · doi:10.5555/2486788.2486805 · Cited by 116
National Institute of Standards and Technology
(2012) · Choice Reviews Online · doi:10.5860/choice.50-2030 · Cited by 67
Engler, D., & Dunbar, D. (2007) · International Symposium on Software Testing and Analysis · doi:10.1145/1273463.1273464 · Cited by 65
Efficient Directionless Weakest Preconditions
Brumley, D., & Jager, I. (2011) · Cited by 18
Self-citation
Cited by
Neural Network-based Graph Embedding for Cross-Platform Binary Code Similarity Detection
Xu, X., Liu, C., Feng, Q., Yin, H., Song, L., & Song, D. (2017) · Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/3133956.3134018 · Cited by 530
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
Self-citationScalable Graph-based Bug Search for Firmware Images
Feng, Q., Zhou, R., Xu, C., Cheng, Y., Testa, B., & Yin, H. (2016) · Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/2976749.2978370 · Cited by 401
Towards Verified Artificial Intelligence
Seshia, S. A., Sadigh, D., & Sastry, S. S. (2016) · arXiv · doi:10.48550/arxiv.1606.08514 · Cited by 142
“Formal methods has proved effective for the systematic generation of test data in various settings including simulation-based verification of circuits (e.g., [29]) and finding security exploits in commodity software (e.g., [4]).”
Method
Metadata
- Authors
- Avgerinos, T., Cha, S. K., Rebert, A., Schwartz, E. J., Woo, M., & Brumley, D.
- Venue
- Communications of the ACM
- Published
- 2014-02
- Volume
- 57
- Issue
- 2
- Pages
- 74-84
- ISSN
- 0001-0782 (ISSN-L)
- 1557-7317
- OpenAlex
- W2051990174
- Cited by
- 263
- References
- 33
- FWCI
- 64.27
- Type
- journal article
- Language
- en
- Open access
- closed
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.