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. For instance, such path sets can be used in the emerging areas of Post-silicon validation and characterization and Adaptive Test. 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. © 2013 Springer-Verlag.
CITATION STYLE
Andres, B., Sauer, M., Gebser, M., Schubert, T., Becker, B., & Schaub, T. (2013). Accurate computation of sensitizable paths using answer set programming. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8148 LNAI, pp. 92–101). https://doi.org/10.1007/978-3-642-40564-8_10
Mendeley helps you to discover research relevant for your work.