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 unreachabl...

Full description

Saved in:
Bibliographic Details
Published inJournal of Applied Mathematics Vol. 2014; no. 2014; pp. 1 - 12
Main Authors Zhang, Lianyi, Meng, Qingdi, Lo, Kueiming
Format Journal Article
LanguageEnglish
Published Cairo, Egypt Hindawi Limiteds 01.01.2014
Hindawi Puplishing Corporation
Hindawi Publishing Corporation
Hindawi Limited
Wiley
Subjects
Algorithms
Computational efficiency
Computing time
Invariants
Mathematical analysis
Mathematical research
Partitioning
Safety
Strengthening
Online AccessGet full text

Cover

More Information
Summary: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.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:1110-757X
1687-0042
DOI:10.1155/2014/703098