In recent years, the technique of symbolic model checking has proven itself to
be extremely useful in the verification of hardware. However, after almost a decade, the
use of model-checking techniques is still considered complicated, and is usually left for
the experts. In this paper we address the question of how model-checking techniques can
be made more accessible to the hardware designer community. We introduce the concept
of exploration through model-checking, and demonstrate how, when differently tuned, the
known techniques can be used to easily obtain interesting traces out of the model, rather than
used for the discovery of hard-to-find bugs. We present a set of algorithms, which support
the exploration flavor of model checking.
By: Shoham Ben-David/Haifa/IBM, Anna Gringauze/Haifa/IBM, Sharon Keidar/Haifa/IBM, Baruch Sterin/Haifa/IBM, Yaron Wolfsthal/Haifa/IBM
Published in: TR88.390 in 2001
LIMITED DISTRIBUTION NOTICE:
This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.
Questions about this service can be mailed to reports@us.ibm.com .