Beyond Regular Model Checking
نویسندگان
چکیده
In recent years, it has been established that regular model checking can be successfully applied to several parameterized veriication problems. However, there are many parameterized veriication problems that cannot be described by regular languages, and thus cannot be veri-ed using regular model checking. In this study we try to practice symbolic model checking using classes of languages more expressive than the regular languages. We provide three methods for the uniform veriication of non-regular parameterized systems.
منابع مشابه
A Grammatical Characterisation of Visibly Pushdown Languages
Model-checking regular properties has been proven to be a useful verification technique for regular as well as context-free programs. Only recently, model-checking was extended by ω-visibly pushdown languages (ωVPLs) beyond verifying regular properties and shown to be still decidable when the program is an ωVPL too. In this paper, we give a grammatical characterisation of ωVPLs and the correspo...
متن کاملA Grammatical Representation of Visibly Pushdown Languages
Model-checking regular properties is well established and a powerful verification technique for regular as well as context-free program behaviours. Recently, through the use of ω-visibly pushdown languages (ωVPLs), defined by ω-visibly pushdown automata, model-checking of properties beyond regular expressiveness was made possible and shown to be still decidable even when the program’s model of ...
متن کاملScalable Model Checking Beyond Safety - A Communication Fabric Perspective
Scalable Model Checking Beyond Safety A Communication Fabric Perspective by Sayak Ray Doctor of Philosophy in Engineering Electrical Engineering and Computer Sciences University of California, Berkeley Professor Robert K. Brayton, Chair In this research, we have developed symbolic algorithms and their open-source implementations that effectively solve liveness verification problem for industria...
متن کاملExtrapolating Tree Transformations
We consider the framework of regular tree model checking where sets of configurations of a system are represented by regular tree languages and its dynamics is modeled by a term rewriting system (or a regular tree transducer). We focus on the computation of the reachability set R(L) where R is a regular tree transducer and L is a regular tree language. The construction of this set is not possib...
متن کاملReconstructing and Extending Regular Model Checking by Refinement of Transition Relation
Regular model checking is a framework for verifying parameterized and infinite-state systems. Techniques for regular model checking such as quotienting require a well-specified transition relation where the invariant of the system is represented implicitly. To relax the restriction, we propose a technique, which we call refinement of transition relation, and reconstruct and extend regular model...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001