Compositional verification for component-based systems and application
The authors present a compositional method for the verification of component-based
systems described in a subset of the behaviour-interaction-priority language encompassing …
systems described in a subset of the behaviour-interaction-priority language encompassing …
Pomsets with preconditions: a simple model of relaxed memory
Relaxed memory models must simultaneously achieve efficient implementability and thread-
compositional reasoning. Is that why they have become so complicated? We argue that the …
compositional reasoning. Is that why they have become so complicated? We argue that the …
Formal verification of timed systems: A survey and perspective
F Wang - Proceedings of the IEEE, 2004 - ieeexplore.ieee.org
An overview of the current state of the art of formal verification of real-time systems is
presented. We discuss commonly accepted models, specification languages, verification …
presented. We discuss commonly accepted models, specification languages, verification …
Symbolic compositional verification by learning assumptions
R Alur, P Madhusudan, W Nam - International Conference on Computer …, 2005 - Springer
The verification problem for a system consisting of components can be decomposed into
simpler subproblems for the components using assume-guarantee reasoning. However …
simpler subproblems for the components using assume-guarantee reasoning. However …
D-finder: A tool for compositional deadlock detection and verification
D-Finder tool implements a compositional method for the verification of component-based
systems described in BIP language encompassing multi-party interaction. For deadlock …
systems described in BIP language encompassing multi-party interaction. For deadlock …
Assumptions and guarantees for compositional noninterference
The idea of building secure systems by plugging together" secure''components is appealing,
but this requires a definition of security which, in addition to taking care of top-level security …
but this requires a definition of security which, in addition to taking care of top-level security …
Thread-modular verification for shared-memory programs
Ensuring the reliability of multithreaded software systems is difficult due to the interaction
between threads. This paper describes the design and implementation of a static checker for …
between threads. This paper describes the design and implementation of a static checker for …
A program logic for concurrent objects under fair scheduling
Existing work on verifying concurrent objects is mostly concerned with safety only, eg, partial
correctness or linearizability. Although there has been recent work verifying lock-freedom of …
correctness or linearizability. Although there has been recent work verifying lock-freedom of …
A theory of synchronous relational interfaces
Compositional theories are crucial when designing large and complex systems from smaller
components. In this work we propose such a theory for synchronous concurrent systems …
components. In this work we propose such a theory for synchronous concurrent systems …
A compositional protocol verification using relativized bisimulation
KG Larsen, R Milner - Information and computation, 1992 - Elsevier
The purpose of this paper is to illustrate a compositional proof method for communicating
systems; that is, a method in which a property P of a complete system is demonstrated by …
systems; that is, a method in which a property P of a complete system is demonstrated by …