Efficient Decision Procedures for Model Checking of Linear Time Logic Properties

  title={Efficient Decision Procedures for Model Checking of Linear Time Logic Properties},
  author={Roderick Bloem and Kavita Ravi and F. Somenzi},
We propose an algorithm for LTL model checking based on the classification of the automata and on guided symbolic search. Like most current methods for LTL model checking, our algorithm starts with a tableau construction and uses a model checker for CTL with fairness constraints to prove the existence of fair paths. However, we classify the tableaux according to their structure, and use efficient decision procedures for each class. Guided search applies hints to constrain the transition… 

Improving Automata Generation for Linear Temporal Logic by Considering the Automaton Hierarchy

It is shown how large parts of the formulas can be translated to the simpler logic CTL, which accelerates the LTL model checking by orders of magnitude which is shown by experimental results.

Symbolic guided search for CTL model checking

This work shows how hints can be used in the computation of nested fixpoints and shows how to use hints to obtain overapproximations useful for greatest fixpoints, and presents the first results for backward search.

Strength-Based Decomposition of the Property Büchi Automaton for Faster Model Checking

A decomposition of the property automaton is suggested into three smaller automata capturing the terminal, weak, and the remaining strong behaviors of theproperty, which can be used with any automata-based model checker.

Automata construction for onthe-fly Model Checking PSL Safety Simple Subset ?

This paper presents the translation into automata of a subset of psl called SafetyPSL, which consists of safety properties and is of special interest, because they can be model checked efficiently, as will be explained in the sequel.

Survey on Directed Model Checking

This article surveys and gives historical accounts to the algorithmic essentials of directed model checking, a promising bug-hunting technique to mitigate the state explosion problem and explains howdirected model checking helps to accelerate finding solutions to scheduling problems.

Model checking pushdown systems

The thesis examines model-checking problems for pushdown systems, improving previously known algorithms in terms of both asymptotic complexity and practical usability, and investigates several optimizations which served to improve the efficiency of the checker.

Automata-Theoretic Model Checking Revisited

The fundamentals of automata-theoretic model checking are covered, recent progress is reviewed, and areas that require further research are outlined.

Using heuristic search for finding deadlocks in concurrent systems

Towards language emptiness model checking for MDG

  • F. WangS. Tahar
  • Computer Science
    IEEE CCECE2002. Canadian Conference on Electrical and Computer Engineering. Conference Proceedings (Cat. No.02CH37373)
  • 2002
This paper surveys the /spl omega/-automata based model checking approaches and multiway decision graphs functionalities, then addresses the feasibility and approaches of developing automata-based model checking in MDGs.

Efficient Büchi Automata from LTL Formulae

We present an algorithm to generate small Buchi automata for LTL formulae. We describe a heuristic approach consisting of three phases: rewriting of the formula, an optimized translation procedure,



Another Look at LTL Model Checking

The SMV model checking system developed by McMillan can be extended to permit LTL specifications and the results that are obtained are quite surprising.

Simple on-the-fly automatic verification of linear temporal logic

A tableau-based algorithm for obtaining an automaton from a temporal logic formula that can be constructed simultaneously with, and guided by, the generation of the model, and which can be used in model checking in an “on-the-fly” fashion.

Incremental CTL model checking using BDD subsetting

  • A. PardoG. Hachtel
  • Computer Science
    Proceedings 1998 Design and Automation Conference. 35th DAC. (Cat. No.98CH36175)
  • 1998
An automatic abstraction/refinement algorithm for symbolic CTL model checking is presented and is done for the full CTL language-no restriction is made to the universal or existential fragments.

Relating linear and branching model checking

This paper relates branching and linear model checking, and claims that, in practice, LTL model checkers perform nicely on formulas with equivalences of CTL, and often proceed essentially as the ones for CTL.

Symbolic Model Checking: 10^20 States and Beyond

On-the-Fly Model Checking of RCTL Formulas

It is shown that for every erroneous finite computation, there is an RCTL formula that detects it and can be verified on-the-fly and moved model checking in IBM into a different class of designs inaccessible by prior techniques.

Tearing based automatic abstraction for CTL model checking

The tearing paradigm is presented as a way to automatically abstract behavior to obtain upper and lower bound approximations of a reactive system and algorithms that exploit the bounds to perform conservative ECTL and ACTL model checking are presented.

Forward model checking techniques oriented to buggy designs

  • H. IwashitaT. Nakata
  • Computer Science
    1997 Proceedings of IEEE International Conference on Computer Aided Design (ICCAD)
  • 1997
The techniques that modify the order of state traversal on forward model checking are presented, and that dramatically improve average CPU time for finding design errors.

CTL model checking based on forward state traversal

Experimental results show that the proposed CTL model checking algorithm can verify actual CTL properties of large industrial models which cannot be handled by conventional model checkers.

VIS: A System for Verification and Synthesis

VIS provides the capability to check the combinational equivalence of two designs and provides traditional verification in the form of a cycle-based simulator that uses BDD techniques.