Correctness of Pipelined Machines

Correctness of Pipelined Machines (0)

by Panagiotis Manolios

Venue:	Formal Methods in Computer-Aided Design–FMCAD 2000, volume 1954 of LNCS
Citations:	26 - 13 self

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Correctness of Pipelined Machines	INFERENCE
AUTHOR NAME	Panagiotis Manolios	SVM HeaderParse 0.1
AUTHOR AFFIL	Department of Computer Sciences, University of Texas at Austin	SVM HeaderParse 0.2
ABSTRACT	The correctness of pipelined machines is a subject that has been studied extensively. Most of the recent work has used variants of the Burch and Dill notion of correctness [4]. As new features are modeled, e.g., interrupts, new notions of correctness are developed. Given the plethora of correctness conditions, the question arises: what is a reasonable notion of correctness? We discuss the issue at length and show, by mechanical proof, that variants of the Burch and Dill notion of correctness are awed. We propose a notion of correctness based on WEBs (Well-founded Equivalence Bisimulations) [16, 19]. Briey, our notion of correctness implies that the ISA (Instruction Set Architecture) and MA (Micro-Architecture) machines have the same observable in nite paths, up to stuttering. This implies that the two machines satisfy the same CTL* X properties and the same safety and liveness properties (up to stuttering). To test the utility of the idea, we use ACL2 to verify s...	user correction - Legacy Corrections
YEAR	0	user correction - Legacy Corrections
VENUE	Formal Methods in Computer-Aided Design–FMCAD 2000, volume 1954 of LNCS	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	161--178	INFERENCE
CITATIONS	27 found	ParsCit 1.0