Social processes and proofs of theorems and programs
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…
May 1979 - Vol. 22 No. 5
Features
An improved algorithm for decentralized extrema-finding in circular configurations of processes
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…
Consumer difficulties with computerized transactions: an empirical investigation
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…
A variety of concepts, laws, and notations are presented which facilitate reasoning about arrays. The basic concepts include intervals and their partitions, functional…
A model for and discussion of multi-interpreter systems
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…
