The B-book: assigning programs to meanings
The B-book: assigning programs to meanings
Patterns in property specifications for finite-state verification
Proceedings of the 21st international conference on Software engineering
Extending JML Specifications with Temporal Logic
AMAST '02 Proceedings of the 9th International Conference on Algebraic Methodology and Software Technology
A Temporal Logic Approach to the Specification of Reconfigurable Component-Based Systems
Proceedings of the 17th IEEE international conference on Automated software engineering
Software—Practice & Experience
Using Types to Enforce Architectural Structure
WICSA '08 Proceedings of the Seventh Working IEEE/IFIP Conference on Software Architecture (WICSA 2008)
A temporal graph logic for verification of graph transformation systems
WADT'06 Proceedings of the 18th international conference on Recent trends in algebraic development techniques
From runtime verification to evolvable systems
RV'07 Proceedings of the 7th international conference on Runtime verification
Achieving distributed control through model checking
CAV'10 Proceedings of the 22nd international conference on Computer Aided Verification
Reliable dynamic reconfigurations in a reflective component model
CBSE'10 Proceedings of the 13th international conference on Component-Based Software Engineering
Using temporal logic for dynamic reconfigurations of components
FACS'10 Proceedings of the 7th international conference on Formal Aspects of Component Software
Automating the reconfiguration for self-adaptable software
Proceedings of the 17th international doctoral symposium on Components and Architecture
A declarative approach for software compositional reconfiguration
Proceedings of the 11th International Workshop on Adaptive and Reflective Middleware
| Hi-index | 0.00 |
This paper deals with the formal specification and verification of dynamic reconfigurations of component-based systems. To validate such complex systems, there is a need to check model consistency and also to ensure that dynamic reconfigurations satisfy architectural and integrity constraints, invariants, and also temporal constraints over (re)configuration sequences. As architectural constraints involve first-order formulae, and a behavioural semantics of reconfigurations gives rise to infinite state systems, we propose to associate proof and model-checking within the well-established B method, to support the modelling of such systems and the (partial-)validation of their dynamic reconfigurations. The objective of the paper is twofold. First, given a hierarchical B model of component-based architectures, we validate it by proving its consistency. Second, given linear temporal logic formulae expressing the desirable dynamic behaviour of the system, we validate reconfigurable system architectures by using bounded model-checking tools supporting the B method. The main contributions are illustrated on the example of a HTTP server architecture.