Accurate Computation of Longest Sensitizable Paths using Answer Set Programming

Conference: Zuverlässigkeit und Entwurf - 6. GMM/GI/ITG-Fachtagung
09/25/0000 - 09/27/2012 at Bremen, Deutschland

Proceedings: Zuverlässigkeit und Entwurf

Pages: 4Language: englishTyp: PDF

Personal VDE Members are entitled to a 10% discount on this title

Andres, Benjamin; Gebser, Martin; Schaub, Torsten (University of Potsdam, August-Bebel-Strasse 89, 14482 Potsdam, Germany)
Sauer, Matthias; Schubert, Tobias; Becker, Bernd (Albert-Ludwigs-University Freiburg, Georges-Köhler-Allee 051, 79110 Freiburg, Germany)

Precise knowledge of the longest sensitizable paths in a circuit is crucial for various tasks in computer-aided design, including timing analysis, performance optimization, delay testing, and speed binning. As delays in today’s nanoscale technologies are increasingly affected by statistical parameter variations, there is significant interest in obtaining sets of paths that are within a length range. We present an ASP-based method for computing well-defined sets of sensitizable paths within a length range. Unlike previous approaches, the method is accurate and does not rely on a priori relaxations. Experimental results demonstrate the applicability and scalability of our method.