Formally based static analysis of microcode

Authors:
J. M. Foster
Affiliations:
Royal Signals and Radar Establishment, Malvern, U.K.
Venue:
MICRO 19 Proceedings of the 19th annual workshop on Microprogramming
Year:
1986

Citing 7
Cited 0

Two Complete Axiom Systems for the Algebra of Regular Events

Journal of the ACM (JACM)
A Unified Approach to Path Problems

Journal of the ACM (JACM)
Data Flow Analysis in Software Reliability

ACM Computing Surveys (CSUR)
A program data flow analysis procedure

Communications of the ACM
Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints

POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
The Theory and Practice of Transforming Call-by-need into Call-by-value

Proceedings of the Fourth 'Colloque International sur la Programmation' on International Symposium on Programming
Principles of Compiler Design (Addison-Wesley series in computer science and information processing)

Principles of Compiler Design (Addison-Wesley series in computer science and information processing)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Algebraic methods have been widely used to find properties of programs, especially for use in compiler optimisation. This paper describes the use of this kind of method to prove the absence of particular errors in microcode, or to detect and locate such errors. In order to show the kind of error which may be found we consider a number of examples. All of these have found errors in practical microcode, written for the PERQ computer.