A Structure-preserving Clause Form Translation
Journal of Symbolic Computation
GRASP: A Search Algorithm for Propositional Satisfiability
IEEE Transactions on Computers
Chaff: engineering an efficient SAT solver
Proceedings of the 38th annual Design Automation Conference
Satisfiability models and algorithms for circuit delay computation
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Integrating Functional and Temporal Domains in Logic Design: The False Path Problem and Its Implications
Event propagation for accurate circuit delay calculation using SAT
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Efficient Boolean characteristic function for timed automatic test pattern generation
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
An efficient algorithm to verify generalized false paths
Proceedings of the 47th Design Automation Conference
Path sensitization in critical path problem [logic circuit design]
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Computation of floating mode delay in combinational circuits: theory and algorithms
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Functional timing analysis using ATPG
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Automatic test pattern generation for delay defects using timed characteristic functions
Proceedings of the International Conference on Computer-Aided Design
Sensitization criterion for threshold logic circuits and its application
Proceedings of the International Conference on Computer-Aided Design
| Hi-index | 0.00 |
Functional, in contrast to structural, timing analysis is accurate, but computationally expensive in refuting false critical paths. Although satisfiability-based analysis using timed characteristic functions has been proposed, its efficiency and generality remain room for improvement. This paper shows functional timing analysis on industrial designs can be made up to several orders of magnitude faster and more generally applicable than prior methods.