Verifying a Simple Pipelined Microprocessor Using Maude (2000)
| Venue: | Maude”, Lecture Notes in Computer Science |
| Citations: | 15 - 1 self |
BibTeX
@INPROCEEDINGS{Harman00verifyinga,
author = {N.A. Harman},
title = {Verifying a Simple Pipelined Microprocessor Using Maude},
booktitle = {Maude”, Lecture Notes in Computer Science},
year = {2000},
pages = {128--142},
publisher = {Springer-Verlag}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We consider the verification of a simple pipelined microprocessor in Maude, by implementing an equational theoretical model of systems. Maude is an equationally-based language, with an efficient term rewriting implementation, and effctive meta-level tools. Microprocessors and other systems are modelled as iterated maps operating in time over some state-set, and are related by means of data and abstraction maps, and correctness is reduced to state exploration by the choice of an appropriate initialisation function, ensuring/enforcing consistency of the initial state.
