## On-The-Fly Model Checking of RCTL Formulas (1998)

Venue: | In Proc. 10 th International Conference on Computer Aided Verification (CAV’98), LNCS 1427 |

Citations: | 40 - 14 self |

### BibTeX

@INPROCEEDINGS{Beer98on-the-flymodel,

author = {Ilan Beer and Shoham Ben-david and Avner Landver and Avner L},

title = {On-The-Fly Model Checking of RCTL Formulas},

booktitle = {In Proc. 10 th International Conference on Computer Aided Verification (CAV’98), LNCS 1427},

year = {1998},

pages = {184--194},

publisher = {Springer-Verlag}

}

### Years of Citing Articles

### OpenURL

### Abstract

The specification language RCTL, an extension of CTL, is defined by adding the power of regular expressions to CTL. In addition to being a more expressive and natural hardware specification language than CTL, a large family of RCTL formulas can be verified on-the-fly (during symbolic reachability analysis). On-the-fly model checking, as a powerful verification paradigm, is especially efficient when the specification is false and extremely efficient when the computation needed to get to a failing state is short. It is suitable for the inherently gradual design process since it detects a multitude of bugs at the early verification stages, and paves the way towards finding the more complex errors as the design matures. It is shown that for every erroneous finite computation, there is an RCTL formula that detects it and can be verified on-the-fly. On-thefly verification of RCTL formulas has moved model checking in IBM into a different class of designs inaccessible by prior techniques.

### Citations

1294 |
Symbolic Model Checking
- McMillan
- 1993
(Show Context)
Citation Context ...the number of state variables and therefore, very quickly, models become too large to be model checked. Symbolic model checking, using BDD's, was suggested by McMillan who wrote the model checker SMV =-=[McM93]-=-. SMV has made model checking applicable to real life designs. Nevertheless, the state explosion problem is still the greatest concern of model checking. Another major concern related to CTL model che... |

794 |
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
- CLARKE, EMERSON
- 1982
(Show Context)
Citation Context ...n be verified on-the-fly. On-thefly verification of RCTL formulas has moved model checking in IBM into a different class of designs inaccessible by prior techniques. 1 Introduction CTL Model-Checking =-=[CE81a]-=- [CE81b] is the procedure of deciding whether a given model satisfies a given CTL formula (we use the term model to denote a finite, closed, non-deterministic state machine). The main problem of model... |

271 | Model checking and modular verification
- GRUMBERG, LONG
- 1994
(Show Context)
Citation Context ... [LP85]. A different algorithm was presented in [VW86] . In [CGH97], LTL model checking is performed using a tableau construction and running within SMV. Tableau construction for ACTL is presented in =-=[GL94]-=-. In all these referenced works, the construction of the tableau is exponential in the length of the formula. In [CYF94] it is shown how to translate a specific CTL formula into an FSM in order to sav... |

235 |
Checking that finite state concurrent programs satisfy their linear specification
- Lichtenstein, Pnueli
- 1985
(Show Context)
Citation Context ...hecking in IBM into a different class of designs inaccessible by prior techniques. Translating formulas into state machines is not a new idea. Tableau construction for LTL model checking was given in =-=[LP85]-=-. A different algorithm was presented in [VW86] . In [CGH97], LTL model checking is performed using a tableau construction and running within SMV. Tableau construction for ACTL is presented in [GL94].... |

198 |
Temporal logic can be more expressive
- Wolper
- 1983
(Show Context)
Citation Context ...CTL formula into an FSM in order to save run-time, on-the-fly verification is not mentioned there and no other CTL formulas are discussed. Using regular expressions for specifications is discussed in =-=[Wol81]-=- (for LTL) and in [IN97] (for CTL). The rest of the paper is organized as follows. In the next section we define the specification language RCTL. In section 3, we introduce a significant subset of RCT... |

111 | Another look at LTL model checking
- Clarke, Grumberg, et al.
- 1994
(Show Context)
Citation Context ...le by prior techniques. Translating formulas into state machines is not a new idea. Tableau construction for LTL model checking was given in [LP85]. A different algorithm was presented in [VW86] . In =-=[CGH97]-=-, LTL model checking is performed using a tableau construction and running within SMV. Tableau construction for ACTL is presented in [GL94]. In all these referenced works, the construction of the tabl... |

83 |
Model Checking, Abstraction, and Compositional Verification
- Long
- 1993
(Show Context)
Citation Context ...rms a computation that agrees with R. The specification "M has no computations that agree with R" is equivalent to M \Theta A(R) j= AG(:matchR ) This check can be performed on-the-fly as des=-=cribed in [Lon93]-=- and in [EM95]. That is, in the process of reachable state space computation, one checks whether A(R) enters the state matchR . If it does, then model checking is stopped and the above specification f... |

59 | and Landvar,” RuleBase an industryoriented formal verification tool”, Proceedings of 33rd Design Automation Conference (DAC), Association for Computing Machinery Inc.,(1996), 655-660. Prashanth C.M. is an Assistant Professor in the department of Computer
- Beer, Ben-David, et al.
(Show Context)
Citation Context ...nce also shows that well over 80% of the formulas needed for a typical hardware design can be verified with the above on-the-fly method. The results of this paper were implemented in 1995 in RuleBase =-=[BBEL]-=-, which is an IBM model checker based on SMV. RuleBase reads formulas in RCTL and decides whether it is possible to verify them on-the-fly. Formulas that can not be verified on-thefly are evaluated us... |

31 |
Bug Identification of a Real Chip Design by Symbolic Model Checking
- Chen, Yamazaki, et al.
- 1994
(Show Context)
Citation Context ...nstruction and running within SMV. Tableau construction for ACTL is presented in [GL94]. In all these referenced works, the construction of the tableau is exponential in the length of the formula. In =-=[CYF94]-=- it is shown how to translate a specific CTL formula into an FSM in order to save run-time, on-the-fly verification is not mentioned there and no other CTL formulas are discussed. Using regular expres... |

20 | Forward model checking techniques oriented to buggy designs
- Iwashita, Nakata
- 1997
(Show Context)
Citation Context ...n order to save run-time, on-the-fly verification is not mentioned there and no other CTL formulas are discussed. Using regular expressions for specifications is discussed in [Wol81] (for LTL) and in =-=[IN97]-=- (for CTL). The rest of the paper is organized as follows. In the next section we define the specification language RCTL. In section 3, we introduce a significant subset of RCTL and show how its formu... |

19 |
E.M.Ciarke, Characterizing properties of parallel programs as fixpoints
- Emerson
(Show Context)
Citation Context ...ified on-the-fly. On-thefly verification of RCTL formulas has moved model checking in IBM into a different class of designs inaccessible by prior techniques. 1 Introduction CTL Model-Checking [CE81a] =-=[CE81b]-=- is the procedure of deciding whether a given model satisfies a given CTL formula (we use the term model to denote a finite, closed, non-deterministic state machine). The main problem of model checkin... |

3 |
ªUsing Formal Verification/ Analysis Methods on the
- Eiriksson, McMillan
- 1995
(Show Context)
Citation Context ...on that agrees with R. The specification "M has no computations that agree with R" is equivalent to M \Theta A(R) j= AG(:matchR ) This check can be performed on-the-fly as described in [Lon9=-=3] and in [EM95]-=-. That is, in the process of reachable state space computation, one checks whether A(R) enters the state matchR . If it does, then model checking is stopped and the above specification fails, otherwis... |

1 |
An automatic theoretic approach to automatic program verification
- Vardi, Wolper
- 1986
(Show Context)
Citation Context ...s inaccessible by prior techniques. Translating formulas into state machines is not a new idea. Tableau construction for LTL model checking was given in [LP85]. A different algorithm was presented in =-=[VW86]-=- . In [CGH97], LTL model checking is performed using a tableau construction and running within SMV. Tableau construction for ACTL is presented in [GL94]. In all these referenced works, the constructio... |