Advertisement

The design of a virtual machine for Ada

  • Ole Dommergaard
Part III: An Ada Computer
Part of the Lecture Notes in Computer Science book series (LNCS, volume 98)

Abstract

This document formally defines a virtual machine. The design of the instruction set and state components of the machine is based on a semantic analysis of the basic concepts of Ada. The result is a high-level machine especially suited to run Ada programs.

Keywords

Virtual Machine Activation Record Loop Statement Dynamic Semantic Vienna Development Method 
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.

Notation

E

The membership operator

∀,A

The universal quantifier

E

The existential quantifier

S

The State Domain

\(\mathop { \cdot \cdot \_ > \cdot \cdot }\limits_m \)

Denotes a mapping from .. to ..

.. _> ..

Denotes a function from .. to ..

X.Y

Denotes a derived reference in X.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1980

Authors and Affiliations

  • Ole Dommergaard

There are no affiliations available

Personalised recommendations