Algebraic Models of Superscalar Microprocessor Implementations: a Case Study

Fox, Anthony; Harman, Neal A.

doi:10.1007/3-540-49254-2_5

Cited by 9 publications

(12 citation statements)

References 32 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, the process of manually defining cases is timeconsuming, and potentially error-prone. The example here, with 53 cases, is about the largest that can be sensibly attempted in this way: the superscalar example from [10,7] will require about 2000 cases.…”

Section: Exec(mentioning

confidence: 99%

“…In [9,11], correctness models and the formal verification process are examined. In [8,10] models of superscalar processors are examined by means of a substantial example. An extended account of some of this work can be found in [7].…”

Section: F(t + 1 A) = F(f(t A))mentioning

confidence: 99%

“…However, this is not necessary. SPM was first used in the form described here in [10,7]: a previous version appeared in [8]. In addition to the pipelined implementation ACP (Sect.…”

Section: Introduction To Maudementioning

confidence: 99%

“…5), which has been verified manually [7] and using Maude (Sect. 6), a superscalar version ACS exists [10,7]. A variant of ACS is currently being verified in Maude 3 .…”

Section: Introduction To Maudementioning

confidence: 99%

See 3 more Smart Citations

Verifying a Simple Pipelined Microprocessor Using Maude

Harman

2002

Recent Trends in Algebraic Development Techniques

Self Cite

View full text Add to dashboard Cite

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 effective 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.

show abstract

Section: Exec(mentioning

confidence: 99%

Section: F(t + 1 A) = F(f(t A))mentioning

confidence: 99%

“…However, this is not necessary. SPM was first used in the form described here in [10,7]: a previous version appeared in [8]. In addition to the pipelined implementation ACP (Sect.…”

Section: Introduction To Maudementioning

confidence: 99%

“…5), which has been verified manually [7] and using Maude (Sect. 6), a superscalar version ACS exists [10,7]. A variant of ACS is currently being verified in Maude 3 .…”

Section: Introduction To Maudementioning

confidence: 99%

See 2 more Smart Citations

Verifying a Simple Pipelined Microprocessor Using Maude

Harman

2002

Recent Trends in Algebraic Development Techniques

Self Cite

View full text Add to dashboard Cite

show abstract

“…Speci cally, in this paper, we take the methods of algebraically modelling microprocessors described in Harman and Tucker 1996and Fox and Harman 1998 , and i axiomatise the modelling process to yield an algebraic speci cation framework in Section 2 for de ning the semantics of machines; ii apply these techniques to the algebraic speci cation of the architecture Section 3 and semantics Sections 4 of an abstract and simpli ed version of the JVM; and iii explain how we can concretise our abstract JVM model to provide a speci cation of the JVM in Section 5. We axiomatise the semantics of the JVM by describing how the system evolves over time.…”

Section: Introductionmentioning

confidence: 99%

Towards an Algebraic Specification of the Java Virtual Machine

Stephenson

1998

Prospects for Hardware Foundations

View full text Add to dashboard Cite

Abstract. We develop an algebraic speci cation of the architecture of an abstract and simpli ed version of the Java Virtual Machine JVM. This concentration on the implementation-independent features of the machine allows us to build a clean and easily comprehensible model in which its structure is emphasised. We then axiomatise the semantics of programs operating on this architecture. We also consider how we can concretise this abstract model which provides us with a rm foundation for exploring the entire JVM and thus of analysing the correctness of Java implementations.

show abstract

A Framework for Microprocessor Correctness Statements

Aagaard

Cook²,

Day³

et al. 2001

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Most verifications of out-of-order microprocessors compare state-machine-based implementations and specifications, where the specification is based on the instruction-set architecture. The different efforts use a variety of correctness statements, implementations, and verification approaches. We present a framework for classifying correctness statements about safety that is independent of implementation representation and verification approach. We characterize the relationships between the different statements and illustrate how existing and classical approaches fit within this framework.

show abstract

Algebraic Models of Superscalar Microprocessor Implementations: a Case Study

Cited by 9 publications

References 32 publications

Verifying a Simple Pipelined Microprocessor Using Maude

Verifying a Simple Pipelined Microprocessor Using Maude

Towards an Algebraic Specification of the Java Virtual Machine

A Framework for Microprocessor Correctness Statements

Contact Info

Product

Resources

About