We describe a symbolic modeling for handling bit-flips and glitches in digital circuits. Using Model Counting we can compute the conditional error probability and we can efficiently order gates according to their criticality for selective hardening. We can handle sets of gates symbolically as a whole and using ROBDD or #SAT Algorithms we obtain an exact solution without repeatedly injecting errors. Multiple bit-flips can be handled as well. We can consider correlated input patterns. We show the performance of the symbolic modeling when processing set of gates instead of repeatedly considering a single gate, without losing detailed information.
展开▼
