Examples of SAT problems from bounded model checking an Alpha design

These are examples of SAT problems arising in the formal verification of the design of a high-performance Alpha microprocessor at Compaq, during the first half of 2001. For a brief description of bounded model checking, see the SATLIB page of BMC examples from IBM, generously provided by Ofer Shtrichman.

In these examples, the component being verified handles off-chip communications (particularly the interactions between the cache-coherence protocol and second-level data cache). The structure has had a number of reductions applied, particularly symmetry and cone-of-influence. The design's initial states and free inputs have been constrained to take on only legal values. The properties being verified are small, fairly local invariants -- there are several hundred such properties to verify of this component, and together they still don't constitute a full verification.

The archive bmc-alpha-2001-06-26.tar.gz should expand into a directory called bmc-alpha, containing these files:

#File NameDescriptionkVariablesClauses
1bmc-alpha-25449.cnfcache coherence and control306634433065529
2bmc-alpha-4408.cnfcache coherence and control4011754033054591
3bmc-alpha-12225.cnfcache coherence and control6017545364565530
4bmc-alpha-17181.cnfcache coherence and control6519046284956141

The number of clauses and variables is affected by the very simple-minded translation of the problem from a network of logic gates, which produces only clauses of length two or three. A slightly more parsimonious translation is possible.

Tim Leonard
Formal Design Verification
Alpha Development Group
Compaq Computer Corporation