We present a method for constructing concrete executions or witnesses to abstract behaviour specifications. The key concept is the use of an ordering on states which preserves containment of behaviours 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 superscalar pipeline.
['Robert W. Sumners', 'Jayanta Bhadra', 'Jacob A. Abraham']
Improving witness search using orders on states