Conditional rewriting logic as a unified model of concurrency
Selected papers of the Second Workshop on Concurrency and compositionality
An Asynchronous Communication Model for Distributed Concurrent Objects
SEFM '04 Proceedings of the Software Engineering and Formal Methods, Second International Conference
Creol: a type-safe object-oriented model for distributed concurrent systems
Theoretical Computer Science - Components and objects
An Asynchronous Distributed Component Model and Its Semantics
Formal Methods for Components and Objects
Specification and Verification for Grid Component-Based Applications: From Models to Tools
Formal Methods for Components and Objects
Interactive Specification and Verification of Behavioural Adaptation Contracts
QSIC '09 Proceedings of the 2009 Ninth International Conference on Quality Software
Isabelle/HOL: a proof assistant for higher-order logic
Isabelle/HOL: a proof assistant for higher-order logic
Service oriented architectural design
TGC'07 Proceedings of the 3rd conference on Trustworthy global computing
Asynchronous Components with Futures: Semantics and Proofs in Isabelle/HOL
Electronic Notes in Theoretical Computer Science (ENTCS)
Synchronizing behavioural mismatch in software composition
FMOODS'06 Proceedings of the 8th IFIP WG 6.1 international conference on Formal Methods for Open Object-Based Distributed Systems
First class futures: specification and implementation of update strategies
Euro-Par 2010 Proceedings of the 2010 conference on Parallel processing
| Hi-index | 0.00 |
The main characteristics of component models is their strict structure enabling better code reuse. Correctness of component composition is well understood formally but existing works do not allow for mechanised reasoning on composition and component reconfigurations, whereas a mechanical support would improve the confidence in the existing results. This article presents the formalisation in Isabelle/HOL of a component model, focusing on the structure and on basic lemmas to handle component structure. Our objective in this paper is to present the basic constructs, and the corresponding lemmas allowing the proof of properties related to structure of component models and the handling of structure at runtime. We illustrate the expressiveness of our approach by presenting component semantics, and properties on reconfiguration primitives.