Thorough Checking Revisited

Shiva Nejati, Mihaela Gheorghiu, Marsha Chechik
2006 2006 Formal Methods in Computer Aided Design  
Recent 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 compositional checks for temporal formulas in their disjunctive forms coincide, which leads to an effective procedure for thorough checking of a
more » ... hecking of a variety of abstract models and the entire µ-calculus.
doi:10.1109/fmcad.2006.33 dblp:conf/fmcad/NejatiGC06 fatcat:2vqoa3wd5jbhdd4djnddh2xcj4