Timing verification: a new understanding of false paths

Abstract

Despite the growing number of timing verification algorithms, a concise formal approach for the definition of false paths is missing. In this paper, based on the logical and delay properties of the discussed circuits, some precise formal definitions are derived with two major advantages. First, they make the understanding of false paths surprisingly intelligible. Second, they are independent of algorithmic interpretations because of their formal derivation.<>