Practical symbolic model checking of the full µ-calculus using compositional abstractions

We apply abstract interpretation techniques to reduce the time and space requirements for model checking the full J-l-calculus over parallel processes. The abstractions can be computed compositionally. The techniques have been implemented in a StateCharts model checker. Experiments show a 17-fold reduction on the average in the size of the BDDs on non-trivial specifications.

[1]  Pdv Peter van der Stok,et al.  Hard Real-Time Reliable Multicast in the Dedos System , 1995, Responsive Computer Systems.

[2]  Rr Rob Hoogerwoord,et al.  On the foundations of functional programming : a programmer's point of view , 1994 .

[3]  Rt Rob Gerth.  Verifying sequentially consistent memory using interface refinement , 1993 .

[4]  Dennis Taylor,et al.  Time and order of abstract events in distributed computations , 1994 .

[5]  Gerard Zwaan,et al.  A Taxonomy of Sublinear Multiple Keyword Pattern Matching Algorithms , 1996, Sci. Comput. Program..

[6]  van Km Kees Hee,et al.  Systems engineering : a formal approach. Part III. Modeling methods , 1993 .

[7]  Arie van Deursen,et al.  Axiomatizing early and late input by variable elimination , 1995 .

[8]  R. Backhouse,et al.  Mathematical induction made calculational , 1994 .

[9]  Twan Laan,et al.  A formalization of the ramified type theory , 1994 .

[10]  Dick Alstein,et al.  Distributed consensus and hard real-time systems , 1994 .

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

[12]  B. Watson.  A taxonomy of finite automata construction algorithms , 1993 .

[13]  Jos C. M. Baeten,et al.  A Congruence Theorem for Structured Operational Semantics with Predicates , 1993, CONCUR.

[14]  Joseph Sifakis,et al.  Property preserving abstractions for the verification of concurrent systems , 1995, Formal Methods Syst. Des..

[15]  van Os Onno Roosmalen,et al.  A hierarchical diagrammatic representation of class structure , 1994 .

[16]  Edmund M. Clarke,et al.  Model checking and abstraction , 1994, TOPL.

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

[18]  Mads Dam.  CTL* and ECTL* as Fragments of the Modal mu-Calculus , 1994, Theor. Comput. Sci..

[19]  Orna Grumberg,et al.  Abstract Interpretation of Reactive Systems: Abstractions Preserving 'I1CTL *. 3CTL * and CTL * , 1994 .

[20]  Chris Verhoef,et al.  A General Conservative Extension Theorem in Process Algebra , 1994, PROCOMET.

[21]  Wil M.P. van der Aalst,et al.  A class of Petri nets for modeling and analyzing business processes , 1995 .

[22]  A. Tarski.  A LATTICE-THEORETICAL FIXPOINT THEOREM AND ITS APPLICATIONS , 1955 .

[23]  Peter Kelb,et al.  An OBDD-representation of statecharts , 1994, Proceedings of European Design and Test Conference EDAC-ETC-EUROASIC.

[24]  P. Niebert,et al.  On the connection of partial order logics and partial order reduction methods , 1995 .

[25]  T Tom Verhoeff,et al.  A continuous version of the prisoner's dilemma , 1993 .

[26]  Ron Selj.  A New Method for Integrity Constraint Checking in Deductive Databases , 1994 .

[27]  Chenho Kung,et al.  The Object-oriented Paradigm , 1991 .

[28]  Peter van der Stok,et al.  A Hierarchical Membership Protocol for Synchronous Distributed Systems , 1994, EDCC.

[29]  van Km Kees Hee,et al.  Systems engineering : a formal approach. Part IV. Analysis methods , 1993 .

[30]  J. P. Veltkamp,et al.  On the unavoidability of metastable behaviour , 1993 .

[31]  Ajh Jan Hidders,et al.  The formal model of a pattern browsing technique , 1995 .

[32]  Jan A. Bergstra,et al.  Graph isomorphism models for non interleaving process algebra , 1994 .

[33]  Jos C. M. Baeten,et al.  Delayed choice: an operator for joining Message Sequence Charts , 1994, FORTE.

[34]  van Km Kees Hee,et al.  Systems engineering : a formal approach. Part I. System concepts , 1993 .

[35]  Hardi Hungar,et al.  Statecharts: Using graphical specification languages and symbolic model checking in the verification of a production cell , 1995 .

[36]  Jan A. Bergstra,et al.  A Real Time Process Logic , 1994, ICTL.

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

[38]  Dieter Kratsch,et al.  Computing a Perfect Edge Without Vertex Elimination Ordering of a Chordal Bipartite Graph , 1995, Inf. Process. Lett..

[39]  Jozef Hooman,et al.  A Trace-Based Compositional Proof Theory for Fault Tolerant Distributed Systems , 1994, Theor. Comput. Sci..

[40]  A. van Deursen,et al.  Algebraic specification of a language for describing financial products , 1995 .

[41]  van Km Kees Hee,et al.  Systems engineering : a formal approach. Part V. Specification language , 1993 .

[42]  Orna Grumberg,et al.  Abstract interpretation of reactive systems : abstractions preserving .. , 1994 .

[43]  Rance Cleaveland,et al.  Testing-Based Abstractions for Value-Passing Systems , 1994, CONCUR.

[44]  Jan Korst,et al.  Deterministic and randomized local search , 1993 .

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

[46]  David Harel,et al.  Statecharts: A Visual Formalism for Complex Systems , 1987, Sci. Comput. Program..

[47]  B. Watson.  A taxonomy of finite automata minimization algorithms , 1993 .

[48]  Paula Severi,et al.  A Type Inference Algorithm for Pure Type Systems , 1995 .

[49]  Wan Fokkink,et al.  A conservative look at term deduction systems with variable binding , 1995 .

[50]  Fairouz Kamareddine,et al.  A Reflection on Russell's Ramified Types and Kripke's Hierarchy of Truths , 1996, Log. J. IGPL.

[51]  Dexter Kozen,et al.  RESULTS ON THE PROPOSITIONAL’p-CALCULUS , 2001 .

[52]  Olivier Coudert,et al.  Verifying Temporal Properties of Sequential Machines without Building Their State Diagrams , 1990, CAV.

[53]  van Hpj Rik Geldrop.  Deriving the Aho-Corasick algorithms : a case study into the synergy of programming methods , 1993 .