Herbert R. J. Grosch
Pages 349-350
An algorithm is presented for copying an arbitrarily linked list structure into a block of contiguous storage locations without destroying the original list. Apart from a fixed number of program variables, no auxillary storage …
Douglas W. Clark
Pages 351-357
Controlled sharing of information is needed and desirable for many applications and is supported in operating systems by access control mechanisms. This paper shows how to extend programming languages to provide controlled sharing …
Anita K. Jones, Barbara H. Liskov
Pages 358-367
Proofs of program correctness tend to be long and tedious, whereas testing, though useful in detecting errors, usually does not guarantee correctness. This paper introduces a technique whereby test data can be used in proving …
Matthew Geller
Pages 368-375
The use of several levels of abstraction has proved to be very helpful in constructing and maintaining programs. When programs are designed with abstract data types such as sets and lists, programmer time can be saved by automating …
James R. Low
Pages 376-385
The issues of how a programming language might aid in keeping track of physical units (feet, sec, etc.) are discussed. A method is given for the introduction of relationships among units (a watt is volts*amps, a yard is three …
Michael Karr, David B. Loveman
Pages 385-391
This paper describes an integrated procedure mechanism that permits procedures to be used as recursive functions or as coroutines. This integration is accomplished by treating procedures and their activation records (called environments) …
David R. Hanson, Ralph E. Griswold
Pages 392-400
A method for inducing knowledge by abstraction from a sequence of training examples is described. The proposed method, interference matching, induces abstractions by finding relational properties common to two or more exemplars …
Frederick Hayes-Roth, John McDermott
Pages 401-411
The purpose of this report is to present a new class of sufficient optimality conditions for pure and mixed integer programming problems. Some of the sets of sufficient conditions presented can be thought of as generalizations …
J. M. Fleisher, R. R. Meyer
Pages 411-418
A new method for generating random variables from the gamma distribution with nonintegral shape parameter &agr; is proposed. This method is similar to two other methods recently given by Wallace and Fishman. It is compared with Fishman's …
Pandu R. Tadikamalla
Pages 419-422
For the purposes of this paper, a block-transfer CCD memory is composed of serial shift registers whose shift rate can vary, but which have a definite minimum shift rate (the refresh rate) and a definite maximum shift rate. The …
Richard L. Sites
Pages 423-425
Robert L. Ashenhurst
Pages 433-434
