The DOI matches its Crossref record; 39 of the 39 references it cites were found in a registry or an index.
Test input generation with java PathFinder
Abstract
We show how model checking and symbolic execution can be used to generate test inputs to achieve structural coverage of code that manipulates complex data structures. We focus on obtaining branch-coverage during unit testing of some of the core methods of the red-black tree implementation in the Java TreeMap library, using the Java PathFinder model checker. Three different test generation techniques will be introduced and compared, namely, straight model checking of the code, model checking used in a black-box fashion to generate all inputs up to a fixed size, and lastly, model checking used during white-box test input generation. The main contribution of this work is to show how efficient white-box test input generation can be done for code manipulating complex data, taking into account complex method preconditions.
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
Adhi Harmoko, S., M.Komp, Jacquard, J. M., Zuse, K., & Eniac (2005) · Cited by 18,035
Rayward-Smith, V. J. (1991) · Journal of the Operational Research Society · doi:10.1057/jors.1991.155 · Cited by 16,821
Clarke, E. M., Grümberg, O., & Long, D. (1996) · Cited by 6,813
The Massachusetts Institute of Technology
Endowed, S. C. F. (1999) · Anthropology News · doi:10.1111/an.1999.40.2.6 · Cited by 3,135
Symbolic execution and program testing
King, J. C. (1976) · Communications of the ACM · doi:10.1145/360248.360252 · Cited by 3,031
(1998) · PDCA/Test · doi:10.1201/9781420048131.axh · Cited by 1,900
Visser, W., Havelund, K., Brat, G., Park, S., & Lerda, F. (2003) · Automated Software Engineering · doi:10.1023/a:1022920129859 · Cited by 1,343
Self-citationCoward, P. D. (1990) · The Software Life Cycle · doi:10.1016/b978-0-408-03741-9.50028-3 · Cited by 1,290
Bandera: extracting finite-state models from Java source code
Corbett, J. C., Dwyer, M. B., Hatcliff, J., Laubach, S., Păsăreanu, C. S., Robby, & Zheng, H. (2000) · Proceedings of the 22nd international conference on Software engineering - ICSE '00 · doi:10.1145/337180.337234 · Cited by 1,059
Self-citationThe S LAM project: debugging system software via static analysis
Ball, T., & Rajamani, S. K. (2002) · Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/503272.503274 · Cited by 923
Model checking for programming languages using VeriSoft
Godefroid, P. (1997) · Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '97 · doi:10.1145/263699.263717 · Cited by 825
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
The Omega test: a fast and practical integer programming algorithm for dependence analysis
Pugh, W. (1991) · Proceedings of the 1991 ACM/IEEE conference on Supercomputing - Supercomputing '91 · doi:10.1145/125826.125848 · Cited by 750
Automatically Validating Temporal Safety Properties of Interfaces
Ball, T., & Rajamani, S. K. (2001) · Cited by 599
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
Self-citationA practical algorithm for exact array dependence analysis
Pugh, W. (1992) · Communications of the ACM · doi:10.1145/135226.135233 · Cited by 568
Toward a theory of test data selection
Goodenough, J. B., & Gerhart, S. L. (1975) · ACM SIGPLAN Notices · doi:10.1145/390016.808473 · Cited by 514
Software Verification with BLAST
Henzinger, T. A., Jhala, R., Majumdar, R., & Sutre, G. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-44829-2_17 · Cited by 424
Generating Tests from UML Specifications
Offutt, J., & Abdurazik, A. (1999) · Cited by 329
Solving shape-analysis problems in languages with destructive updating
Sagiv, M., Reps, T., & Wilhelm, R. (1998) · ACM Transactions on Programming Languages and Systems · doi:10.1145/271510.271517 · Cited by 322
The ASTOOT approach to testing object-oriented programs
Doong, R.-K., & Frankl, P. G. (1994) · ACM Transactions on Software Engineering and Methodology · doi:10.1145/192218.192221 · Cited by 321
Using model checking to generate tests from specifications
Ammann, P. E., Black, P. E., & Majurski, W. (2002) · Proceedings Second International Conference on Formal Engineering Methods (Cat.No.98EX241) · doi:10.1109/icfem.1998.730569 · Cited by 320
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
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-citationTestEra: a novel framework for automated testing of Java programs
Marinov, D., & Khurshid, S. (2005) · Proceedings 16th Annual International Conference on Automated Software Engineering (ASE 2001) · doi:10.1109/ase.2001.989787 · Cited by 259
Self-citationTVLA: A System for Implementing Static Analyses
Lev-Ami, T., & Sagiv, M. (2000) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45099-3_15 · Cited by 250
An Approach to Program Testing
Huang, J. C. (1975) · ACM Computing Surveys · doi:10.1145/356651.356652 · Cited by 229
Automatic test data generation using constraint solving techniques
Gotlieb, A., Botella, B., & Rueher, M. (1998) · Proceedings of the 1998 ACM SIGSOFT international symposium on Software testing and analysis · doi:10.1145/271771.271790 · Cited by 229
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
A deadlock detection tool for concurrent Java programs
Demartini, C. G., Iosif, R., & Sisto, R. (1999) · Software Practice and Experience · doi:10.1002/(sici)1097-024x(199906)29:7<577::aid-spe246>3.0.co;2-v · Cited by 137
Automated test data generation for programs with procedures
Korel, B. (1996) · ACM SIGSOFT Software Engineering Notes · doi:10.1145/226295.226319 · Cited by 121
Symbolically Computing Most-Precise Abstract Operations for Shape Analysis
Yorsh, G., Reps, T., & Sagiv, M. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-24730-2_39 · Cited by 94
A specification-based coverage metric to evaluate test sets
Ammann, P., & Black, P. E. (2003) · IEEE International Symposium on High Assurance Systems Engineering (HASE) · doi:10.1109/hase.1999.809499 · Cited by 84
Automated test data generation for programs with procedures
Korel, B. (1996) · ACM SIGSOFT International Symposium on Software Testing and Analysis (ISSTA) · doi:10.1145/229000.226319 · Cited by 82
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
(1990)
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
DART: directed automated random testing
Godefroid, P., Klarlund, N., & Sen, K. (2005) · ACM SIGPLAN Notices · doi:10.1145/1064978.1065036 · Cited by 2,067
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
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
Metadata
- Authors
- Visser, W., Pǎsǎreanu, C. S., & Khurshid, S.
- Venue
- Proceedings of the 2004 ACM SIGSOFT international symposium on Software testing and analysis
- Publisher
- ACM
- Published
- 2004-07
- Pages
- 97-107
- OpenAlex
- W2171683519
- Cited by
- 501
- References
- 39
- FWCI
- 17.49
- 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.