The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Programming-in-the large versus programming-in-the-small
Abstract
We distinguish the activity of writing large programs from that of writing small ones. By large programs we mean systems consisting of many small programs (modules), possibly written by different people. We need languages for programming-in-the-small, i.e. languages not unlike the common programming languages of today, for writing modules. We also need a “module interconnection language” for knitting those modules together into an integrated whole and for providing an overview that formally records the intent of the programmer(s) and that can be checked for consistency by a compiler. We explore the software reliability aspects of such an interconnection language. Emphasis is placed on facilities for information hiding and for defining layers of virtual machines.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Semantics of context-free languages
Knuth, D. E. (1968) · Mathematical Systems Theory · doi:10.1007/bf01692511 · Cited by 1,948
Proof of correctness of data representations
Hoare, C. A. R. (1972) · Acta Informatica · doi:10.1007/bf00289507 · Cited by 966
The psychology of computer programming
(1999) · Choice Reviews Online · doi:10.5860/choice.36-4535 · Cited by 962
Notes on Structured Programming
Dijkstra, E. W. (1970) · TU/e Research Portal · doi:10.26153/tsw/53177 · Cited by 824
Programming with abstract data types
Liskov, B., & Zilles, S. (1974) · Proceedings of the ACM SIGPLAN symposium on Very high level languages - · doi:10.1145/800233.807045 · Cited by 734
A technique for software module specification with examples
Parnas, D. L. (1972) · Communications of the ACM · doi:10.1145/355602.361309 · Cited by 726
Information distribution aspects of design methodology
Parnas, D. L. (2018) · KiltHub Repository · doi:10.1184/r1/6606470 · Cited by 312
A contribution to the development of ALGOL
Wirth, N., & Hoare, C. A. R. (1966) · Communications of the ACM · doi:10.1145/365696.365702 · Cited by 222
Presser, L., & White, J. R. (1972) · ACM Computing Surveys · doi:10.1145/356603.356605 · Cited by 205
A design methodology for reliable software systems
Liskov, B. H. (1972) · Proceedings of the December 5-7, 1972, fall joint computer conference, part I on - AFIPS '72 (Fall, part I) · doi:10.1145/1479992.1480018 · Cited by 107
Cited by
Krueger, C. W. (1992) · ACM Computing Surveys · doi:10.1145/130844.130856 · Cited by 1,431
Abstractions for software architecture and tools to support them
Shaw, M., DeLine, R., Klein, D. V., Ross, T. L., Young, D. M., & Zelesnik, G. (1995) · IEEE Transactions on Software Engineering · doi:10.1109/32.385970 · Cited by 813
The evolving philosophers problem: dynamic change management
Kramer, J., & Magee, J. (1990) · IEEE Transactions on Software Engineering · doi:10.1109/32.60317 · Cited by 798
Using automatic clustering to produce high-level system organizations of source code
Mancoridis, S., Mitchell, B. S., Rorres, C., Chen, Y., & Gansner, E. R. (2002) · Proceedings. 6th International Workshop on Program Comprehension. IWPC'98 (Cat. No.98TB100242) · doi:10.1109/wpc.1998.693283 · Cited by 484
Towards a taxonomy of software connectors
Mehta, N. R., Medvidovic, N., & Phadke, S. (2000) · Proceedings of the 22nd international conference on Software engineering - ICSE '00 · doi:10.1145/337180.337201 · Cited by 397
Metadata
- Authors
- DeRemer, F., & Kron, H.
- Venue
- ACM SIGPLAN Notices
- Published
- 1975-04
- Volume
- 10
- Issue
- 6
- Pages
- 114-121
- ISSN
- 0362-1340 (ISSN-L)
- 1558-1160
- OpenAlex
- W2118252041
- Cited by
- 574
- References
- 11
- FWCI
- 7.37
- 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: Programming-in-the large versus programming-in-the-small. https://app.cochat.ai/papers/10.1145/390016.808431
- The paper
- DeRemer, F., & Kron, H. (1975). Programming-in-the large versus programming-in-the-small. ACM SIGPLAN Notices. https://doi.org/10.1145/390016.808431
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.