Power-Laws in a Large Object-Oriented Software System
The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Abstract
We present a comprehensive study of an implementation of the Smalltalk object oriented system, one of the first and purest object-oriented programming environment, searching for scaling laws in its properties. We study ten system properties, including the distributions of variable and method names, inheritance hierarchies, class and method sizes, system architecture graph. We systematically found Pareto - or sometimes log-normal - distributions in these properties. This denotes that the programming activity, even when modeled from a statistical perspective, can in no way be simply modeled as a random addition of independent increments with finite variance, but exhibits strong organic dependencies on what has been already developed. We compare our results with similar ones obtained for large Java systems, reported in the literature or computed by ourselves for those properties never studied before, showing that the behavior found is similar in all studied object oriented systems. We show how the Yule process is able to stochastically model the generation of several of the power-laws found, identifying the process parameters and comparing theoretical and empirical tail indexes. Lastly, we discuss how the distributions found are related to existing object-oriented metrics, like Chidamber and Kemerer's, and how they could provide a starting point for measuring the quality of a whole system, versus that of single classes. In fact, the usual evaluation of systems based on mean and standard deviation of metrics can be misleading. It is more interesting to measure differences in the shape and coefficients of the data?s statistical distributions.
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
Newman (2005) · doi:10.1080/00107510500052444 · Cited by 5,749
Zipf Distribution of U.S. Firm Sizes
Axtell, R. L. (2001) · Science · doi:10.1126/science.1062081 · Cited by 1,839
Cited by
Zipf’s word frequency law in natural language: A critical review and future directions
Piantadosi, S. T. (2014) · Psychonomic Bulletin & Review · doi:10.3758/s13423-014-0585-6 · Cited by 889
The science of science: From the perspective of complex systems
Zeng, A., Shen, Z., Zhou, J., Wu, J., Fan, Y., Wang, Y., & Stanley, H. E. (2017) · Physics Reports · doi:10.1016/j.physrep.2017.10.001 · Cited by 410
The evolutionary ecology of technological innovations
Solée, R. V., Valverde, S., Casals, M. R., Kauffman, S. A., Farmer, D., & Eldredge, N. (2013) · Complexity · doi:10.1002/cplx.21436 · Cited by 140
“ever-increasing frequency of copy-paste [67-70].”
Evolving complexity: how tinkering shapes cells, software and ecological networks.
Solé, R., & Valverde, S. (2020) · Philosophical Transactions of the Royal Society B: Biological Sciences · doi:10.1098/rstb.2019.0325 · Cited by 37
Studying the difference between natural and programming language corpora
Casalnuovo, C., Sagae, K., & Devanbu, P. (2019) · Empirical Software Engineering · doi:10.1007/s10664-018-9669-7 · Cited by 33
“Power laws and other related distributions (exponential, lognormal, etc) have been examined in regards to many source code features of interest: class methods and fields, dependency and function call graphs, etc (Louridas et al, 2008; Concas et al, 2007; Baxter et al, 2006).”
Background
Metadata
- Authors
- Concas, G., Marchesi, M., Pinna, S., & Serra, N.
- Venue
- IEEE Transactions on Software Engineering
- Published
- 2007-10
- Volume
- 33
- Issue
- 10
- Pages
- 687-708
- ISSN
- 0098-5589 (ISSN-L)
- OpenAlex
- W1970656444
- Cited by
- 228
- References
- 2
- FWCI
- 39.93
- 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.