Problem-oriented specification of concurrent algorithms
The main purpose of the present paper is to suggest an executable algorithmic notation for VLSI solutions which, in many cases, may be more natural than traditional programming notation.
Engineering topics
Publications and source records attributed to Cremers, A. B..
The main purpose of the present paper is to suggest an executable algorithmic notation for VLSI solutions which, in many cases, may be more natural than traditional programming notation.
Systematic software design can be based on the development of a 'hierarchy of virtual machines', each representing a 'level of abstraction' of the design process. The reported investigation presents the concept of 'data space' as a formal model for virtual machines. The presented model of a data space combines the notions of data type and mathematical machine to express the close interaction between data and control structures which takes place in a virtual machine. One of the main objectives of the investigation is to show that control-independent data type implementation is only of limited usefulness as an isolated tool of program development, and that the representation of data is generally dictated by the control context of a virtual machine. As a second objective, a better understanding is to be developed of virtual machine state structures than was heretofore provided by the view of the state space as a Cartesian product.