Open AccessBook Chapter10.1007/978-3-540-88194-0_9

Decomposition for Compositional Verification

- 27 Oct 2008

- pp 105-125

TL;DR: This paper shows how to decomposea specification into components when either no such decomposition is given, or when the given composition does not lend itself to an efficient compositional verification.

Abstract: Compositional verification is based on the idea that the correctness check of a complex system can be divided into smaller verification tasks for its components. In this paper, we show how to decomposea specification into components when either no such decomposition is given, or when the given composition does not lend itself to an efficient compositional verification. Our decomposition is the starting point for an application of the L*learning algorithm, generating assumptions for an assume-guarantee reasoning. We prove correctness of the decomposition as well as present experimental results using the model checker FDR2 as the teacher during learning.

AI Agents for this Paper

Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps

Most frequently asked questions

1. What contributions have the authors mentioned in the paper "Decomposition for compositional verification" ?

In addition, the authors introduce several techniques and algorithms to restore the specification ’ s original control flow and its data flow.. Overall, their approach facilitates a general application of compositional reasoning, as it does not rely on systems composed of several components.. Here, the authors use two proof rules, which are shown to be valid in their semantic domain.. Along with this, the authors provide several case studies and experimental results.

Table 4.2: Comparison of two traces for Increaser and its components

Figure 5.10: Illustration of Definition 5.3.2 and Lemmas 5.3.3, 5.3.4

Figure 3.3: Circular assume-guarantee rule (C-AGR)

Figure 3.4: Illustration of the L∗ algorithm

Figure 4.2: Illustration of Definition 4.2.1

Figure 4.22: Addressing extension for nested branching

Citations

•Journal Article

On the completeness of compositional reasoning

Kedar S. Namjoshi, +1 more

- 01 Jan 2000

- Lecture Notes in Computer Science

TL;DR: A new sound and complete circular rule is presented and it is shown that circular and non-circular rules are closely related.

...read moreread less

AVACS -- Automatic Verification and Analysis of Complex Systems.

Bernd Becker

- 01 Jan 2007

TL;DR: This paper compares several conflict analysis heuristics to answer the question whether HySAT’s conflict analysis scheme, an adapted first unique implication point technique as applied in most modern SAT solvers, performs favorably compared to other schemes.

...read moreread less

Book Chapter•10.1007/978-3-642-16265-7_11

Verification architectures: compositional reasoning for real-time systems

Johannes Faber

- 11 Oct 2010

TL;DR: A conceptual approach to decompose real-time systems, specified by integrated formalisms: instead of showing safety of a system directly, one proves that it is an instance of a Verification Architecture, a safe behavioural protocol with unknowns and local real- time assumptions.

...read moreread less

•Dissertation

Una contribución a las técnicas avanzadas de verificación de procesos de negocio y sistemas software abiertos

Luis Eduardo Mendoza Morales

- 10 Nov 2011

TL;DR: In this article, a tesis doctoral for the verificación formal de business process models is presented, in which the authors present a model-based approach for the verification of business process modelling notation.

...read moreread less

•Journal Article

Syspect:Modelling, specifying, and verifying real-time systems with rich data.

Johannes Faber, +3 more

- 01 Jan 2011

- International Journal of Software and In...

TL;DR: The graphical tool Syspect is introduced for modelling, specifying, and automatically verifying reactive systems with continuous real-time constraints and complex, possibly infinite data.

...read moreread less

References

•Journal Article•10.1145/357980.358021

Communicating sequential processes

C. A. R. Hoare

- 01 Aug 1978

- Communications of The ACM

TL;DR: It is suggested that input and output are basic primitives of programming and that parallel composition of communicating sequential processes is a fundamental program structuring method.

...read moreread less

13K

•Book

Concurrency Control and Recovery in Database Systems

Philip A. Bernstein, +2 more

- 01 Feb 1987

TL;DR: In this article, the design and implementation of concurrency control and recovery mechanisms for transaction management in centralized and distributed database systems is described. But this can lead to interference between queries and updates.

...read moreread less

4.2K

Journal Article•10.1145/5397.5399

Automatic verification of finite-state concurrent systems using temporal logic specifications

Edmund M. Clarke, +2 more

- 01 Apr 1986

- ACM Transactions on Programming Language...

TL;DR: It is argued that this technique can provide a practical alternative to manual proof construction or use of a mechanical theorem prover for verifying many finite-state concurrent systems.

...read moreread less

3.8K

•Journal Article•10.1016/0890-5401(87)90052-6

Learning regular sets from queries and counterexamples

Dana Angluin

- 01 Nov 1987

- Information & Computation

TL;DR: In this article, the problem of identifying an unknown regular set from examples of its members and nonmembers is addressed, where the regular set is presented by a minimaMy adequate teacher, which can answer membership queries about the set and can also test a conjecture and indicate whether it is equal to the unknown set and provide a counterexample if not.

...read moreread less

2.4K

A Survey of Program Slicing Techniques.

Frank Tip

- 31 Jul 1994

TL;DR: An overview of the applications of program slicing, which include debugging, program integration, dataflow testing, and software maintenance is presented, including the various general approaches used to compute slices.

...read moreread less

1.7K

...

Expand

Decomposition for Compositional Verification

Chat with Paper

AI Agents for this Paper

Most frequently asked questions

1. What contributions have the authors mentioned in the paper "Decomposition for compositional verification" ?

Figures

Citations

On the completeness of compositional reasoning

AVACS -- Automatic Verification and Analysis of Complex Systems.

Verification architectures: compositional reasoning for real-time systems

Una contribución a las técnicas avanzadas de verificación de procesos de negocio y sistemas software abiertos

Syspect:Modelling, specifying, and verifying real-time systems with rich data.

References

Communicating sequential processes

Concurrency Control and Recovery in Database Systems

Automatic verification of finite-state concurrent systems using temporal logic specifications

Learning regular sets from queries and counterexamples

A Survey of Program Slicing Techniques.

Related Papers (5)

Compositional Verification of Reactive and Real-time Systems

Interpolation Guided Compositional Verification (T)

Compositional verification of real-time systems

Compositional Model Checking of Concurrent Systems

Verification architectures: compositional reasoning for real-time systems