An overview of the MATHILDA system

Kornerup, Peter; Shriver, Bruce D.

doi:10.1145/1217166.1217168

Cited by 9 publications

(3 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Part of the goal of our work is to determine what particualr operating systems primitives are viable candidates to migrate into the firmware and also dynamically microprogramm~ble machines [22,23] using the MARl~microassembler [24]. The RIKKE-MATHILDA system provides a distributed network of microprogrammable machines (2 machines and 2 memories) which is shown in Figure 5.…”

Section: Design and Implementation Methodologymentioning

confidence: 99%

An implementation scheme for a virtual machine monitor to be realized on user - microprogrammable minicomputers

Shriver

Anderson

Waguespack³

et al. 1976

Proceedings of the Annual Conference on - ACM 76

View full text Add to dashboard Cite

A virtual machine monitor allows several different operating systems to run concurrently on the same machine.This paper presents the description of a virtual machine monitor and its support structure which can be implemented on a microprogrammable minicomputer or a distributed network of such machines.In our approach, all storage, transformational, input, and output resources of the system are accessed through a mapping mechanism.The design and implementation mehhodolgy for an actual realization of the vlttual machine monitor is discussed.

show abstract

Section: Design and Implementation Methodologymentioning

confidence: 99%

An implementation scheme for a virtual machine monitor to be realized on user - microprogrammable minicomputers

Shriver

Anderson

Waguespack³

et al. 1976

Proceedings of the Annual Conference on - ACM 76

View full text Add to dashboard Cite

show abstract

“…Since residual control is present in several other machines [13,14,20], our solution to this problem is expected to be useful in a wider context than for the QM-i alone. 3.…”

Section: Foundationsmentioning

confidence: 99%

“…The states of these special residual control registers can, of course, be altered under micro(nano)program control. In the QM-i, the control function rests partly in the nanoword (providing what Kornerup and Shriver [13] termed "immediate" control) and partly in a set of residual control registers called F registers.…”

Section: A Synopsis Of the Qm-i Architecturementioning

confidence: 99%

Axiomatic proof rules for a machine-specific microprogramming language

Wagner

Dasgupta

1983

SIGMICRO Newsl.

View full text Add to dashboard Cite

In recent years, much effort has been devoted to the design and implementation of high level microprogramming languages. One of the goals for such languages is to facilitate the formal verification of microprograms using Hoare's inductive assertion method. Essential to the use of this method is an axiomatic definition of the microprogramming language.In this paper, we describe the axiomatization of the machine dependent microprogramming language S*(QM-1) [12]. This language is an instantiation of the machine independent language schema S* [3,4], for the Nanodata QM-1 "nanolevel" architecture. We show that, in spite of the complexity of the QM-1, with its variety of side-effects and special conditions, a small and uniform set of proof rules can be constructed.

show abstract