Parallelism in Ada
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.
KeywordsTask Process Task Type Process Instance Static Semantic Interpretation Function
Unable to display preview. Download preview PDF.