RTL SAT simplification by Boolean and interval arithmetic reasoning | IEEE Conference Publication | IEEE Xplore

RTL SAT simplification by Boolean and interval arithmetic reasoning


Abstract:

We present a method that combines interval-arithmetic (IA) and Boolean reasoning with structural hashing for simplifying SAT problems on circuits expressed at the registe...Show More

Abstract:

We present a method that combines interval-arithmetic (IA) and Boolean reasoning with structural hashing for simplifying SAT problems on circuits expressed at the register-transfer level. We demonstrate that simple transformations based on interval-arithmetic operations can significantly reduce the complexity of the problem. We identify cases where the inherent over-approximations in IA operations can be reduced. We demonstrate that these techniques can significantly reduce RTL-SAT instances in size and runtime.
Date of Conference: 06-10 November 2005
Date Added to IEEE Xplore: 19 December 2005
Print ISBN:0-7803-9254-X

ISSN Information:

Conference Location: San Jose, CA, USA

References

References is not available for this document.