Abstract
This paper tackles, and solves, the (new) problem of modelling all of the Ada tasking semantics as abstractly, i.e. as implementation-unbiased as possible; and of embedding its parallel meta-process model in an otherwise denotational model of sequential Ada.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Editor information
Rights and permissions
Copyright information
© 1980 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Løvengreen, H.H. (1980). Parallelism in 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_4
Download citation
DOI: https://doi.org/10.1007/3-540-10283-3_4
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