Abstract
This paper gives a formal denotational dynamic semantics definition of the sequential parts of Ada. It describes the ‘meaning’ of (abstract) Ada constructs by state-to-state transformations on an abstract machine.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
Editor information
Rights and permissions
Copyright information
© 1980 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Pedersen, J.S. (1980). A formal semantics definition of sequential 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_3
Download citation
DOI: https://doi.org/10.1007/3-540-10283-3_3
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
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.