The Challenges of Building Advanced Mechatronic Systems
FOSE '07 2007 Future of Software Engineering
Verification and Synthesis of OCL Constraints Via Topology Analysis
Applications of Graph Transformations with Industrial Relevance
Modelling and verification of the LMAC protocol for wireless sensor networks
IFM'07 Proceedings of the 6th international conference on Integrated formal methods
Non-interference properties for data-type reduction of communicating systems
IFM'07 Proceedings of the 6th international conference on Integrated formal methods
Mind the shapes: abstraction refinement via topology invariants
ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
Explicit fair scheduling for dynamic control
Concurrency, Compositionality, and Correctness
TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Static analysis of dynamic communication systems by partner abstraction
SAS'07 Proceedings of the 14th international conference on Static Analysis
Hi-index | 0.00 |
Dynamic communication systems (DCS) are complex because of their unboundedness in several dimensions. They have an unbounded and changing number of objects, a dynamically changing communication topology and unbounded message queues for asynchronous communication. We present a specification language for DCS that captures these features but is still amenable for formal verification. The verification of relevant properties of DCS is demonstrated using a combination of model-checking and abstract interpretation. Our approach is illustrated using the application domain of car platoons.