The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
Proceedings of the 8th European software engineering conference held jointly with 9th ACM SIGSOFT international symposium on Foundations of software engineering
Computer
Network Grammars, Communication Behaviors and Automatic Verification
Proceedings of the International Workshop on Automatic Verification Methods for Finite State Systems
Reo: a channel-based coordination model for component composition
Mathematical Structures in Computer Science
A Framework for Component-based Construction Extended Abstract
SEFM '05 Proceedings of the Third IEEE International Conference on Software Engineering and Formal Methods
Modeling Heterogeneous Real-time Components in BIP
SEFM '06 Proceedings of the Fourth IEEE International Conference on Software Engineering and Formal Methods
The algebra of connectors: structuring interaction in BIP
EMSOFT '07 Proceedings of the 7th ACM & IEEE international conference on Embedded software
Contract-Based Verification of Hierarchical Systems of Components
SEFM '08 Proceedings of the 2008 Sixth IEEE International Conference on Software Engineering and Formal Methods
Multiple Viewpoint Contract-Based Specification and Design
Formal Methods for Components and Objects
Runtime verification of component-based systems
SEFM'11 Proceedings of the 9th international conference on Software engineering and formal methods
| Hi-index | 0.00 |
Designing concurrent or distributed systems with complex architectures while preserving a set of high-level requirements through all design steps is not a trivial task. Building upon a generic notion of contract framework which relies on a component framework and two refinement relations: conformance and refinement under context, we provide a condition under which circular reasoning can be used for checking dominance, i.e. refinement between contracts. We then propose an instantiation of such a contract framework for safety and progress requirements in component systems with data exchange. This allows us to prove non-trivial properties of a protocol for tree-like networks.