Deciding choreography realizability

DOI10.1145/2103656.2103680MaRDI QIDQ2942872zbMATH OpenOpenAlexFDO

Authors Samik Basu, Tevfik Bultan, Meriem Ouederni

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

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

Recommendations

• Realisability of choreographies
• Choreographies, logically
• Choreographies, logically
• Towards refinable choreographies
• scientific article; zbMATH DE number 7454921
• scientific article; zbMATH DE number 7633801

Cited in

(32)

• From communicating machines to graphical choreographies
• Event-B-supported choreography-defined communicating systems
• Contracts as games on event structures
• Relating two automata-based models of orchestration and choreography
• A predicate transformer for choreographies. Computing preconditions in choreographic programming
• On deciding synchronizability for asynchronously communicating systems
• Certifying choreography compilation
• Automated synthesis of application-layer connectors from automata-based specifications
• Realizable causal-consistent reversible choreographies for systems with first-in-first-out communication channels
• A dynamic temporal logic for quality of service in choreographic models
• Counterexample guided synthesis of monitors for realizability enforcement
• Applied Choreographies
• Compliance in behavioural contracts: a brief survey
• Realisability of choreographies
• A normalized form for FIFO protocols traces, application to the replay of mode-based protocols
• Realizable temporal logics for web service choreography
• Realizability and dynamic reconfiguration of chor specifications
• Choreographies, logically
• Analyzing Chor specifications by translation into FSP
• Automatic analysis of complex interactions in microservice systems
• From global choreographies to verifiable efficient distributed implementations
• Resolving non-determinism in choreographies
• Synchronizability for Verification of Asynchronously Communicating Systems
• Conversation protocols: a formalism for specification and verification of reactive electronic services
• scientific article; zbMATH DE number 6703933 (Why is no real title available?)
• Multiparty testing preorders
• Conversation protocols: a formalism for specification and verification of reactive electronic services
• A modular framework for verifying versatile distributed systems
• An abstract framework for choreographic testing
• An abstract framework for choreographic testing
• Declarative choreographies and liveness
• A Theory of Formal Choreographic Languages

Describes a project that uses

Uses Software

• WSAT
• CADP

This page was built for publication: Deciding choreography realizability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2942872)