The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
Automatic extraction of object-oriented component interfaces
Abstract
Component-based software design is a popular and effective approach to designing large systems. While components typically have well-defined interfaces, sequencing information---which calls must come in which order---is often not formally specified.This paper proposes using multiple finite statemachine (FSM) submodels to model the interface of a class. A submodel includes a subset of methods that, for example, implement a Java interface, or access some particular field. Each state-modifying method is represented as a state in the FSM, and transitions of the FSMs represent allow able pairs of consecutive methods. In addition, state-preserving methods are constrained to execute only under certain states.We have designed and implemented a system that includes static analyses to deduce illegal call sequences in a program, dynamic instrumentation techniques to extract models from execution runs, and a dynamic model checker that ensures that the code conforms to the model. Extracted models can serve as documentation; they can serve as constraints to be enforced by a static checker; they can be studied directly by developers to determine if the program is exhibiting unexpected behavior; or they can be used to determine the completeness of a test suite.Our system has been run on several large code bases, including the joeq virtual machine, the basic Java libraries, and the Java 2 Enterprise Edition library code. Our experience suggests that this approach yields useful information.
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
Lecture Notes in Computer Science 1205
(1999) · Industrial Robot: An International Journal · doi:10.1108/ir.1999.04926fae.001 · Cited by 38,662
Girard, J.-Y. (1987) · Theoretical Computer Science · doi:10.1016/0304-3975(87)90045-4 · Cited by 4,085
The program dependence graph and its use in optimization
Ferrante, J., Ottenstein, K. J., & Warren, J. D. (1987) · ACM Transactions on Programming Languages and Systems · doi:10.1145/24039.24041 · Cited by 2,755
Ammons, G., Bodík, R., & Larus, J. R. (2002) · Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/503272.503275 · Cited by 665
Typestate: A programming language concept for enhancing software reliability
Strom, R. E., & Yemini, S. (1986) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1986.6312929 · Cited by 626
Tracking down software bugs using automatic anomaly detection
Hangal, S., & Lam, M. S. (2002) · Proceedings/Proceedings - International Conference on Software Engineering · doi:10.1145/581339.581377 · Cited by 602
Self-citationAutomatically Validating Temporal Safety Properties of Interfaces
Ball, T., & Rajamani, S. K. (2001) · Cited by 599
Checking system rules using system-specific, programmer-written compiler extensions
Engler, D., Chelf, B., Chou, A., & Hallem, S. (2000) · doi:10.5555/1251229.1251230 · Cited by 535
A static analyzer for finding dynamic programming errors
Bush, W. R., Pincus, J. D., & Sielaff, D. (2000) · Software Practice and Experience · doi:10.1002/(sici)1097-024x(200006)30:7<775::aid-spe309>3.0.co;2-h · Cited by 512
Lucassen, J. M., & Gifford, D. K. (1988) · Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '88 · doi:10.1145/73560.73564 · Cited by 481
The specification of process synchronization by path expressions
Campbell, R. H., & Habermann, A. N. (2005) · Lecture Notes in Computer Science · doi:10.1007/bfb0029355 · Cited by 448
(1990) · Cited by 392
Dynamically discovering likely program invariants to support program evolution
Ernst, M. D., Cockrell, J., Griswold, W. G., & Notkin, D. S. (1999) · ACM/IEEE International Conference on Software Engineering: Companion Proceedings (ICSE-Companion) · doi:10.1145/302405.302467 · Cited by 357
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
Static verification of dynamically detected program invariants
Nimmer, J. W., & Ernst, M. D. (2001) · Electronic Notes in Theoretical Computer Science · doi:10.1016/s1571-0661(04)00256-7 · Cited by 91
Extending typestate checking using conditional liveness analysis
Strom, R., & Yellin, D. M. (1993) · IEEE Transactions on Software Engineering · doi:10.1109/32.232013 · Cited by 78
Typestate Checking of Machine Code
Xu, Z., Reps, T., & Miller, B. P. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45309-1_22 · Cited by 27
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
GenProg: A Generic Method for Automatic Software Repair
Le Goues, C., Nguyen, T., Forrest, S., & Weimer, W. (2012) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2011.104 · Cited by 1,085
The Daikon system for dynamic detection of likely invariants
Ernst, M. D., Perkins, J. H., Guo, P. J., McCamant, S., Pacheco, C., Tschantz, M. S., & Xiao, C. (2007) · Science of Computer Programming · doi:10.1016/j.scico.2007.01.015 · Cited by 1,080
Finding application errors and security flaws using PQL: a program query language
Martin, M., Livshits, B., & Lam, M. S. (2005) · Proceedings of the 20th annual ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications · doi:10.1145/1094811.1094840 · Cited by 440
Self-citationMAPO: Mining and Recommending API Usage Patterns
Zhong, H., Xie, T., Zhang, L., Pei, J., & Mei, H. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-03013-0_15 · Cited by 410
Metadata
- Authors
- Whaley, J., Martin, M. C., & Lam, M. S.
- Venue
- ACM SIGSOFT Software Engineering Notes
- Published
- 2002-07
- Volume
- 27
- Issue
- 4
- Pages
- 218-228
- ISSN
- 0163-5948 (ISSN-L)
- OpenAlex
- W2121059325
- Cited by
- 261
- References
- 17
- FWCI
- 39.89
- 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.