Algorithms for Interface Timing Verification

Download PDF
Open Webpage

Kenneth L. McMillan, David L. Dill

Published: 1992, Last Modified: 05 Nov 2025ICCD 1992EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: Algorithms for analyzing systems of inequalities with min/max constraints that arise in interface timing specifications are examined. A general form of the inequality is shown to be NP-complete, but some interesting special cases can be solved efficiently. A branch-and-bound solution to the general case is developed and applied to a previously published example.<>