Abstract
This document formally defines a virtual machine. The design of the instruction set and state components of the machine is based on a semantic analysis of the basic concepts of Ada. The result is a high-level machine especially suited to run Ada programs.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Abbreviations
- E:
-
The membership operator
- ∀,A :
-
The universal quantifier
- E:
-
The existential quantifier
- S:
-
The State Domain
- \(\mathop { \cdot \cdot \_ > \cdot \cdot }\limits_m \) :
-
Denotes a mapping from .. to ..
- .. _> ..:
-
Denotes a function from .. to ..
- X.Y:
-
Denotes a derived reference in X.
Editor information
Rights and permissions
Copyright information
© 1980 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Dommergaard, O. (1980). The design of a virtual machine for Ada. In: Bjørner, D., Nest, O.N. (eds) Towards a Formal Description of Ada. Lecture Notes in Computer Science, vol 98. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10283-3_5
Download citation
DOI: https://doi.org/10.1007/3-540-10283-3_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10283-0
Online ISBN: 978-3-540-38415-1
eBook Packages: Springer Book Archive