Maximum Circuit Activity Estimation Using Pseudo-Boolean Satisfiability

Abstract

Abstract-With lower supply voltages, increased integration densities and higher operating frequencies, power grid verification has become a crucial step in the VLSI design cycle. The accurate estimation of maximum instantaneous power dissipation aims at finding the worst-case scenario where excessive simultaneous switching could impose extreme current demands on the power grid. This problem is highly input-pattern dependent and is proven to be NP-hard. In this work, we capitalize on the compelling advancements in satisfiability solvers to propose a pseudo-Boolean satisfiability-based framework that reports the input patterns maximizing circuit activity, and consequently peak dynamic power, in combinational and sequential circuits. The proposed framework is enhanced to handle unit gate delays and output glitches. In order to disallow unrealistic input transitions, we show how to integrate input constraints in the formulation. Finally, a number of optimization techniques, such as the use of gate switching equivalence classes, are described to improve the scalability of the proposed method. An extensive suite of experiments on ISCAS85 and ISCAS89 circuits confirms the robustness of the approach compared to simulation-based techniques and encourages further research for low-power solutions using Boolean satisfiability.

Análisis de la seguridad en los sistemas de e-Gobierno mediante el problema SAT

“…El problema de satisfactibilidad booleana (SAT) tiene como objetivo evaluar toda una fórmula constituida por conectores lógicos que puede ser verdadera, dando a sus variables booleanas valores de verdadero o falso [14]. Procedimientos como SAT27 pueden comprobar fórmulas con cientos de miles de variables debido a las innovaciones de los algoritmos básicos, la estructura de datos y el uso de los modernos microprocesadores.…”

As-Robust-As-Possible test generation in the presence of small delay defects using pseudo-Boolean optimization

“…Pseudo-Boolean SAT solvers benefit significantly from the recent advances in SAT solving techniques [12] and have already shown their feasibility in other domains like for instance the maximum circuit activity estimation [13], [14]. Another optimization problem is the test generation with maximal crosstalk-induced delay.…”