Communication and Concurrency
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Counterexample-Guided Abstraction Refinement
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Theoretical Computer Science - Implementation and application of automata
Realizability and verification of MSC graphs
Theoretical Computer Science - Automata, languages and programming
Synchronizability of Conversations among Web Services
IEEE Transactions on Software Engineering
Towards the theoretical foundation of choreography
Proceedings of the 16th international conference on World Wide Web
A Model Checking Language for Concurrent Value-Passing Systems
FM '08 Proceedings of the 15th international symposium on Formal Methods
Realizability of Choreographies Using Process Algebra Encodings
IFM '09 Proceedings of the 7th International Conference on Integrated Formal Methods
Analyzing singularity channel contracts
Proceedings of the eighteenth international symposium on Software testing and analysis
Structured communication-centred programming for web services
ESOP'07 Proceedings of the 16th European conference on Programming
Local enforceability in interaction Petri nets
BPM'07 Proceedings of the 5th international conference on Business process management
Realizability is controllability
WS-FM'09 Proceedings of the 6th international conference on Web services and formal methods
CADP 2010: a toolbox for the construction and analysis of distributed processes
TACAS'11/ETAPS'11 Proceedings of the 17th international conference on Tools and algorithms for the construction and analysis of systems: part of the joint European conferences on theory and practice of software
FASE'11/ETAPS'11 Proceedings of the 14th international conference on Fundamental approaches to software engineering: part of the joint European conferences on theory and practice of software
Deciding choreography realizability
POPL '12 Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Checking the realizability of BPMN 2.0 choreographies
Proceedings of the 27th Annual ACM Symposium on Applied Computing
VerChor: a framework for verifying choreographies
FASE'13 Proceedings of the 16th international conference on Fundamental Approaches to Software Engineering
Hi-index | 0.00 |
Many of today's software systems are built using distributed services, which evolve in different organizations. In order to facilitate their integration, it is necessary to provide a contract that the services participating in a composition should adhere to. A contract specifies interactions among a set of services from a global point of view. One important problem in a top-down development process is figuring out whether such a contract can be implemented by a set of services, obtained by projection and communicating via message passing. It was only recently shown, that this problem, known as realizability, is decidable if asynchronous communication (communication via FIFO buffers) is considered. It can be verified using the synchronizability property. If the system is not synchronizable, the system is not realizable either. In this paper, we propose a new, automatic approach, which enforces both synchronizability and realizability by generating local monitors through successive equivalence checks and refinement.