Hierarchical correctness proofs for distributed algorithms
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
The use of static constructs in a modal process logic
Logic at Botik'89 Symposium on logical foundations of computer science
Using I/O automata for developing distributed systems
Foundations of component-based systems
Communication and Concurrency
Interface Theories for Component-Based Design
EMSOFT '01 Proceedings of the First International Workshop on Embedded Software
Analysis of interacting BPEL web services
Proceedings of the 13th international conference on World Wide Web
Web Service Composition Approaches: From Industrial Standards to Formal Methods
ICIW '07 Proceedings of the Second International Conference on Internet and Web Applications and Services
MTSA: Eclipse support for modal transition systems construction, analysis and elaboration
Proceedings of the 2007 OOPSLA workshop on eclipse technology eXchange
Spin model checker, the: primer and reference manual
Spin model checker, the: primer and reference manual
Modelling the CoCoME with the Java/A Component Model
The Common Component Modeling Example
Interface theories with component reuse
EMSOFT '08 Proceedings of the 8th ACM international conference on Embedded software
A Sound Observational Semantics for Modal Transition Systems
ICTAC '09 Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing
Modal interfaces: unifying interface automata and modal specifications
EMSOFT '09 Proceedings of the seventh ACM international conference on Embedded software
MTSA: The Modal Transition System Analyser
ASE '08 Proceedings of the 2008 23rd IEEE/ACM International Conference on Automated Software Engineering
Why Are Modalities Good for Interface Theories?
ACSD '09 Proceedings of the 2009 Ninth International Conference on Application of Concurrency to System Design
Modal I/O automata for interface and product line theories
ESOP'07 Proceedings of the 16th European conference on Programming
A theory for strong service compliance
COORDINATION'07 Proceedings of the 9th international conference on Coordination models and languages
A model checking approach for verifying COWS specifications
FASE'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Fundamental approaches to software engineering
Analyzing interacting BPEL processes
BPM'06 Proceedings of the 4th international conference on Business Process Management
Ticc: a tool for interface compatibility and composition
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
On weak modal compatibility, refinement, and the MIO workbench
TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems
On modal refinement and consistency
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
| Hi-index | 0.00 |
Service oriented computing is an accepted architectural style for developing large, distributed software systems. A particular promise of such architectures is service orchestration, i.e. the ability to combine existing services to create more complex functionality, thereby yielding new services. In this paper, we discuss application-level protocol compliance checking of service orchestrations and service protocols using the semantic domain of modal input/output automata (MIOs). Based on a practical example, we motivate and introduce new notions of refinement and compatibility, and prove that they constitute a valid interface theory. With this domain-specific interface theory, we provide a framework for application-level analysis of service orchestrations, thus complementing existing work on compatibility analysis. Our theory is tool-supported through the MIO Workbench, a verification tool for modal input/output automata.