Parallelism in Ada

  • Hans Henrik Løvengreen
Part II: A Formal Definition Of Ada
Part of the Lecture Notes in Computer Science book series (LNCS, volume 98)


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.


Task Process Task Type Process Instance Static Semantic Interpretation Function 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1980

Authors and Affiliations

  • Hans Henrik Løvengreen

There are no affiliations available

Personalised recommendations