Daniel D. McCracken
Pages 713-714
In this note, an algorithm is presented for the symbolic calculation of certain algebraic invariants of the Weyl tensor which permits the determination of the Bel-Petrov types of a gravitational field. This algorithm, although …
R. A. Harris, J. D. Zund
Pages 715-717
This paper describes the structure and operation of a hybrid simulation model in which both discrete-event simulation and analytic techniques are combined to produce efficient yet accurate system models. In an example based on …
H. D. Schwetman
Pages 718-723
A new interprocedural data flow analysis algorithm is presented and analyzed. The algorithm associates with each procedure in a program information about which variables may be modified, which may be used, and which are possibly …
Jeffrey M. Barth
Pages 724-736
Program verification applied to kernel architectures forms a promising method for providing uncircumventably secure, shared computer systems. A precise definition of data security is developed here in terms of a general model …
Gerald J. Popek, David A. Farber
Pages 737-749
The working-set concept is extended for programs that reference segments of different sizes. The generalized working-set policy (GWS) keeps as its resident set those segments whose retention costs do not exceed their retrieval …
Peter J. Denning, Donald R. Slutz
Pages 750-759
This paper describes an experiment in program testing, employing 59 highly experienced data processing professionals using seven methods to test a small PL/I program. The results show that the popular code walkthrough/inspection …
Glenford J. Myers
Pages 760-768
Insertion and deletion algorithms are provided for the class of right (or one-sided) brother trees which have O (log n) performance. The importance of these results stems from the close relationship of right brother trees to
2 …
Th. Ottmann, H. W. Six, D. Wood
Pages 769-776
The event-manipulation system presented here consists of two major parts. The first part addresses the familiar problem of event scheduling efficiency when the number of scheduled events grows large. The second part deals with …
Ernst G. Ulrich
Pages 777-785
In [4] Maruyama and Smith analyzed design alternatives for virtual memory indexes. The indexes investigated were those modeled on the structure of VSAM [5] which are closely related to B-trees [1]. Maruyama and Smith presented …
Kurt Maly
Pages 786-787
Stephen A. Ward
Pages 788-790
In [3], R.L. Rivest presents a set of methods for dynamically reordering a sequential list containing
N records in order to increase search efficiency. The method
Ai (for
i between 1 and
N) performs the following operation each …
Aaron Tenenbaum
Pages 790-791
Robert L. Ashenhurst
Pages 796-797
