Vacuum Cleaning CTL Formulae

  • Authors:
  • Mitra Purandare;Fabio Somenzi

  • Affiliations:
  • -;-

  • Venue:
  • CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

Vacuity detection in model checking looks for properties that hold in a model, and can be strengthened without causing them to fail. Such properties often signal problems in the model, its environment, or the properties themselves. The seminal paper of Beer et al. [1] proposed an efficient algorithm applicable to a restricted set of properties. Subsequently, Kupferman and Vardi [15] extended vacuity detection to more expressive specification mechanisms. They advocated a more minute examination of temporal logic formulae than the one adopted in [1]. However, they did not address the issues of practicality and usefulness of this more scrupulous inspection. In this paper we discuss efficient algorithms for the detection of vacuous passes of temporal logic formulae, showing that a thorough vacuity check for CTL formulae can be carried out with very small overhead, and even, occasionally, in less time than plain model checking. We also demonstrate the usefulness of such a careful analysis with the help of case studies.