Thorough Checking Revisited

Abstract

Previous years have seen a proliferation of 3-valued models for capturing abstractions of systems, since these enable verifying both universal and existential properties. Reasoning about such systems is either inexpensive and imprecise (compositional checking), or expensive and precise (thorough checking). In this paper, we prove that thorough and… (More)
DOI: 10.1109/FMCAD.2006.33

Topics

4 Figures and Tables

Slides referencing similar topics