A novel solution for the efficiency problems encountered in static timing verification is presented. The LSP algorithm is submitted to a critical analysis. A new hierarchy based approach is presented and its advantages and limitations are highlighted. Finally, some results on real life circuits are presented. >
['P. Johannes', 'Luc Claesen', 'H. De Man']
On the use of hierarchy in timing verification with statically sensitizable paths