
doi: 10.1007/bf01776571
A data space is a mathematical model for virtual machines as they arise in programming. It consists of a set of objects (states), a set of descriptors, and a control. In this general framework, formal definitions of both fixed-depth and variable-depth indirect addressing are developed. The former definition serves as a model for simple hardware spaces, whereas the latter has applications in the realm of higher-level programming.
Virtual Machines, Data Spaces, General topics in the theory of software, Indirect Addressing, Abstract data types; algebraic specification
Virtual Machines, Data Spaces, General topics in the theory of software, Indirect Addressing, Abstract data types; algebraic specification
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
