It is argued that formal verifications of programs, no matter how obtained, will not play the same key role in the development of computer science and software engineering as proofs do in mathematics. Furthermore the absence
…
Richard A. De Millo, Richard J. Lipton, Alan J. Perlis
Pages 271-280
This note presents an improvement to LeLann's algorithm for finding the largest (or smallest) of a set of uniquely numbered processes arranged in a circle, in which no central controller exists and the number of processes is
n …
Ernest Chang, Rosemary Roberts
Pages 281-283
The prevalence with which errors may be encountered by the
end targets of a computerized process is assessed. How many and what type of errors occur? How easily are they corrected? What is the reaction of consumers to errors—to …
T. D. Sterling
Pages 283-289
A variety of concepts, laws, and notations are presented which facilitate reasoning about arrays. The basic concepts include intervals and their partitions, functional restriction, images, pointwise extension of relations, ordering …
John C. Reynolds
Pages 290-299
A multi-interpreter system is a system in which programs execute by virtue of being interpreted by other programs, which themselves may either be interpreted (i.e. nested interpreters) or run directly on the host machine. The …
Michael J. Manthey
Pages 299-309
The article [1] by Matthew Geller presents a proposed method for establishing the correctness of a class of programs. Geller's abstract reads in part, “This paper introduces a technique whereby test data can be used in proving …
Pages 324-325
