REFINER: Towards Formal Verification of Model Transformations

We present the Refiner tool, which offers techniques to define behavioural transformations applicable on formal models of concurrent systems, reason about semantics preservation and the preservation of safety and liveness properties of such transformations, and apply them on models. Behavioural transformations allow to change the potential behaviour of systems. This is useful for model-driven development approaches, where systems are designed and created by first developing an abstract model, and iteratively refining this model until it is concrete enough to automatically generate source code from it. Properties that hold on the initial model and should remain valid throughout the development in later models can be maintained, by which the effort of verifying those properties over and over again is avoided. The tool integrates with the existing model checking toolsets mCRL2 and Cadp, resulting in a complete model checking approach for model-driven system development.

[1]  Markus Roggenbach,et al.  Property Preserving Refinement for Csp-Casl , 2009, WADT.

[2]  Martin Wirsing,et al.  Extraction of Structured Programs from Specification Proofs , 1999, WADT.

[3]  Anton Wijs,et al.  Incremental formal verification for model refining , 2012, MoDeVVa '12.

[4]  Andreas Podelski,et al.  ACSAR: Software Model Checking with Transfinite Refinement , 2007, SPIN.

[5]  Anton Wijs,et al.  What to do next? Analysing and optimising system behaviour in time , 2007 .

[6]  Rob J. van Glabbeek,et al.  Branching time and abstraction in bisimulation semantics , 1996, JACM.

[7]  Anton Wijs,et al.  Define, Verify, Refine: Correct Composition and Transformation of Concurrent System Semantics , 2013, FACS.

[8]  Reiko Heckel,et al.  Graph Transformation in a Nutshell , 2006, FoVMT.

[9]  Rajeev Alur,et al.  A Temporal Logic of Nested Calls and Returns , 2004, TACAS.

[10]  Erik P. de Vink,et al.  An Overview of the mCRL2 Toolset and Its Recent Advances , 2013, TACAS.

[11]  Thai Son Hoang,et al.  Rodin: an open toolset for modelling and reasoning in Event-B , 2010, International Journal on Software Tools for Technology Transfer.

[12]  Anton Wijs,et al.  Property-Dependent Reductions for the Modal Mu-Calculus , 2011, SPIN.

[13]  Gwen Salaün,et al.  CADP: A Toolbox for the Construction and Analysis of Distributed Processes , 2012, FM 2012.

[14]  Jirí Srba,et al.  Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets , 2008, FORMATS.

[15]  Anton Wijs,et al.  Efficient Property Preservation Checking of Model Refinements , 2013, TACAS.

[16]  Wan Fokkink,et al.  Is Timed Branching Bisimilarity an Equivalence Indeed? , 2005, FORMATS.

[17]  Radu Mateescu,et al.  CADP 2010: A Toolbox for the Construction and Analysis of Distributed Processes , 2011, TACAS.

[18]  Frédéric Lang,et al.  Exp.Open 2.0: A Flexible Tool Integrating Partial Order, Compositional, and On-The-Fly Verification Methods , 2005, IFM.