The DOI matches its Crossref record.
Support for comprehensive reuse
Abstract
Reuse of products, processes and other knowledge will be the key to enable the software industry to achieve the dramatic improvement in productivity and quality required to satisfy anticipated growing demands. Although experience shows that certain kinds of reuse can be successful, general success has been elusive. A software life-cycle technology that allows comprehensive reuse of all kinds of software-related experience could provide the means of achieving the desired order-of-magnitude improvements. In this paper, we introduce a comprehensive framework of models, model-based characterisation schemes, and support mechanisms for better understanding, evaluating, planning and supporting all aspects of reuse.
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
Cited by
Curtis, B., Kellner, M. I., & Over, J. (1992) · Communications of the ACM · doi:10.1145/130994.130998 · Cited by 1,616
Model-driven Development of Complex Software: A Research Roadmap
France, R., & Rumpe, B. (2007) · Future of Software Engineering (FOSE '07) · doi:10.1109/fose.2007.14 · Cited by 1,123
Knowledge management in software engineering
Rus, I., & Lindvall, M. (2002) · IEEE Software · doi:10.1109/ms.2002.1003450 · Cited by 742
Software Product Lines in Action
van der Linden, F., Schmid, K., & Rommes, E. (2007) · Springer eBooks · doi:10.1007/978-3-540-71437-8 · Cited by 485
How reuse influences productivity in object-oriented systems
Basili, V. R., Briand, L. C., & Melo, W. L. (1996) · Communications of the ACM · doi:10.1145/236156.236184 · Cited by 271
Self-citation
Metadata
- Authors
- Basili, V. R., & Rombach, H. D.
- Venue
- Software Engineering Journal
- Published
- 1991
- Volume
- 6
- Issue
- 5
- Pages
- 303
- ISSN
- 0268-6961 (ISSN-L)
- OpenAlex
- W2072859596
- Cited by
- 216
- References
- 0
- FWCI
- 7.53
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Support for comprehensive reuse. https://app.cochat.ai/papers/10.1049/sej.1991.0032
- The paper
- Basili, V. R., & Rombach, H. D. (1991). Support for comprehensive reuse. Software Engineering Journal. https://doi.org/10.1049/sej.1991.0032
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.