h DEBUGGING OF SPEED-LIMITING paths (speedpaths) is a key challenge in development of very large scale integrated (VLSI) circuits as timing variations induced by process and environmental effects are increasing. This paper presents an approach to automate speedpath debugging under timing variations. First, timing behavior of a circuit and corresponding variation models are converted into a functional domain. Then, our automated debugging based on boolean satisfiability (SAT) diagnoses speedpaths. The experimental results show the effectiveness of our approach on ISCAS'85 and ISCAS'89 benchmarks suites.One of the major challenges in designing highperformance VLSI circuits is diagnosis and analysis of speedpaths. A speedpath is a frequency-limiting critical path which affects the performance of a chip [2]. A speedpath that violates timing constraints at the post-silicon stage is called failing speedpath [3]. Speedpaths fail due to, e.g., timing variations induced by process, design, and environmental effects [2].Post-silicon validation involves applying test vectors to the chip in order to verify its correct behavior. When a speed failure is detected due to frequency constraints [4], the debug team identifies failing speedpaths. But this is a time-consuming process which requires a significant effort. Thus, automated debugging approaches to identify failing speedpaths are necessary to speed up the process.Recently, there is a range of works that considers timing analysis of circuits under variations. A survey of the works focusing on statistical static timing analysis (SSTA) is given in [5]. SSTA methods analyze a circuit considering timing variations. The work in [3] proposes a formal procedure based on an integer linear programming (ILP) formulation to diagnose segments of failing speedpaths due to process variations. ILP is a specific case of a system of linear constraints in which the variables can only take integer values. The ILP-based debug approach identifies segments of failing speedpaths that have a post-silicon delay larger than their estimated delay at the pre-silicon stage. Parameterized static timing analysis (PSTA) is used in [6] to obtain a variational model for every candidate speedpath from a given set of potential candidates. These variational models are then combined to create a cost function. This PSTA-based cost function determines the likelihood of any given combination of paths to be the selection of ''true'' speedpaths. The cost function is utilized by a branch-and-bound approach to Editor's notes: This paper presents a novel approach to automate speedpath debugging taking into account variations. The proposed technique is based on Boolean Satisfiability. The approach is based on converting the timing behavior of a circuit into the functional domain, inserting a variation logic into the model, and using a Boolean Satisfiability solver to extract failing speedpaths.determine the most probable failing speedpaths. In contrast to our approach, the previous approach needs a set of user-supplied ...