Deciding choreography realizability

DOI10.1145/2103656.2103680zbMath1321.68183OpenAlexW4239234361MaRDI QIDQ2942872

Samik Basu, Meriem Ouederni, Tevfik Bultan

Publication date: 11 September 2015

Published in: Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2103656.2103680

zbMATH Keywords

realizabilitychoreographymessage-based interactions

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (20)

Certifying choreography compilation ⋮ Applied Choreographies ⋮ Contracts as games on event structures ⋮ Relating two automata-based models of orchestration and choreography ⋮ Unnamed Item ⋮ Event-B-Supported Choreography-Defined Communicating Systems ⋮ Synchronizability for Verification of Asynchronously Communicating Systems ⋮ Multiparty testing preorders ⋮ A Normalized Form for FIFO Protocols Traces, Application to the Replay of Mode-based Protocols ⋮ Compliance in Behavioural Contracts: A Brief Survey ⋮ On deciding synchronizability for asynchronously communicating systems ⋮ Automatic analysis of complex interactions in microservice systems ⋮ Automated synthesis of application-layer connectors from automata-based specifications ⋮ A Theory of Formal Choreographic Languages ⋮ A predicate transformer for choreographies. Computing preconditions in choreographic programming ⋮ Choreographies, logically ⋮ An abstract framework for choreographic testing ⋮ A modular framework for verifying versatile distributed systems ⋮ Realizable temporal logics for web service choreography ⋮ Unnamed Item

Uses Software

• WSAT
• CADP

This page was built for publication: Deciding choreography realizability