Specification of Abstract Data Types in Modula

Authors:
George W. Ernst;William F. Ogden
Affiliations:
Computer Engineering and Science Department, Case Western Reserve University, Cleveland, OH;Department of Computer and Information Sciences, Ohio State University, Columbus, OH
Venue:
ACM Transactions on Programming Languages and Systems (TOPLAS)
Year:
1980

Citing 9
Cited 4

Pascal user manual and report; 3rd ed.

Pascal user manual and report; 3rd ed.
Abstraction mechanisms in CLU

Communications of the ACM
On the criteria to be used in decomposing systems into modules

Communications of the ACM
An axiomatic basis for computer programming

Communications of the ACM
Unrestricted procedure calls in Hoare's logic

POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
A program verification system

ACM '76 Proceedings of the 1976 annual conference
Verification of abstract types whose representations share storage

Verification of abstract types whose representations share storage
Euclid and Modula

ACM SIGPLAN Notices
Report on the programming language Euclid

ACM SIGPLAN Notices

Modular Verification of Data Abstractions with Shared Realizations

IEEE Transactions on Software Engineering
Use of data abstraction in process specification

ACM SIGSOFT Software Engineering Notes
Verifying Ada programs

ACM SIGSOFT Software Engineering Notes - Proceedings of VERkshop III -- a formal verification workshop
Traditional assignment considered harmful

Proceedings of the 24th ACM SIGPLAN conference companion on Object oriented programming systems languages and applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

The programming language MODULA is extended to permit the formal specification of the structure and functional capabilities of modules. This makes true hierarchical programming possible in MODULA by allowing programmers of higher level parts of a system to ignore completely the internal structure of lower level modules and to rely entirely on the specifications of the capabilities of these modules. An example is included to illustrate this technique. We show that our specification mechanisms are sufficiently powerful to support formal verification rules for modules that have disjoint representations for abstract objects.