On-the-Fly Model Checking of RCTL Formulas
نویسندگان
چکیده
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 ofRCTL 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.
منابع مشابه
Efficient Model Checking via the Equational µ-Calculus
This paper studies the use of an equational variant of the modal -calculus as a unified framework for efficient temporal logic model checking. In particular, we show how an expressive temporal logic, CTL , may be efficiently translated into the -calculus. Using this translation, one may then employ -calculus model-checking techniques, including on-the-fly procedures, BDD-based algorithms and co...
متن کاملA Model Checking Language for Concurrent Value-Passing Systems
Modal μ-calculus is an expressive specification formalism for temporal properties of concurrent programs represented as Labeled Transition Systems (Ltss). However, its practical use is hampered by the complexity of the formulas, which makes the specification task difficult and error-prone. In this paper, we propose Mcl (Model Checking Language), an enhancement of modal μ-calculus with high-leve...
متن کاملSymbolic Model Checking of Stochastic Reward Nets
This paper describes a symbolic model checking approach for the Continuous Stochastic Reward Logic (CSRL) and stochastic reward nets, stochastic Petri nets augmented with rate rewards. CSRL model checking requires the computation of the joint distribution of time and accumulated reward, which is done by Markovian approximation. An implementation is available in the model checker MARCIE. It appl...
متن کاملLocal Model Checking Games for Fixed Point Logic with Chop
The logic considered in this paper is FLC, fixed point logic with chop. It is an extension of modal μ-calculus Lμ that is capable of defining non-regular properties which makes it interesting for verification purposes. Its model checking problem over finite transition systems is PSPACE-hard. We define games that characterise FLC’s model checking problem over arbitrary transition systems. Over f...
متن کاملOn-the-Fly Data Flow Analysis Based on Verification Technology
The combination of static and dynamic software analysis, such as data flow analysis (Dfa) and model checking, provides benefits for both disciplines. On the one hand, the information extracted by Dfas about program data may be utilized by model checkers to optimize the state space representation. On the other hand, the expressiveness of logic formulas allows us to consider model checkers as gen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998