The DOI matches its Crossref record; 30 of the 30 references it cites were found in a registry or an index.
Hybrid Concolic Testing
Abstract
We present hybrid concolic testing, an algorithm that interleaves random testing with concolic execution to obtain both a deep and a wide exploration of program state space. Our algorithm generates test inputs automatically by interleaving random testing until saturation with bounded exhaustive symbolic exploration of program points. It thus combines the ability of random search to reach deep program states quickly together with the ability of concolic testing to explore states in a neighborhood exhaustively. We have implemented our algorithm on top of CUTE and applied it to obtain better branch coverage for an editor implementation (VIM 5.7, 150 K lines of code) as well as a data structure implementation in C. Our experiments suggest that hybrid concolic testing can handle large programs and provide, for the same testing budget, almost 4times the branch coverage than random testing and almost 2times that of concolic testing.
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
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-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-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
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
(2000) · doi:10.1145/351240.351266 · Cited by 753
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
JCrasher: an automatic robustness tester for Java
Csallner, C., & Smaragdakis, Y. (2004) · Software: Practice and Experience · doi:10.1002/spe.602 · Cited by 426
The chaining approach for software test data generation
Ferguson, R., & Korel, B. (1996) · ACM Transactions on Software Engineering and Methodology · doi:10.1145/226155.226158 · Cited by 360
CUTE: A Concolic Unit Testing Engine for C
Sen, K., Marinov, D., & Agha, G. (2005) · doi:10.21236/ada482657 · Cited by 300
Self-citationSymstra: 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
An empirical study of the robustness of Windows NT applications using random testing
Forrester, J. E., & Miller, B. P. (2000) · Cited by 271
Execution 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
Eclat: Automatic Generation and Classification of Test Inputs
Pacheco, C., & Ernst, M. D. (2005) · Lecture Notes in Computer Science · doi:10.1007/11531142_22 · Cited by 250
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
Check 'n' crash: combining static checking and testing
Csallner, C., & Smaragdakis, Y. (2005) · Proceedings of the 27th international conference on Software engineering - ICSE '05 · doi:10.1145/1062455.1062533 · Cited by 220
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
Generating Tests from Counterexamples
Beyer, D., Chlipala, A. J., Henzinger, T. A., et al. (2004) · Cited by 198
Automated test data generation using an iterative relaxation method
Gupta, N., Mathur, A. P., & Soffa, M. L. (1998) · Proceedings of the 6th ACM SIGSOFT international symposium on Foundations of software engineering · doi:10.1145/288195.288321 · Cited by 178
Rostra: A framework for detecting redundant object-oriented unit tests
Xie, T., Profile, S., Xie, T., Marinov, D., & Notkin, D. (2004) · Cited by 138
Generating tests from counterexamples
Beyer, D., Chlipala, A. J., Henzinger, T. A., et al. (2004) · Proceedings/Proceedings - International Conference on Software Engineering · doi:10.1109/icse.2004.1317455 · Cited by 124
Jhala, R., & Majumdar, R. (2005) · ACM SIGPLAN Notices · doi:10.1145/1064978.1065016 · Cited by 107
Self-citationJhala, R., & Majumdar, R. (2005) · Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation · doi:10.1145/1065010.1065016 · Cited by 77
Self-citationMinimization of Randomized Unit Test Cases
Yong, L., & Andrews, J. H. (2006) · Proceedings/Proceedings - International Symposium on Software Reliability Engineering · doi:10.1109/issre.2005.28 · Cited by 69
Tillmann, N., & Schulte, W. (2005) · ACM SIGSOFT Software Engineering Notes · doi:10.1145/1095430.1081749 · Cited by 66
d’Amorim, M., Pacheco, C., Xie, T., Marinov, D., & Ernst, M. D. (2006) · IEEE/ACM International Conference on Automated Software Engineering (ASE) · doi:10.1109/ase.2006.13 · Cited by 63
Generating test data for functions with pointer inputs
Visvanathan, S., & Gupta, N. (2002) · IEEE/ACM International Conference on Automated Software Engineering (ASE) · doi:10.1109/ase.2002.1115007 · Cited by 49
Check 'n' crash: combining static checking and testing
Csallner, C., & Smaragdakis, Y. (2005) · ACM/IEEE International Conference on Software Engineering: Companion Proceedings (ICSE-Companion) · doi:10.1109/icse.2005.1553585 · Cited by 40
Test input generation for red-black trees using abstraction
Visser, W., Păsăreanu, C. S., & Pelánek, R. (2005) · IEEE/ACM International Conference on Automated Software Engineering (ASE) · doi:10.1145/1101908.1101983 · Cited by 19
Cited by
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
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-citationDynodroid: 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
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
Metadata
- Authors
- Majumdar, R., & Sen, K.
- Venue
- 29th International Conference on Software Engineering (ICSE'07)
- Publisher
- IEEE
- Published
- 2007-05
- Pages
- 416-426
- ISSN
- 0270-5257 (ISSN-L)
- OpenAlex
- W2104993088
- Cited by
- 426
- References
- 30
- FWCI
- 14.89
- 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.