Abstract
This paper outlines the specific development methods used in a large scale, full Ada compiler & run-time system development project. The most significant feature of this project is its insistence on using formal, mathematics based definition-, specification- and implementation techniques. The basis for the compiler is twofold: First a formal, denotational & abstract semantics specification of Ada, including tasking; then an abstract compiling algorithm derived from the dynamic semantics (denotational) specification from Ada into (so-called) A-code.
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
Bjørner, D., Oest, O.N. (1980). The DDC Ada compiler development method. 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_1
Download citation
DOI: https://doi.org/10.1007/3-540-10283-3_1
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