The DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
CUTE: a concolic unit testing engine for C
Abstract
In unit testing, a program is decomposed into units which are collections of functions. A part of unit can be tested by generating inputs for a single entry function. The entry function may contain pointer arguments, in which case the inputs to the unit are memory graphs. The paper addresses the problem of automating unit testing with memory graphs as inputs. The approach used builds on previous work combining symbolic and concrete execution, and more specifically, using such a combination to generate test inputs to explore all feasible execution paths. The current work develops a method to represent and track constraints that capture the behavior of a symbolic execution of a unit with memory graphs as inputs. Moreover, an efficient constraint solver is proposed to facilitate incremental generation of such test inputs. Finally, CUTE, a tool implementing the method is described together with the results of applying CUTE to real-world examples of C code.
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
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-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-citationHenzinger, T. A., Jhala, R., Majumdar, R., & Sutre, G. (2002) · Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/503272.503279 · Cited by 1,155
QuickCheck: 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
CIL: Intermediate Language and Tools for Analysis and Transformation of C Programs
Necula, G. C., McPeak, S., Rahul, S. P., & Weimer, W. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45937-5_16 · Cited by 977
(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
Self-citationGeneralized 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
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
Korat: 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
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
Self-citationCVC Lite: A New Implementation of the Cooperating Validity Checker
Barrett, C., & Berezin, S. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-27813-9_49 · Cited by 275
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
Generating Tests from Counterexamples
Beyer, D., Chlipala, A. J., Henzinger, T. A., et al. (2004) · Cited by 198
Generating finite state machines from abstract state machines
Grieskamp, W., Gurevich, Y. G., Schulte, W., et al. (2002) · ACM SIGSOFT Software Engineering Notes · doi:10.1145/566171.566190 · Cited by 184
Rostra: A framework for detecting redundant object-oriented unit tests
Xie, T., Profile, S., Xie, T., Marinov, D., & Notkin, D. (2004) · Cited by 138
Self-citationGenerating test data for branch coverage
Gupta, N., Mathur, A. P., & Soffa, M. L. (2000) · IEEE/ACM International Conference on Automated Software Engineering (ASE) · doi:10.1109/ase.2000.873666 · Cited by 128
Generating finite state machines from abstract state machines
Grieskamp, W., Gurevich, Y. G., Schulte, W., et al. (2002) · ACM SIGSOFT International Symposium on Software Testing and Analysis (ISSTA) · doi:10.1145/566172.566190 · Cited by 80
Finding Feasible Counter-examples when Model Checking Abstracted Java Programs
Păsăreanu, C. S., Dwyer, M. B., & Visser, W. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45319-9_20 · Cited by 66
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
Research works printed but not linked: 13
- 10.5555/998675.999437 · doi:10.5555/998675.999437
- 10.5555/1267102.1267108 · doi:10.5555/1267102.1267108
- 10.5555/786768.786970 · doi:10.5555/786768.786970
- 10.5555/1765871.1765924 · doi:10.5555/1765871.1765924
- 10.1109/ICSM.1990.131379 · doi:10.1109/icsm.1990.131379
- E. Larson and T. Austin . High coverage detection of input-related security faults . In Proc. of the 12th USENIX Security Symposium (Security '03) , Aug. 2003 . E. Larson and T. Austin. High coverage detection of input-related security faults. In Proc. of the 12th USENIX Security Symposium (Security '03), Aug. 2003.
- 10.1090/psapm/019/0242403 · doi:10.1090/psapm/019/0242403
- 10.5555/647478.727796 · doi:10.5555/647478.727796
- 10.1145/229000.226317 · doi:10.1145/229000.226317
- Parasoft. Jtest manuals version 6.0. Online manual , February 2005 . http://www.parasoft.com/. Parasoft. Jtest manuals version 6.0. Online manual, February 2005. http://www.parasoft.com/.
- 10.5555/646485.694465 · doi:10.5555/646485.694465
- 10.5555/786769.787004 · doi:10.5555/786769.787004
- 10.5555/1025115.1025219 · doi:10.5555/1025115.1025219
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
An Analysis and Survey of the Development of Mutation Testing
Jia, Y., & Harman, M. (2011) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2010.62 · Cited by 1,745
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
Software Testing Research: Achievements, Challenges, Dreams
Bertolino, A. (2007) · Future of Software Engineering (FOSE '07) · doi:10.1109/fose.2007.25 · Cited by 840
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
Metadata
- Authors
- Sen, K., Marinov, D., & Agha, G.
- Venue
- Proceedings of the 10th European software engineering conference held jointly with 13th ACM SIGSOFT international symposium on Foundations of software engineering
- Publisher
- ACM
- Published
- 2005-09
- Pages
- 263-272
- OpenAlex
- W2009489720
- Cited by
- 1,651
- References
- 25
- FWCI
- 27.45
- 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.