Proceedings of the 8th European software engineering conference held jointly with 9th ACM SIGSOFT international symposium on Foundations of software engineering
Proceedings of the International Workshop on Automatic Verification Methods for Finite State Systems
Alternating Refinement Relations
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Operating Guidelines - an Automata-Theoretic Foundation for the Service-Oriented Architecture
QSIC '05 Proceedings of the Fifth International Conference on Quality Software
Modal Specifications for the Control Theory of Discrete Event Systems
Discrete Event Dynamic Systems
Interface theories with component reuse
EMSOFT '08 Proceedings of the 8th ACM international conference on Embedded software
Modal interfaces: unifying interface automata and modal specifications
EMSOFT '09 Proceedings of the seventh ACM international conference on Embedded software
Modal I/O automata for interface and product line theories
ESOP'07 Proceedings of the 16th European conference on Programming
Systems and Software Verification: Model-Checking Techniques and Tools
Systems and Software Verification: Model-Checking Techniques and Tools
On the expressiveness of refinement settings
FSEN'09 Proceedings of the Third IPM international conference on Fundamentals of Software Engineering
Compact Representations and Efficient Algorithms for Operating Guidelines
Fundamenta Informaticae - Application of Concurrency to System Design, the Eighth Special Issue
A Modal Interface Theory for Component-based Design
Fundamenta Informaticae - Application of Concurrency to System Design, the Eighth Special Issue
On modal refinement and consistency
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
A modal specification theory for components with data
Science of Computer Programming
| Hi-index | 0.00 |
This paper studies the independent implementability of reachability properties, which are in general not compositional. We consider modal specifications, which are widely acknowledged as suitable for abstracting implementation details of components while exposing to the environment relevant information about cross-component interactions. In order to obtain the required expressivity, we extend them with marked states to model states to be reached. We then develop an algebra with both logical and structural composition operators ensuring reachability properties by construction.