Distributed BMC: A Depth-First Approach to Explore Clause Symmetry
2009 16th Annual IEEE International Conference and Workshop on the Engineering of Computer Based Systems, 2009
In recent years new and efficient symbolic model checking algorithms have been developed. One tec... more In recent years new and efficient symbolic model checking algorithms have been developed. One technique, bounded model checking or BMC, has been particularly promising. BMC models the system being verified as a boolean formula whose satisfying assignments provide counterexamples for properties verified. BMC unrolls the system in its multiple iterations. Because of this the structure of the formula representing the
Uploads
Papers by Luis Zarate