Digital Version of Green's Theorem and its Application to The Coverage Problem in Formal Verification


We present a novel scheme to the coverage problem, introducing a quantitative way to estimate the interaction between a block an its environment. This is achieved by setting a discrete version of Green’s Theorem, specially adapted for Model Checking based verification of integrated circuits. This method is best suited for the coverage problem since it… (More)


6 Figures and Tables

Slides referencing similar topics