Formal Methods in Computer Aided Design (2006)
San Jose, California, USA
Nov. 12, 2006 to Nov. 16, 2006
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/FMCAD.2006.33
Shiva Nejati , University of Toronto, Canada
Mihaela Gheorghiu , University of Toronto, Canada
Marsha Chechik , University of Toronto, Canada
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 variety of abstract models and the entire \mu-calculus.
M. Gheorghiu, M. Chechik and S. Nejati, "Thorough Checking Revisited," 2006 Formal Methods in Computer-Aided Design(FMCAD), San Jose, CA, 2006, pp. 106-116.