Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
10329789 | Electronic Notes in Theoretical Computer Science | 2005 | 17 Pages |
Abstract
We experimentally test our methodology within an industrial environment, the Intel BOolean VErifierBOVE. Preliminary results on standard benchmarks (the ISCAS'89, ISCAS'89-addendum, and VIS suites), and industrial ones (the IBM Formal Verification Benchmark Library) are provided. Results show interesting improvements over state-of-the-art techniques: We could decrease CPU time up to a 5x factor, when performing verification with the same depth, or we could increase the verification depth up to 30%, when performing verification within the same time limit.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Gabriel P. Bischoff, Karl S. Brace, G. Cabodi, S. Nocco, S. Quer,