The design of a virtual machine for Ada

Authors:
L. J. Groves;W. J. Rogers
Affiliations:
University of Waikato, Hamilton, New Zealand;University of Waikato, Hamilton, New Zealand
Venue:
SIGPLAN '80 Proceedings of the ACM-SIGPLAN symposium on Ada programming language
Year:
1980

Citing 5
Cited 0

The Vienna Definition Language

ACM Computing Surveys (CSUR)
The architecture of concurrent programs

The architecture of concurrent programs
Concurrent Pascal Compiler for Minicomputers

Concurrent Pascal Compiler for Minicomputers
Preliminary Ada reference manual

ACM SIGPLAN Notices - Preliminary Ada reference manual
Rationale for the design of the Ada programming language

ACM SIGPLAN Notices - Rationale for the deisgn of the Ada programming language

Quantified Score

Hi-index	0.00

Visualization

Abstract

An implementation of Ada should be based on a machine-independent translator generating code for a Virtual Machine, which can be realised on a variety of machines. This approach, which leads to a high degree of compiler portability, has been very successful in a number of recent language implementation projects and is the approach which has been specified by the U. S. Army and Air Force in their requirements for Ada implementations.This paper discusses the rationale, requirements and design of such a Virtual Machine for Ada. The discussion concentrates on a number of fundamental areas in which problems arise: basic Virtual Machine structure, including storage structure and addressing; data storage and manipulation; flow of control; subprograms, blocks and exceptions; and task handling.