Deductive Model Checking

  • Authors:

  • Henny B. Sipma;Tomás E. Uribe;Zohar Manna

  • Affiliations:

  • Computer Science Department, Stanford University, Stanford, CA 94305. sipma@CS.Stanford.EDU;Computer Science Department, Stanford University, Stanford, CA 94305. uribe@CS.Stanford.EDU;Computer Science Department, Stanford University, Stanford, CA 94305. manna@CS.Stanford.EDU

  • Venue:
  • Formal Methods in System Design - Special issue on The First Federated Logic Conference (FLOC'96), part II
  • Year:
  • 1999

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present an extension of classical tableau-based model checkingprocedures to the case of infinite-state systems,using deductive methods in an incremental constructionof the behavior graph.Logical formulas are used to represent infinite sets of statesin an abstraction of this graph, which is repeatedly refined inthe search for a counterexample computation,ruling out large portions of the graph before they areexpanded to the state-level.This can lead to large savings, even in the case of finite-state systems.Only local conditions need to be checked at each step, and previouslyproven properties can be used to further constrain the search.Although the resulting method is not always automatic,it provides a flexible, general and complete framework that canintegrate a diverse number of other verification tools.