Proceedings 1999 IEEE International Conference on Computer Design: VLSI in Computers and Processors (Cat. No.99CB37040)
Download PDF

Abstract

We present a method for constructing concrete executions or witnesses to abstract behavior specifications. The key concept is the use of an ordering on states which preserves containment of behaviors seen from the states. We present a modified depth-first search algorithm which uses the ordering to prune the requisite search paths and the memory needed for the history of the search. We apply the search to a model of a super-scalar pipeline.
Like what you’re reading?
Already a member?
Get this article FREE with a new membership!