The DOI matches its Crossref record; 35 of the 35 references it cites were found in a registry or an index.
Grammar-based whitebox fuzzing
Abstract
Whitebox fuzzing is a form of automatic dynamic test generation, based on symbolic execution and constraint solving, designed for security testing of large applications. Unfortunately, the current effectiveness of whitebox fuzzing is limited when testing applications with highly-structured inputs, such as compilers and interpreters. These applications process their inputs in stages, such as lexing, parsing and evaluation. Due to the enormous number of control paths in early processing stages, whitebox fuzzing rarely reaches parts of the application beyond those first stages.
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
Introduction to automata theory, languages and computation
(1981) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(81)90068-9 · Cited by 10,699
Introduction to automata theory, languages, and computation
(1980) · Computer Languages · doi:10.1016/0096-0551(80)90011-9 · Cited by 6,824
Symbolic execution and program testing
King, J. C. (1976) · Communications of the ACM · doi:10.1145/360248.360252 · Cited by 3,031
DART: directed automated random testing
Godefroid, P., Klarlund, N., & Sen, K. (2005) · ACM SIGPLAN Notices · doi:10.1145/1064978.1065036 · Cited by 2,067
Self-citation(2011) · IEEE Software · doi:10.1109/ms.2011.67 · Cited by 1,989
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
Self-citationAn 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
Automated Whitebox Fuzz Testing.
Godefroid, P., Levin, M. Y., & Molnar, D. A. (2008) · Cited by 1,095
Self-citationQuickCheck: a lightweight tool for random testing of Haskell programs
Claessen, K., & Hughes, J. (2011) · ACM SIGPLAN Notices · doi:10.1145/1988042.1988046 · Cited by 1,011
Feedback-Directed Random Test Generation
Pacheco, C., Lahiri, S. K., Ernst, M. D., & Ball, T. (2007) · 29th International Conference on Software Engineering (ICSE'07) · doi:10.1109/icse.2007.37 · Cited by 863
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
(2000) · doi:10.1145/351240.351266 · Cited by 753
Korat: automated testing based on Java predicates
Boyapati, C., Khurshid, S., & Marinov, D. (2002) · ACM SIGSOFT Software Engineering Notes · doi:10.1145/566171.566191 · Cited by 593
Fuzzing: Brute Force Vulnerability Discovery
Sutton, M. J. D., Greene, A., & Amini, P. (2007) · Medical Entomology and Zoology · Cited by 548
Compositional dynamic test generation
Godefroid, P. (2007) · ACM SIGPLAN Notices · doi:10.1145/1190215.1190226 · Cited by 408
Self-citationDiscoverer: automatic protocol reverse engineering from network traces
Cui, W., Kannan, J., & Wang, H. J. (2007) · USENIX Security Symposium · Cited by 391
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
Self-citationKorat: automated testing based on Java predicates
Boyapati, C., Khurshid, S., & Marinov, D. (2002) · Proceedings of the 2002 ACM SIGSOFT international symposium on Software testing and analysis · doi:10.1145/566172.566191 · Cited by 302
An empirical study of the robustness of Windows NT applications using random testing
Forrester, J. E., & Miller, B. P. (2000) · Cited by 271
Automated testing of refactoring engines
Daniel, B., Dig, D., Garcia, K., & Marinov, D. (2007) · Proceedings of the the 6th joint meeting of the European software engineering conference and the ACM SIGSOFT symposium on The foundations of software engineering · doi:10.1145/1287624.1287651 · Cited by 227
Automatic generation of random self-checking test cases
Bird, D. L., & Munoz, C. U. (1983) · IBM Systems Journal · doi:10.1147/sj.223.0229 · Cited by 222
A sentence generator for testing parsers
Purdom, P. (1972) · BIT · doi:10.1007/bf01932975 · Cited by 177
Generating test data with enhanced context-free grammars
Maurer, P. M. (1990) · IEEE Software · doi:10.1109/52.56422 · Cited by 176
A taxonomy of model-based testing
Utting, M., Pretschner, A., & Legeard, B. (2006) · Research Commons (University of Waikato) · Cited by 155
Automatic generation of test cases
Hanford, K. V. (1970) · IBM Systems Journal · doi:10.1147/sj.94.0242 · Cited by 146
binpac: a yacc for writing application protocol parsers
Pang, R., Paxson, V., Sommer, R., & Peterson, L. (2006) · ACM Internet Measurement Conference (IMC) · doi:10.1145/1177080.1177119 · Cited by 141
Using production grammars in software testing
Sirer, E. G., & Bershad, B. N. (1999) · doi:10.1145/331960.331965 · Cited by 133
Controllable Combinatorial Coverage in Grammar-Based Testing
Lämmel, R., & Schulte, W. (2006) · Lecture notes in computer science · doi:10.1007/11754008_2 · Cited by 121
Directed test generation using symbolic grammars
Majumdar, R., & Xu, R.-G. (2007) · doi:10.1145/1321631.1321653 · Cited by 104
Generic Application-Level Protocol Analyzer and its Language.
Borisov, N., Brumley, D., Wang, H. J., Dunagan, J., Joshi, P., & Guo, C. (2007) · Cited by 96
An Interpretation of Purdom's Algorithm forAutomatic Generation of Test Cases
Malloy, B. A., & Power, J. F. (2001) · Cited by 25
Generating Strings at Random from a Context Free Grammar
McKenzie, B. (1997) · UC Research Repository (University of Canterbury) · Cited by 23
LATEST : Lazy Dynamic Test Input Generation
Majumdar, R., & Sen, K. (2007) · UC Berkeley · Cited by 22
An Interpretation of Purdom's Algorithm for Automatic Generation of Test Cases
Malloy, B. A., & Power, J. F. (2001) · Maynooth University ePrints and eTheses Archive (Maynooth University) · Cited by 10
Cited by
Finding and understanding bugs in C compilers
Yang, X., Chen, Y., Eide, E., & Regehr, J. (2011) · Proceedings of the 32nd ACM SIGPLAN Conference on Programming Language Design and Implementation · doi:10.1145/1993498.1993532 · Cited by 825
Schwartz, E. J., Avgerinos, T., & Brumley, D. (2010) · 2010 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2010.26 · Cited by 717
An orchestrated survey of methodologies for automated software test case generation
Anand, S., Burke, E. K., Chen, T. Y., Clark, J., Cohen, M. B., Grieskamp, W., Harman, M., Harrold, M. J., McMinn, P., Bertolino, A., et al. (2013) · Journal of Systems and Software · doi:10.1016/j.jss.2013.02.061 · Cited by 668
Finding and understanding bugs in C compilers
Yang, X., Chen, Y., Eide, E., & Regehr, J. (2011) · ACM SIGPLAN Notices · doi:10.1145/1993316.1993532 · Cited by 586
(2021) · doi:10.1109/tse.2019.2946563 · Cited by 574
Metadata
- Authors
- Godefroid, P., Kiezun, A., & Levin, M. Y.
- Venue
- Proceedings of the 29th ACM SIGPLAN Conference on Programming Language Design and Implementation
- Publisher
- ACM
- Published
- 2008-06-07
- Pages
- 206-215
- ISSN
- 1531-7102 (ISSN-L)
- OpenAlex
- W2065948900
- Cited by
- 462
- References
- 35
- FWCI
- 14.37
- Type
- conference paper
- 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.