Automatic Protocol Conformance Checking of Recursive and Parallel Component-Based Systems
CBSE '08 Proceedings of the 11th International Symposium on Component-Based Software Engineering
SC'08 Proceedings of the 7th international conference on Software composition
Model Checking of Component Protocol Conformance -- Optimizations by Reducing False Negatives
Electronic Notes in Theoretical Computer Science (ENTCS)
Automatic checking of component protocols in component-based systems
SC'06 Proceedings of the 5th international conference on Software Composition
Protocol conformance checking of services with exceptions
ESOCC'12 Proceedings of the First European conference on Service-Oriented and Cloud Computing
| Hi-index | 0.00 |
We show a technique for consistent dynamic exchange of different aspects of implementations of abstract data types, in particular data structure representations and algorithms. Previous work showed how one single aspects implementation can be exchanged dynamically without running into robustness problems if other aspects are guaranteed to be fixed. The present work generalizes this idea in the sense that all aspects' implementations may be exchanged arbitrarily at run time where robustness is preserved. We use finite state machines where each state represents a combination of the different implementations and each transition an exchange of exactly one aspects implementation.We use these state machines to check for the robustness of a class within a certain application context.We show a technique for consistent dynamic exchange of different aspects of implementations of abstract data types, in particular data structure representations and algorithms. Previous work showed how one single aspects implementation can be exchanged dynamically without running into robustness problems if other aspects are guaranteed to be fixed. The present work generalizes this idea in the sense that all aspects' implementations may be exchanged arbitrarily at run time where robustness is preserved. We use finite state machines where each state represents a combination of the different implementations and each transition an exchange of exactly one aspects implementation.We use these state machines to check for the robustness of a class within a certain application context.