Modularity and the sequential file update problem

Authors:
Michael R. Levy
Affiliations:
Univ. of Victoria, Victoria, B. C., Canada
Venue:
Communications of the ACM
Year:
1982

Citing 5
Cited 4

One more time — how to update a master file

Communications of the ACM
Abstract data types and the development of data structures

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

Communications of the ACM
A Discipline of Programming

A Discipline of Programming
Abstraction mechanisms in CLU

Proceedings of an ACM conference on Language design for reliable software

All programs are not created equal—but, do students know that?

SIGCSE '85 Proceedings of the sixteenth SIGCSE technical symposium on Computer science education
Organization of programming languages for business information systems majors

SIGCSE '83 Proceedings of the fourteenth SIGCSE technical symposium on Computer science education
Knowledge-based fault localization in debugging (Preliminary Draft)

SIGSOFT '83 Proceedings of the ACM SIGSOFT/SIGPLAN software engineering symposium on High-level debugging
Knowledge-based fault localization in debugging

Journal of Systems and Software

Quantified Score

Hi-index	48.22

Visualization

Abstract

The best-known solution to the sequential file update problem is the balanced-line algorithm. Here, the problem is solved using abstract data types and the resulting Cobol program illustrated. It is suggested that the program's modular decomposition aids in the development of the solution.