Domain-specific regular acceleration

The regular model-checking approach is a set of techniques aimed at exploring symbolically infinite state spaces. These techniques proceed by representing sets of configurations of the system under analysis by regular languages, and the transition relation between these configurations by a transformation over such languages. The set of reachable configurations can then be computed by repeatedly applying the transition relation, starting from a representation of the initial set of configurations, until a fixed point is reached. In order for this computation to terminate, it is generally needed to introduce so-called acceleration operators, the purpose of which is to explore in one computation step infinitely many paths in the transition graph of the system. A simple form of acceleration operator is one that is associated to a cycle in the transition graph, computing the set of states that can be obtained by following this cycle arbitrarily many times. The computation of acceleration operators is strongly dependent on the type of the data values that are manipulated by the system, and on the symbolic representation chosen for handling sets of such values. In this survey, we describe acceleration operators suited for the regular state-space exploration of systems relying on FIFO communication channels, as well as those based on integer and real variables.

[1]  Randal E. Bryant,et al.  Symbolic Boolean manipulation with ordered binary-decision diagrams , 1992, CSUR.

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

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

[4]  L. Fribourg.  A Closed − Form Evaluation for Extended Timed Automata Research Report LSV , 1998 .

[5]  Laure Petrucci,et al.  FAST: Fast Acceleration of Symbolikc Transition Systems , 2003, CAV.

[6]  Alain Finkel,et al.  Unreliable Channels are Easier to Verify Than Perfect Channels , 1996, Inf. Comput..

[7]  Thomas Wilke,et al.  Locally Threshold Testable Languages of Infinite Words , 1993, STACS.

[8]  Bernard Boigelot,et al.  Counting the solutions of Presburger equations without enumerating them , 2001, Theor. Comput. Sci..

[9]  Felix Klaedtke.  Bounds on the automata size for Presburger arithmetic , 2008, TOCL.

[10]  Martin Peschke,et al.  Design and Validation of Computer Protocols , 2003 .

[11]  Thomas A. Henzinger,et al.  Automatic symbolic verification of embedded systems , 1993, 1993 Proceedings Real-Time Systems Symposium.

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

[13]  Daniel Brand,et al.  On Communicating Finite-State Machines , 1983, JACM.

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

[15]  David K. Smith.  Theory of Linear and Integer Programming , 1987 .

[16]  Pierre Wolper,et al.  An effective decision procedure for linear arithmetic over the integers and reals , 2005, TOCL.

[17]  Christof Löding,et al.  Efficient minimization of deterministic weak omega-automata , 2001, Inf. Process. Lett..

[18]  Ludwig Staiger,et al.  Automatentheoretische und automatenfreie Charakterisierungen topologischer Klassen regulärer Folgenmengen , 1974, J. Inf. Process. Cybern..

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

[20]  Orna Kupferman,et al.  Complementation Constructions for Nondeterministic Automata on Infinite Words , 2005, TACAS.

[21]  A. L. Semenov,et al.  Presburgerness of predicates regular in two number systems , 1977 .

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

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

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

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

[26]  Hubert Comon-Lundh,et al.  Diophantine Equations, Presburger Arithmetic and Finite Automata , 1996, CAAP.

[27]  Parosh Aziz Abdulla,et al.  A Survey of Regular Model Checking , 2004, CONCUR.

[28]  Volker Weispfenning,et al.  Mixed real-integer linear quantifier elimination , 1999, ISSAC '99.

[29]  S. Safra,et al.  On the complexity of omega -automata , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[30]  David L. Dill,et al.  Timing Assumptions and Verification of Finite-State Concurrent Systems , 1989, Automatic Verification Methods for Finite State Systems.

[31]  Sébastien Jodogne,et al.  Hybrid Acceleration Using Real Vector Automata (Extended Abstract) , 2003, CAV.

[32]  Bernard Boigelot,et al.  A Generalization of Semenov's Theorem to Automata over Real Numbers , 2009, CADE.

[33]  Bernard Boigelot,et al.  An Improved Reachability Analysis Method for Strongly Linear Hybrid Systems (Extended Abstract) , 1997, CAV.

[34]  Thomas A. Henzinger,et al.  The Algorithmic Analysis of Hybrid Systems , 1995, Theor. Comput. Sci..

[35]  Frédéric Herbreteau,et al.  The Power of Hybrid Acceleration , 2006, CAV.

[36]  Gerard J. Holzmann,et al.  Design and validation of computer protocols , 1991 .

[37]  Jochen Eisinger,et al.  Don’t care words with an application to the automata-based approach for real addition , 2006, Formal Methods Syst. Des..

[38]  Bernard Boigelot,et al.  On iterating linear transformations over recognizable sets of integers , 2003, Theor. Comput. Sci..

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

[40]  Thomas A. Henzinger,et al.  The theory of hybrid automata , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.

[41]  C. Michaux,et al.  LOGIC AND p-RECOGNIZABLE SETS OF INTEGERS , 1994 .

[42]  Alan Cobham,et al.  On the base-dependence of sets of numbers recognizable by finite automata , 1969, Mathematical systems theory.

[43]  Bernard Boigelot.  Symbolic Methods for Exploring Infinite State Spaces , 1998 .

[44]  Parosh Aziz Abdulla,et al.  Using Forward Reachability Analysis for Verification of Lossy Channel Systems , 2004, Formal Methods Syst. Des..

[45]  Pierre Wolper,et al.  An Automata-Theoretic Approach to Presburger Arithmetic Constraints (Extended Abstract) , 1995, SAS.

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

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

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

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

[50]  Nils Klarlund,et al.  Progress measures for complementation omega -automata with applications to temporal logic , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

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

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

[53]  R. BurchJ.,et al.  Symbolic model checking , 1992 .

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