Refinement and Verification of Synchronized Component-Based Systems

This article deals with specification, refinement and verification approaches for systems designed with synchronized components. First of all, we define a synchronized composition of components. Transition systems are used to specify or/and to model synchronized component-based systems. Second, we give refinement semantics for these component-based systems before proposing a method to verify the refinement of a whole system from the weak refinement of its components. We also present SynCo: a tool we are implementing using our method. Third, a compositional way to verify safety properties is proposed: the unreachability of a (set of) state(s) can be efficiently ensured for a synchronized component-based system.

[1]  Françoise Bellegarde,et al.  Reformulation: A Way to Combine Dynamic Properties and B Refinement , 2001, FME.

[2]  Steve A. Schneider,et al.  Test Case Preparation Using a Prototype , 1998, B.

[3]  Jacques Julliand,et al.  Modular Verification of Dynamic Properties for Reactive Systems , 1999, IFM.

[4]  Frank Waters,et al.  The B Book , 1971 .

[5]  Henny B. Sipma,et al.  STeP: The Stanford Temporal Prover (Educational Release) User''s Manual , 1995 .

[6]  Kim G. Larsen,et al.  Verification of Large State/Event Systems Using Compositionality and Dependency Analysis , 1998, Formal Methods Syst. Des..

[7]  Kaisa Sere,et al.  Program Development by Refinement: Case Studies Using The B Method , 1998 .

[8]  Patrick Behm,et al.  MÉTÉOR : An Industrial Success in Formal Development , 1998, B.

[9]  Kaisa Sere,et al.  Program Development by Refinement , 1999, Formal Approaches to Computing and Information Technology FACIT.

[10]  Steve A. Schneider,et al.  Communicating B Machines , 2002, ZB.

[11]  Michael J. Butler csp2B: A Practical Approach to Combining CSP and B , 1999, World Congress on Formal Methods.

[12]  Françoise Bellegarde,et al.  Synchronized Parallel Composition of Event Systems in B , 2002, ZB.

[13]  Steve A. Schneider,et al.  Using a Process Algebra to Control B Operations , 1999, IFM.

[14]  Jacques Julliand,et al.  Refinement Preserves PLTL Properties , 2003, ZB.

[15]  Jean-Raymond Abrial,et al.  Introducing Dynamic Constraints in B , 1998, B.

[16]  Leslie Lamport,et al.  Specifying Concurrent Systems with TLA , 1999 .

[17]  Edward Y. Chang,et al.  STeP: The Stanford Temporal Prover , 1995, TAPSOFT.

[18]  Françoise Bellegarde,et al.  Reformulate Dynamic Properties during B Refinement and Forget Variants and Loop Invariants , 2000, ZB.

[19]  Marie-Laure Potet,et al.  Automatic Construction of Validated B Components from Structured Developments , 2000, ZB.

[20]  Jacques Julliand,et al.  De l'expression des besoins à l'expression formelle des propriétés dynamiques , 1999 .

[21]  Françoise Bellegarde,et al.  Ready-Simulation Is Not Ready to Express a Modular Refinement Relation , 2000, FASE.

[22]  Jacques Julliand,et al.  Modular Verification for a Class of PLTL Properties , 2000, IFM.