The DOI matches its Crossref record; 43 of the 43 references it cites were found in a registry or an index.
Symbolic execution for software testing in practice: preliminary assessment
Abstract
We present results for the "Impact Project Focus Area" on the topic of symbolic execution as used in software testing. Symbolic execution is a program analysis technique introduced in the 70s that has received renewed interest in recent years, due to algorithmic advances and increased availability of computational power and constraint solving technology. We review classical symbolic execution and some modern extensions such as generalized symbolic execution and dynamic test generation. We also give a preliminary assessment of the use in academia, research labs, and industry.
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
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 · cited 1×
“The model-checker systematically handles the non-determinism introduced when creating different heap configurations and when updating path conditions.”
MethodSymbolic 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
Self-citationDART: directed automated random testing
Godefroid, P., Klarlund, N., & Sen, K. (2005) · ACM SIGPLAN Notices · doi:10.1145/1064978.1065036 · Cited by 2,067
Self-citationCUTE: 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
Self-citationDART: 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-citationAutomated Whitebox Fuzz Testing.
Godefroid, P., Levin, M. Y., & Molnar, D. A. (2008) · Cited by 1,095
Self-citationPex–White Box Test Generation for .NET
Tillmann, N., & de Halleux, J. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-79124-9_10 · Cited by 791
Self-citationEXE: 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
Self-citationSchwartz, E. J., Avgerinos, T., & Brumley, D. (2010) · 2010 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2010.26 · Cited by 717
A Decision Procedure for Bit-Vectors and Arrays
Ganesh, V., & Dill, D. L. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-73368-3_52 · Cited by 585
Generalized Symbolic Execution for Model Checking and Testing
Khurshid, S., PĂsĂreanu, C. S., & Visser, W. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-36577-x_40 · Cited by 568
Self-citationA static analyzer for finding dynamic programming errors
Bush, W. R., Pincus, J. D., & Sielaff, D. (2000) · Software Practice and Experience · doi:10.1002/(sici)1097-024x(200006)30:7<775::aid-spe309>3.0.co;2-h · Cited by 512
Majumdar, R., & Sen, K. (2007) · 29th International Conference on Software Engineering (ICSE'07) · doi:10.1109/icse.2007.41 · Cited by 426
Self-citationHeuristics for Scalable Dynamic Test Generation
Burnim, J., & Sen, K. (2008) · 2008 23rd IEEE/ACM International Conference on Automated Software Engineering · doi:10.1109/ase.2008.69 · Cited by 412
Self-citationCompositional dynamic test generation
Godefroid, P. (2007) · ACM SIGPLAN Notices · doi:10.1145/1190215.1190226 · Cited by 408
Self-citationSELECT—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
CUTE and jCUTE: Concolic Unit Testing and Explicit Path Model-Checking Tools
Sen, K., & Agha, G. (2006) · Lecture Notes in Computer Science · doi:10.1007/11817963_38 · Cited by 389
Self-citationProgram Flow Analysis: Theory and Application
Muchnick, S. S., & Jones, N. D. (1981) · Medical Entomology and Zoology · Cited by 361
On the Automated Generation of Program Test Data
Ramamoorthy, C. V., Ho, S.-B. F., & Chen, W. T. (1976) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1976.233835 · Cited by 319
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-citationExecution Generated Test Cases: How to Make Systems Code Crash Itself
Cadar, C., & Engler, D. (2005) · Lecture Notes in Computer Science · doi:10.1007/11537328_2 · Cited by 254
Self-citationSymbolic Testing and the DISSECT Symbolic Evaluation System
Howden, W. E. (1977) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1977.231144 · Cited by 251
Fitness-guided path exploration in dynamic symbolic execution
Xie, T., Tillmann, N., de Halleux, J., & Schulte, W. (2009) · 2009 IEEE/IFIP International Conference on Dependable Systems & Networks · doi:10.1109/dsn.2009.5270315 · Cited by 238
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
Self-citationJPF–SE: A Symbolic Execution Extension to Java PathFinder
Anand, S., Păsăreanu, C. S., & Visser, W. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-71209-1_12 · Cited by 232
Self-citationA survey of new trends in symbolic execution for software testing and analysis
Păsăreanu, C. S., & Visser, W. (2009) · International Journal on Software Tools for Technology Transfer · doi:10.1007/s10009-009-0118-1 · Cited by 231
Self-citationExecution synthesis: a technique for automated software debugging
Zamfir, C., & Candea, G. (2010) · Proceedings of the 5th European conference on Computer systems · doi:10.1145/1755913.1755946 · Cited by 222
Tillmann, N., & Schulte, W. (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.1081749 · Cited by 213
Self-citationAEG: Automatic Exploit Generation
Avgerinos, T., Kil, S., Hao, B. L. T., & Brumley, D. (2018) · doi:10.1184/r1/6468296 · Cited by 202
Dynamic test generation to find integer bugs in x86 binary linux programs
Molnár, D., Li, X. C., & Wagner, D. A. (2009) · Cited by 198
Directed incremental symbolic execution
Person, S., Yang, G., Rungta, N., & Khurshid, S. (2011) · ACM SIGPLAN Notices · doi:10.1145/1993316.1993558 · Cited by 178
Self-citationTest input generation for java containers using state matching
Visser, W., Pǎsǎreanu, C. S., & Pelánek, R. (2006) · Proceedings of the 2006 international symposium on Software testing and analysis · doi:10.1145/1146238.1146243 · Cited by 168
Self-citationClarke, L. A. (1976) · ACM Annual Conference · doi:10.1145/800191.805647 · Cited by 110
Automatically generating malicious disks using symbolic execution
Yang, J., Sar, C., Twohey, P., et al. (2006) · Proceedings - IEEE Symposium on Security and Privacy/Proceedings of the ... IEEE Symposium on Security and Privacy · doi:10.1109/sp.2006.7 · Cited by 106
Directed test suite augmentation: techniques and tradeoffs
Xu, Z., Kim, Y., Kim, M., Rothermel, G., & Cohen, M. B. (2010) · ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering (ESEC/FSE) · doi:10.1145/1882291.1882330 · Cited by 105
Stable deterministic multithreading through schedule memoization
Cui, H., Wu, J., Tsai, C.-C., et al. (2010) · doi:10.5555/1924943.1924958 · Cited by 96
FloPSy - Search-Based Floating Point Constraint Solving for Symbolic Execution
Lakhotia, K., Tillmann, N., Harman, M., & de Halleux, J. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-16573-3_11 · Cited by 82
Self-citationjFuzz: A Concolic Whitebox Fuzzer for Java
Jayaraman, K., Harvison, D., Ganesh, V., & Kieżun, A. (2009) · Cited by 74
CORAL: Solving Complex Constraints for Symbolic PathFinder
Souza, M., Borges, M., d’Amorim, M., et al. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-20398-5_26 · Cited by 70
Reducing Test Inputs Using Information Partitions
Majumdar, R., & Xu, R.-G. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-02658-4_41 · Cited by 45
Analysis & Detection of SQL Injection Vulnerabilities via Automatic Test Case Generation of Programs
Ruse, M. E., Sarkar, T., & Basu, S. (2010) · IEEE/IPSJ International Symposium on Applications and the Internet (SAINT) · doi:10.1109/saint.2010.60 · Cited by 44
Scalable automated methods for dynamic program analysis
Agha, G., & Sen, K. (2006) · Cited by 32
Self-citation
Cited by
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
Self-citationA 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
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
Toward variability-aware testing
Kästner, C., von Rhein, A., Erdweg, S., Pusch, J., Apel, S., Rendel, T., & Ostermann, K. (2012) · Proceedings of the 4th International Workshop on Feature-Oriented Software Development - FOSD '12 · doi:10.1145/2377816.2377817 · Cited by 63
Metadata
- Authors
- Cadar, C., Godefroid, P., Khurshid, S., Păsăreanu, C. S., Sen, K., Tillmann, N., & Visser, W.
- Venue
- Proceedings of the 33rd International Conference on Software Engineering
- Publisher
- ACM
- Published
- 2011-05-21
- Pages
- 1066-1071
- ISSN
- 0270-5257 (ISSN-L)
- OpenAlex
- W2097444001
- Cited by
- 325
- References
- 43
- FWCI
- 24.39
- 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.