The DOI matches its Crossref record; 28 of the 28 references it cites were found in a registry or an index.
Korat: automated testing based on Java predicates
Abstract
This paper presents Korat, a novel framework for automated testing of Java programs. Given a formal specification for a method, Korat uses the method precondition to automatically generate all (nonisomorphic) test cases up to a given small size. Korat then executes the method on each test case, and uses the method postcondition as a test oracle to check the correctness of each output.To generate test cases for a method, Korat constructs a Java predicate (i.e., a method that returns a boolean) from the method's pre-condition. The heart of Korat is a technique for automatic test case generation: given a predicate and a bound on the size of its inputs, Korat generates all (nonisomorphic) inputs for which the predicate returns true. Korat exhaustively explores the bounded input space of the predicate but does so efficiently by monitoring the predicate's executions and pruning large portions of the search space.This paper illustrates the use of Korat for testing several data structures, including some from the Java Collections Framework. The experimental results show that it is feasible to generate test cases from Java predicates, even when the search space for inputs is very large. This paper also compares Korat with a testing framework based on declarative specifications. Contrary to our initial expectation, the experiments show that Korat generates test cases much faster than the declarative framework.
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
(1994) · Cited by 21,711
Rayward-Smith, V. J. (1991) · Journal of the Operational Research Society · doi:10.1057/jors.1991.155 · Cited by 16,821
The Unified Modeling Language reference manual
Rumbaugh, J. E., Booch, G., & Jacobson, I. (1999) · CERN Document Server (European Organization for Nuclear Research) · Cited by 4,175
Holzmann, G. J. (1997) · IEEE Transactions on Software Engineering · doi:10.1109/32.588521 · Cited by 3,803
Clarke, E., McMillan, K., Campos, S., & Hartonas-Garmhausen, V. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-61474-5_93 · Cited by 2,839
(1998) · PDCA/Test · doi:10.1201/9781420048131.axh · Cited by 1,900
McMillan, K. L. (1993) · Springer eBooks · doi:10.1007/978-1-4615-3190-6 · Cited by 1,677
Visser, W., Havelund, K., Brat, G., Park, S., & Lerda, F. (2003) · Automated Software Engineering · doi:10.1023/a:1022920129859 · Cited by 1,343
Coward, 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
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
Preliminary design of JML: a behavioral interface specification language for java
Leavens, G. T., Baker, A. L., & Ruby, C. (2006) · ACM SIGSOFT Software Engineering Notes · doi:10.1145/1127878.1127884 · Cited by 790
Software testing techniques (2nd ed.)
Beizer, B. (1990) · Cited by 744
The design and implementation of an intentional naming system
Adjie-Winoto, W., Schwartz, E., Balakrishnan, H., & Lilley, J. (1999) · Proceedings of the seventeenth ACM symposium on Operating systems principles · doi:10.1145/319151.319164 · Cited by 673
The encyclopedia of integer sequences
(1995) · Choice Reviews Online · doi:10.5860/choice.33-2176 · Cited by 572
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
Leino, K. R. M. (1998) · Programming Concepts and Methods PROCOMET ’98 · doi:10.1007/978-0-387-35358-6_1 · Cited by 393
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
TEST-INFECTED: PROGRAMMERS LOVE WRITING TESTS
Beck, K., & Gamma, E. (2000) · More Java Gems · doi:10.1017/cbo9780511550881.029 · Cited by 274
TestEra: 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
A Simple and Practical Approach to Unit Testing: The JML and JUnit Way
Cheon, Y., & Leavens, G. T. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-47993-7_10 · Cited by 228
Program Development in Java: Abstraction, Specification, and Object-Oriented Design
Liskov, B. H., & Guttag, J. V. (1986) · International Linear Collider · Cited by 222
Finding bugs with a constraint solver
Jackson, D. N., & Vaziri, M. (2000) · ACM SIGSOFT International Symposium on Software Testing and Analysis (ISSTA) · doi:10.1145/347324.383378 · Cited by 209
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
Kunčak, V., Lam, P., & Rinard, M. (2002) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/503272.503276 · Cited by 124
(1990)
Cited by
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
Self-citationAndroid permissions demystified
Felt, A. P., Chin, E., Hanna, S., Song, D., & Wagner, D. (2011) · Proceedings of the 18th ACM conference on Computer and communications security · doi:10.1145/2046707.2046779 · Cited by 1,291
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
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-citation
Metadata
- Authors
- Boyapati, C., Khurshid, S., & Marinov, D.
- Venue
- ACM SIGSOFT Software Engineering Notes
- Published
- 2002-07
- Volume
- 27
- Issue
- 4
- Pages
- 123-133
- ISSN
- 0163-5948 (ISSN-L)
- OpenAlex
- W2162120832
- Cited by
- 593
- References
- 28
- FWCI
- 95.56
- Type
- journal article
- 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.