Regular model checking

Regular model checking has been studied extensively during recent years as a framework for algorithmic verification of systems with infinite state spaces. We describe the main concepts of the framework, and some of its applications.

[1]  Laurent Fribourg,et al.  Reachability sets of parameterized rings as regular languages , 1997, INFINITY.

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

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

[4]  E. Pascal Gribomont,et al.  Automated Verification of Szymanski's Algorithm , 1998, TACAS.

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

[6]  J. R. Büchi.  On a Decision Method in Restricted Second Order Arithmetic , 1990 .

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

[8]  Bernard Boigelot,et al.  Domain-specific regular acceleration , 2012, International Journal on Software Tools for Technology Transfer.

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

[10]  Pierre Wolper,et al.  Omega-Regular Model Checking , 2004, TACAS.

[11]  Tayssir Touili,et al.  Widening techniques for regular tree model checking , 2011, International Journal on Software Tools for Technology Transfer.

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

[13]  Pierre Wolper,et al.  On the Construction of Automata from Linear Arithmetic Constraints , 2000, TACAS.

[14]  Pierre Wolper,et al.  Iterating Transducers in the Large (Extended Abstract) , 2003, CAV.

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

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

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

[18]  Parosh Aziz Abdulla,et al.  Regular Model Checking Without Transducers (On Efficient Verification of Parameterized Systems) , 2007, TACAS.

[19]  Rajeev Alur,et al.  Model-checking for real-time systems , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

[20]  Parosh Aziz Abdulla,et al.  Well (and Better) Quasi-Ordered Transition Systems , 2010, The Bulletin of Symbolic Logic.

[21]  Edmund M. Clarke,et al.  Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic , 1981, Logic of Programs.

[22]  Rance Cleaveland,et al.  Pragmatics of model checking: an STTT special section , 1999, International Journal on Software Tools for Technology Transfer.

[23]  Philippe Schnoebelen,et al.  Flat Acceleration in Symbolic Model Checking , 2005, ATVA.

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

[25]  Parosh Aziz Abdulla,et al.  General decidability theorems for infinite-state systems , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.

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

[27]  Bernhard Steffen,et al.  Pushdown Processes: Parallel Composition and Model Checking , 1994, CONCUR.

[28]  Ed Brinksma,et al.  Computer Aided Verification: Proceding of the 14th International Conference, CAV 2002, Copenhagen, Denmark, July 27-31 2002 , 2002 .

[29]  Yassine Lakhnech,et al.  Iterating transducers , 2001, J. Log. Algebraic Methods Program..

[30]  Susanne Graf,et al.  Tools and Algorithms for the Construction and Analysis of Systems , 2000 .

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

[32]  Tiziana Margaria,et al.  Tools and algorithms for the construction and analysis of systems: a special issue for TACAS 2017 , 2001, International Journal on Software Tools for Technology Transfer.

[33]  Giorgio Delzanno,et al.  A lightweight regular model checking approach for parameterized systems , 2012, International Journal on Software Tools for Technology Transfer.

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

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

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

[37]  Jean-François Raskin,et al.  Antichains for the Automata-Based Approach to Model-Checking , 2009, Log. Methods Comput. Sci..

[38]  Bernhard Steffen,et al.  Model Checking for Context-Free Processes , 1992, CONCUR.

[39]  Armin Biere,et al.  Bounded Model Checking Using Satisfiability Solving , 2001, Formal Methods Syst. Des..

[40]  Alan J. Hu,et al.  Computer aided verification : 10th International Conference, CAV '98, Vancouver, BC, Canada, June 28-July 2, 1998 : proceedings , 1998, CAV 1998.

[41]  Amir Pnueli,et al.  The temporal logic of programs , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

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

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

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

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

[46]  Boleslaw K. Szymanski.  Mutual exclusion revisited , 1990, Proceedings of the 5th Jerusalem Conference on Information Technology, 1990. 'Next Decade in Information Technology'.

[47]  Randal E. Bryant,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.

[48]  Magnus Larsson.  Applying Configuration Management Techniques to Component-based Systems , 2000 .

[49]  A. Prasad Sistla,et al.  Parametrized Verification of Linear Networks Using Automata as Invariants , 1997, CAV.

[50]  Somesh Jha,et al.  Veryfying Parameterized Networks using Abstraction and Regular Languages , 1995, CONCUR.

[51]  A. Prasad Sistla,et al.  Computer aided verification : 12th International Conference, CAV 2000, Chicago, IL, USA, July 15-19, 2000 : proceedings , 2000, CAV 2000.

[52]  Javier Esparza,et al.  Efficient Algorithms for Model Checking Pushdown Systems , 2000, CAV.

[53]  Rajeev Alur,et al.  A Theory of Timed Automata , 1994, Theor. Comput. Sci..

[54]  Parosh Aziz Abdulla,et al.  Verifying programs with unreliable channels , 1993, [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science.

[55]  Ahmed Bouajjani,et al.  Abstract Regular Tree Model Checking of Complex Dynamic Data Structures , 2006, SAS.

[56]  Nils Klarlund,et al.  MONA Implementation Secrets , 2000, Int. J. Found. Comput. Sci..

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

[58]  Patrick Cousot,et al.  Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints , 1977, POPL.

[59]  Axel Legay,et al.  Extrapolating (omega-)regular model checking , 2011, International Journal on Software Tools for Technology Transfer.

[60]  Leslie Lamport,et al.  A new solution of Dijkstra's concurrent programming problem , 1974, Commun. ACM.

[61]  Parosh Aziz Abdulla,et al.  When Simulation Meets Antichains , 2010, TACAS.

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

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

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

[65]  Susanne Graf,et al.  Tools and Algorithms for Construction and Analysis of Systems, 6th International Conference, TACAS 2000, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS 2000, Berlin, Germany, March 25 - April 2, 2000, Proceedings , 2000, TACAS.

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

[67]  Parosh Aziz Abdulla,et al.  Symbolic Reachability Analysis Based on SAT-Solvers , 2000, TACAS.

[68]  Parosh Aziz Abdulla,et al.  Handling Global Conditions in Parameterized System Verification , 1999, CAV.

[69]  Ahmed Bouajjani,et al.  Symbolic Reachability Analysis of FIFO Channel Systems with Nonregular Sets of Configurations (Extended Abstract) , 1997, ICALP.

[70]  Kenneth L. McMillan,et al.  Symbolic model checking , 1992 .

[71]  Patrice Godefroid,et al.  Symbolic Verification of Communication Protocols with Infinite State Spaces Using QDDs (Extended Abstract) , 1996, CAV.