The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
Specification techniques for data abstractions
Open accessAbstract
The main purposes in writing this paper are to discuss the importance of formal specifications and to survey a number of promising specification techniques. The role of formal specifications both in proofs of program correctness, and in programming methodologies leading to programs which are correct by construction, is explained. Some criteria are established for evaluating the practical potential of specification techniques. The importance of providing specifications at the right level of abstraction is discussed, and a particularly interesting class of specification techniques, those used to construct specifications of data abstractions, is identified. A number of specification techniques for describing data abstractions are surveyed and evaluated with respect to the criteria. Finally, directions for future research are indicated.
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
On the criteria to be used in decomposing systems into modules
Parnas, D. L. (1972) · Communications of the ACM · doi:10.1145/361598.361623 · Cited by 4,704
An axiomatic basis for computer programming
Hoare, C. A. R. (1969) · Communications of the ACM · doi:10.1145/363235.363259 · Cited by 4,002
The structure of the “THE”-multiprogramming system
Dijkstra, E. W. (1968) · Communications of the ACM · doi:10.1145/363095.363143 · Cited by 1,094
Proof of correctness of data representations
Hoare, C. A. R. (1972) · Acta Informatica · doi:10.1007/bf00289507 · Cited by 966
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
Self-citationA technique for software module specification with examples
Parnas, D. L. (1972) · Communications of the ACM · doi:10.1145/355602.361309 · Cited by 726
The programming language pascal
Wirth, N. (1971) · Acta Informatica · doi:10.1007/bf00264291 · Cited by 716
Chief programmer team management of production programming
Baker, F. T. (1972) · IBM Systems Journal · doi:10.1147/sj.111.0056 · Cited by 325
Information distribution aspects of design methodology
Parnas, D. L. (2018) · KiltHub Repository · doi:10.1184/r1/6606470 · Cited by 312
Software and Its Impact: A Quantitative Assessment
BOEHM, B. W. (1972) · Cited by 266
Hoare, C. A. R. (1971) · Communications of the ACM · doi:10.1145/362452.362489 · Cited by 180
Hoare, C. A. R. (1978) · Springer eBooks · doi:10.1007/978-1-4612-6315-9_10 · Cited by 156
Inductive methods for proving properties of programs
Manna, Z., Ness, S., & Vuillemin, J. E. (1973) · Communications of the ACM · doi:10.1145/355609.362336 · Cited by 137
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
Self-citationToward an understanding of data structures
Earley, J. (1971) · Communications of the ACM · doi:10.1145/362759.362764 · Cited by 104
The design of the Venus operating system
Liskov, B. H. (1972) · Communications of the ACM · doi:10.1145/361268.361272 · Cited by 98
Self-citationAn Example of the Manipulation of Directed Graphs in the AMBIT/G Programming Language
Christensen, C. (1967) · Elsevier eBooks · doi:10.1145/2402536.2402584 · Cited by 81
Relational level data structures for programming languages
Earley, J. (1973) · Acta Informatica · doi:10.1007/bf00289502 · Cited by 39
Toward a Methodology for Designing Large Systems and Verifying Their Properties
Neumann, P. G. (1975) · Lecture notes in computer science · doi:10.1007/3-540-07141-5_209 · Cited by 4
Cited by
Practical Byzantine fault tolerance
Castro, M., & Liskov, B. H. (1999) · Operating Systems Design and Implementation · doi:10.5555/296806.296824 · Cited by 3,205
Self-citationPractical byzantine fault tolerance and proactive recovery
Castro, M., & Liskov, B. (2002) · ACM Transactions on Computer Systems · doi:10.1145/571637.571640 · Cited by 2,475
Self-citationA Methodology for Collecting Valid Software Engineering Data
Basili, V. R., & Weiss, D. M. (1984) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1984.5010301 · Cited by 1,149
Four dark corners of requirements engineering
Zave, P., & Jackson, M. (1997) · ACM Transactions on Software Engineering and Methodology · doi:10.1145/237432.237434 · Cited by 734
Weiser, M. (1981) · doi:10.5555/800078.802557 · Cited by 695
Metadata
- Authors
- Liskov, B., & Zilles, S.
- Venue
- ACM SIGPLAN Notices
- Published
- 1975-04
- Volume
- 10
- Issue
- 6
- Pages
- 72-87
- ISSN
- 0362-1340 (ISSN-L)
- 1558-1160
- OpenAlex
- W2138340202
- Cited by
- 364
- References
- 20
- FWCI
- 33.18
- Type
- journal article
- Language
- en
- Open access
- bronze
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.