Herb Grosch
Page 369
This paper describes previous research on flowcharts and a series of controlled experiments to test the utility of detailed flowcharts as an aid to program composition, comprehension, debugging, and modification. No statistically …
Ben Shneiderman, Richard Mayer, Don McKay, Peter Heller
Pages 373-381
Henry F. Ledgard, Robert W. Taylor
Pages 382-384
The system for business automation (SBA) is a system within which application experts—nonprogrammers—can describe and execute their applications on a computer. The user of SBA views his application as manipulation of information …
Moshé M. Zloof, S. Peter de Jong
Pages 385-396
Abstract data types can play a significant role in the development of software that is reliable, efficient, and flexible. This paper presents and discusses the application of an algebraic technique for the specification of abstract …
John Guttag
Pages 396-404
Aggregation is introduced as an abstraction which is important in conceptualizing the real world. Aggregation transforms a relationship between objects into a higher-level object. A new data type, called aggregate, is developed …
John Miles Smith, Diane C. P. Smith
Pages 405-413
A number of issues are explored concerning the notion that a data type is a set of values together with a set of primitive operations on those values. Among these are the need for a notation for iterating over the elements of …
David Gries, Narain Gehani
Pages 414-420
Two algorithms are presented for implementing any of a class of buddy systems for dynamic storage allocation. Each buddy system corresponds to a set of recurrence relations which relate the block sizes provided to each other. …
James L. Peterson, Theodore A. Norman
Pages 421-431
A new algorithm is presented which copies cyclic list structures using bounded workspace and linear time. Unlike a previous similar algorithm, this one makes no assumptions about the storage allocation system in use and uses
…
J. M. Robson
Pages 431-433
Various methods of recursion elimination are applied to the schematic recursive procedure:
proc
S(
x);
px then
N(
x);
S(ƒ
x);
S(
gx);
M(
x) fi. Procedures with this general form arise in connection with tree traversal and sorting
…
R. S. Bird
Pages 434-439
Henry S. Warren
Pages 439-441
Pages 445-452
Statistics are presented on the production and employment of Ph.D.'s in computer science for the calendar year 1975-76. Data include profiles of graduate students and of faculty at 60 Ph.D.-producing departments as well as a
…
Orrin E. Taulbee, S. D. Conte
Pages 370-372
