Compositional Abstraction Refinement for Component-Based Systems

The efficiency of the compositional verification of invariants depends on the abstraction, which may lead to verification incompleteness. The invariant strengthening and state partitioning techniques are proposed in this paper. The former could refine the overapproximation by removing the unreachable states, and the latter is a variant of counterexample-guided abstraction refinement. Integrated with these two refinement techniques, a unified compositional verification framework is presented to strengthen the abstraction and find counterexamples. Some examples are included to show that the verification of the safety properties in component-based systems has been achieved by our framework.

[1]  Thomas A. Henzinger,et al.  Thread-Modular Abstraction Refinement , 2003, CAV.

[2]  Cormac Flanagan,et al.  Thread-Modular Model Checking , 2003, SPIN.

[3]  Amer Diwan,et al.  Converting Java classes to use generics , 2004, OOPSLA '04.

[4]  Andreas Podelski,et al.  Thread-Modular Counterexample-Guided Abstraction Refinement , 2010, SAS.

[5]  Yassine Lakhnech,et al.  Computing Abstractions of Infinite State Systems Compositionally and Automatically , 1998, CAV.

[6]  Yassine Lakhnech,et al.  InVeST: A Tool for the Verification of Invariants , 1998, CAV.

[7]  Kamel Barkaoui,et al.  A Polynomial-Time Graph Algorithm to Decide Liveness of Some Basic Classes of Bounded Petri Nets , 1992, Application and Theory of Petri Nets.

[8]  Amir Pnueli,et al.  Automatic Deductive Verification with Invisible Invariants , 2001, TACAS.

[9]  Joël Ouaknine,et al.  Automated Compositional Abstraction Refinement for Concurrent C Programs: A Two-Level Approach , 2003, SoftMC@CAV.

[10]  Hai Wan,et al.  Modeling and Verification of Component-Based Systems with Data Passing Using BIP , 2013, 2013 18th International Conference on Engineering of Complex Computer Systems.

[11]  Joseph Sifakis,et al.  Source-to-source architecture transformation for performance optimization in BIP , 2009, 2009 IEEE International Symposium on Industrial Embedded Systems.

[12]  Thomas A. Henzinger,et al.  Race checking by context inference , 2004, PLDI '04.

[13]  Yassine Lakhnech,et al.  Automatic Generation of Invariants , 1999, Formal Methods Syst. Des..

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

[15]  Joseph Sifakis,et al.  Compositional Verification for Component-Based Systems and Application , 2008, ATVA.

[16]  Amir Pnueli,et al.  Parameterized Verification with Automatically Computed Inductive Assertions , 2001, CAV.

[17]  Ashish Tiwari,et al.  A Technique for Invariant Generation , 2001, TACAS.

[18]  Alan Bundy,et al.  Constructing Induction Rules for Deductive Synthesis Proofs , 2006, CLASE.