A Survey of Regular Model Checking

Regular model checking is being developed for algorithmic verification of several classes of infinite-state systems whose configurations can be modeled as words over a finite alphabet. Examples include parameterized systems consisting of an arbitrary number of homogeneous finite-state processes connected in a linear or ring-formed topology, and systems that operate on queues, stacks, integers, and other linear data structures. The main idea is to use regular languages as the representation of sets of configurations, and finite-state transducers to describe transition relations. In general, the verification problems considered are all undecidable, so the work has consisted in developing semi-algorithms, and decidability results for restricted cases. This paper provides a survey of the work that has been performed so far, and some of its applications.

[1]  Marcus Nilsson,et al.  Transitive Closures of Regular Relations for Verifying Infinite-State Systems , 2000, TACAS.

[2]  Leslie Lamport,et al.  The temporal logic of actions , 1994, TOPL.

[3]  Hubert Comon-Lundh,et al.  Multiple Counters Automata, Safety Analysis and Presburger Arithmetic , 1998, CAV.

[4]  Pierre Wolper,et al.  Iterating transducers in the large , 2003 .

[5]  Javier Esparza,et al.  A BDD-Based Model Checker for Recursive Programs , 2001, CAV.

[6]  Pierre Wolper,et al.  A direct symbolic approach to model checking pushdown systems , 1997, INFINITY.

[7]  Nils Klarlund,et al.  Mona: Monadic Second-Order Logic in Practice , 1995, TACAS.

[8]  Parosh Aziz Abdulla,et al.  On-the-Fly Analysis of Systems with Unbounded, Lossy FIFO Channels , 1998, CAV.

[9]  Tayssir Touili,et al.  Extrapolating Tree Transformations , 2002, CAV.

[10]  Tayssir Touili.  Regular Model Checking using Widening Techniques , 2001, Electron. Notes Theor. Comput. Sci..

[11]  Nils Klarlund,et al.  Automata based symbolic reasoning in hardware verification , 1998, FM-Trends 1998.

[12]  Amir Pnueli,et al.  Symbolic model checking with rich assertional languages , 2001, Theor. Comput. Sci..

[13]  Amir Pnueli,et al.  Beyond Regular Model Checking , 2001, FSTTCS.

[14]  Ahmed Bouajjani,et al.  Abstract Regular Model Checking , 2004, CAV.

[15]  Pierre Wolper,et al.  Symbolic Verification with Periodic Sets , 1994, CAV.

[16]  Joseph Sifakis,et al.  Specification and verification of concurrent systems in CESAR , 1982, Symposium on Programming.

[17]  Pierre Wolper,et al.  The Power of QDDs , 1997 .

[18]  Javier Esparza,et al.  Reachability Analysis of Pushdown Automata: Application to Model-Checking , 1997, CONCUR.

[19]  Pierre Wolper,et al.  An Automata-Theoretic Approach to Automatic Program Verification (Preliminary Report) , 1986, LICS.

[20]  Pierre Wolper,et al.  Verifying Systems with Infinite but Regular State Spaces , 1998, CAV.

[21]  Ahmed Bouajjani,et al.  Symbolic Reachability Analysis of FIFO-Channel Systems with Nonregular Sets of Configurations , 1999, Theor. Comput. Sci..

[22]  Parosh Aziz Abdulla,et al.  Regular Model Checking for LTL(MSO) , 2004, CAV.

[23]  Amir Pnueli,et al.  Algorithmic Verification of Linear Temporal Logic Specifications , 1998, ICALP.

[24]  Gary L. Peterson,et al.  Myths About the Mutual Exclusion Problem , 1981, Inf. Process. Lett..

[25]  Parosh Aziz Abdulla,et al.  Regular Tree Model Checking , 2002, CAV.

[26]  Sérgio Vale Aguiar Campos,et al.  Symbolic Model Checking , 1993, CAV.

[27]  Didier Caucal,et al.  On the Regular Structure of Prefix Rewriting , 1990, Theor. Comput. Sci..

[28]  Patrice Godefroid,et al.  Symbolic Verification of Communication Protocols with Infinite State Spaces using QDDs , 1999, Formal Methods Syst. Des..

[29]  C. Rattray,et al.  Specification and Verification of Concurrent Systems , 1990, Workshops in Computing.

[30]  Marcus Nilsson,et al.  Regular Model Checking , 2000, CAV.

[31]  Parosh Aziz Abdulla,et al.  Regular Model Checking Made Simple and Efficient , 2002, CONCUR.

[32]  Pierre Wolper,et al.  The Power of QDDs (Extended Abstract) , 1997, SAS.

[33]  Edmund M. Clarke,et al.  Symbolic Model Checking: 10^20 States and Beyond , 1990, Inf. Comput..

[34]  Parosh Aziz Abdulla,et al.  Algorithmic Improvements in Regular Model Checking , 2003, CAV.