The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Symbolic execution and program testing
Open accessAbstract
This paper describes the symbolic execution of programs. Instead of supplying the normal inputs to a program (e.g. numbers) one supplies symbols representing arbitrary values. The execution proceeds as in a normal execution except that values may be symbolic formulas over the input symbols. The difficult, yet interesting issues arise during the symbolic execution of conditional branch type statements. A particular system called EFFIGY which provides symbolic execution for program testing and debugging is also described. It interpretively executes programs written in a simple PL/I style programming language. It includes many standard debugging features, the ability to manage and to prove things about symbolic expressions, a simple program testing manager, and a program verifier. A brief discussion of the relationship between symbolic execution and program proving is also included.
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
Assigning meanings to programs
Floyd, R. W. (1967) · Proceedings of Symposia in Applied Mathematics · doi:10.1090/psapm/019/0235771 · Cited by 1,408
A System to Generate Test Data and Symbolically Execute Programs
Clarke, L. A. (1976) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1976.233817 · Cited by 764
Mathematical Theory of Computation
Manna, Z. (1972) · CERN Document Server (European Organization for Nuclear Research) · Cited by 697
Mathematical Theory of Computation
McCarthy, J. (1991) · doi:10.21236/ada239419 · Cited by 635
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
Introduction to Mathematical Theory of Computation
Manna, Z. (1974) · Cited by 226
King, J. C. (1970) · IFIP Congress · Cited by 220
Self-citationA new approach to program testing
King, J. C. (1975) · ACM SIGPLAN Notices · doi:10.1145/390016.808444 · Cited by 194
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
An Assessment of Techniques for Proving Program Correctness
Elspas, B., Levitt, K., Waldinger, R. J., & Waksman, A. (1972) · ACM Computing Surveys · doi:10.1145/356599.356602 · Cited by 121
Cited by
Making Smart Contracts Smarter
Luu, L., Chu, D.-H., Olickel, H., Saxena, P., & Hobor, A. (2016) · Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/2976749.2978309 · Cited by 2,249
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
Collaboration Processes: Inside the Black Box
Thomson, A. M., & Perry, J. L. (2006) · Public Administration Review · doi:10.1111/j.1540-6210.2006.00663.x · Cited by 1,386
Search‐based software test data generation: a survey
McMinn, P. (2004) · Software Testing, Verification and Reliability · doi:10.1002/stvr.294 · Cited by 1,368
Coward, P. D. (1990) · The Software Life Cycle · doi:10.1016/b978-0-408-03741-9.50028-3 · Cited by 1,290
The oracle problem in software testing: A survey
Barr, E. T., Harman, M., McMinn, P., Shahbaz, M., & Yoo, S. (2015) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2014.2372785 · Cited by 1,104
The Spec# Programming System: An Overview
Barnett, M., Leino, K. R. M., & Schulte, W. (2005) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30569-9_3 · Cited by 986
Machine Learning Testing: Survey, Landscapes and Horizons
Zhang, J. M., Harman, M., Ma, L., & Liu, Y. (2022) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2019.2962027 · Cited by 897
Constraint-based automatic test data generation
DeMilli, R. A., & Offutt, A. J. (1991) · IEEE Transactions on Software Engineering · doi:10.1109/32.92910 · Cited by 804
Pex–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
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
Dynodroid: an input generation system for Android apps
Machiry, A., Tahiliani, R., & Naik, M. (2013) · Proceedings of the 2013 9th Joint Meeting on Foundations of Software Engineering · doi:10.1145/2491411.2491450 · Cited by 701
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
Automated Vulnerability Detection in Source Code Using Deep Representation Learning
Russell, R., Kim, L., Hamilton, L., Lazovich, T., Harer, J., Ozdemir, O., Ellingwood, P., & McConley, M. (2018) · 2018 17th IEEE International Conference on Machine Learning and Applications (ICMLA) · doi:10.1109/icmla.2018.00120 · Cited by 623
The software model checker Blast: Applications to software engineering
Beyer, D., Henzinger, T. A., Jhala, R., & Majumdar, R. (2007) · International Journal on Software Tools for Technology Transfer · doi:10.1007/s10009-007-0044-z · Cited by 585
(2021) · doi:10.1109/tse.2019.2946563 · Cited by 574
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
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
Test input generation with java PathFinder
Visser, W., Pǎsǎreanu, C. S., & Khurshid, S. (2004) · Proceedings of the 2004 ACM SIGSOFT international symposium on Software testing and analysis · doi:10.1145/1007512.1007526 · Cited by 501
Exploring Multiple Execution Paths for Malware Analysis
Moser, A., Kruegel, C., & Kirda, E. (2007) · 2007 IEEE Symposium on Security and Privacy (SP '07) · doi:10.1109/sp.2007.17 · Cited by 488
A Survey on Ethereum Systems Security: Vulnerabilities, Attacks, and Defenses
Chen, H., Pendleton, M., Njilla, L., & Xu, S. (2021) · ACM Computing Surveys · doi:10.1145/3391195 · Cited by 480
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
Grammar-based whitebox fuzzing
Godefroid, P., Kiezun, A., & Levin, M. Y. (2008) · Proceedings of the 29th ACM SIGPLAN Conference on Programming Language Design and Implementation · doi:10.1145/1375581.1375607 · Cited by 462
Validation, Verification, and Testing of Computer Software
Adrion, W. R., Branstad, M. A., & Cherniavsky, J. C. (1982) · ACM Computing Surveys · doi:10.1145/356876.356879 · Cited by 426
Majumdar, R., & Sen, K. (2007) · 29th International Conference on Software Engineering (ICSE'07) · doi:10.1109/icse.2007.41 · Cited by 426
Jhala, R., & Majumdar, R. (2009) · ACM Computing Surveys · doi:10.1145/1592434.1592438 · Cited by 418
Heuristics 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
Compositional dynamic test generation
Godefroid, P. (2007) · ACM SIGPLAN Notices · doi:10.1145/1190215.1190226 · Cited by 408
Le Goues, C., Pradel, M., & Roychoudhury, A. (2019) · Communications of the ACM · doi:10.1145/3318162 · Cited by 410
Leino, K. R. M. (1998) · Programming Concepts and Methods PROCOMET ’98 · doi:10.1007/978-0-387-35358-6_1 · Cited by 393
Verification, Validation, and Testing
Balci, O. (1998) · Handbook of Simulation · doi:10.1002/9780470172445.ch10 · Cited by 391
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
A fortran language system for mutation‐based software testing
King, K. N., & Offutt, A. J. (1991) · Software: Practice and Experience · doi:10.1002/spe.4380210704 · Cited by 379
Validation, verification, and testing techniques throughout the life cycle of a simulation study
Balci, O. (1994) · Annals of Operations Research · doi:10.1007/bf02136828 · Cited by 354
Panichella, A., Kifetew, F. M., & Tonella, P. (2018) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2017.2663435 · Cited by 352
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
Automatic Software Repair: A Survey
Gazzola, L., Micucci, D., & Mariani, L. (2019) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2017.2755013 · Cited by 327
Symbolic execution for software testing in practice: preliminary assessment
Cadar, C., Godefroid, P., Khurshid, S., Păsăreanu, C. S., Sen, K., Tillmann, N., & Visser, W. (2011) · Proceedings of the 33rd International Conference on Software Engineering · doi:10.1145/1985793.1985995 · Cited by 325
AppsPlayground: automatic security analysis of smartphone applications
Rastogi, V., Chen, Y., & Enck, W. (2013) · Proceedings of the third ACM conference on Data and application security and privacy · doi:10.1145/2435349.2435379 · Cited by 322
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
“Symbolic execution [41] is a program testing and debugging technique in which symbolic inputs are supplied instead of concrete inputs.”
BackgroundCompositional 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
Symstra: A Framework for Generating Object-Oriented Unit Tests Using Symbolic Execution
Xie, T., Marinov, D., Schulte, W., & Notkin, D. (2005) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-31980-1_24 · Cited by 287
Li, J., Zhao, B., & Zhang, C. (2018) · Cybersecurity · doi:10.1186/s42400-018-0002-y · Cited by 278
Differential symbolic execution
Person, S., Dwyer, M. B., Elbaum, S., & Pǎsǎreanu, C. S. (2008) · Proceedings of the 16th ACM SIGSOFT International Symposium on Foundations of software engineering · doi:10.1145/1453101.1453131 · Cited by 268
Avgerinos, T., Cha, S. K., Rebert, A., Schwartz, E. J., Woo, M., & Brumley, D. (2014) · Communications of the ACM · doi:10.1145/2560217.2560219 · Cited by 263
Symbolic PathFinder: symbolic execution of Java bytecode
Păsăreanu, C. S., & Rungta, N. (2010) · Proceedings of the IEEE/ACM international conference on Automated software engineering · doi:10.1145/1858996.1859035 · Cited by 259
Sereum: Protecting Existing Smart Contracts Against Re-Entrancy Attacks
Rodler, M., Li, W., Karame, G. O., & Davi, L. (2019) · Proceedings 2019 Network and Distributed System Security Symposium · doi:10.14722/ndss.2019.23413 · Cited by 259
An extended overview of the Mothra software testing environment
DeMillo, R. A., Guindi, D. S., McCracken, W. M., Offutt, A. J., & King, K. N. (2003) · [1988] Proceedings. Second Workshop on Software Testing, Verification, and Analysis · doi:10.1109/wst.1988.5369 · Cited by 257
BinHunt: Automatically Finding Semantic Differences in Binary Programs
Gao, D., Reiter, M. K., & Song, D. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-88625-9_16 · Cited by 255
Automatic Generation of Floating-Point Test Data
Miller, W., & Spooner, D. L. (1976) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1976.233818 · Cited by 252
Brubaker, C., Jana, S., Ray, B., Khurshid, S., & Shmatikov, V. (2014) · 2014 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2014.15 · Cited by 218
BugRedux: Reproducing field failures for in-house debugging
Jin, W., & Orso, A. (2012) · 2012 34th International Conference on Software Engineering (ICSE) · doi:10.1109/icse.2012.6227168 · Cited by 122
Automatically Generating Test Cases for Specification Mining
Dallmeier, V., Knopp, N., Mallon, C., Fraser, G., Hack, S., & Zeller, A. (2012) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2011.105 · Cited by 67
Program Logic Based Software Plagiarism Detection
Zhang, F., Wu, D., Liu, P., & Zhu, S. (2014) · 2014 IEEE 25th International Symposium on Software Reliability Engineering · doi:10.1109/issre.2014.18 · Cited by 57
Clover: Closed-Loop Verifiable Code Generation
Sun, C., Sheng, Y., Padon, O., & Barrett, C. (2024) · Lecture Notes in Computer Science · doi:10.1007/978-3-031-65112-0_7 · Cited by 43
Clover: Closed-Loop Verifiable Code Generation
Sun, C., Sheng, Y., Padon, O., & Barrett, C. (2023) · arXiv · doi:10.48550/arxiv.2310.17807 · Cited by 43
“Algorithm 1 Clover Consistency Check ( k = 1) Equivalence Checking for Code Standard equivalence checks for code include input-output comparisons, concolic testing ([8, 9, 33, 63]), and even full formal equivalence checking (e.g., [18]).”
BackgroundMing, J., Zhang, F., Wu, D., Liu, P., & Zhu, S. (2016) · IEEE Transactions on Reliability · doi:10.1109/tr.2016.2570554 · Cited by 33
Dsc+Mock: a test case + mock class generator in support of coding against interfaces
Islam, M., & Csallner, C. (2010) · Proceedings of the Eighth International Workshop on Dynamic Analysis · doi:10.1145/1868321.1868326 · Cited by 30
Kuhn, R., Kacker, R. N., Lei, Y., & Simos, D. (2020) · Computer · doi:10.1109/mc.2019.2951980 · Cited by 26
Evaluating the Ability of GPT-4o to Generate Verifiable Specifications in VeriFast
Rego, M., Fan, W., Hu, X., Dod, S., Ni, Z., Xie, D., DiVincenzo, J., & Tan, L. (2025) · 2025 IEEE/ACM Second International Conference on AI Foundation Models and Software Engineering (Forge) · doi:10.1109/forge66646.2025.00035 · Cited by 2
Peng, C., Jiang, M., Zhou, Y., & Wu, L. (2026) · Proceedings of the ACM on Software Engineering · doi:10.1145/3808141
Metadata
- Authors
- King, J. C.
- Venue
- Communications of the ACM
- Published
- 1976-07
- Volume
- 19
- Issue
- 7
- Pages
- 385-394
- ISSN
- 0001-0782 (ISSN-L)
- 1557-7317
- OpenAlex
- W2101512909
- Cited by
- 3,031
- References
- 11
- FWCI
- 48.04
- Type
- journal article
- 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.