scientific article

DOI10.23638/LMCS-13(2:1)2017zbMath1398.68088arXiv1611.09067MaRDI QIDQ2974797

Jacopo Mauro, Maurizio Gabbrielli, Mila Dalla Preda, Saverio Giallorenzo, Ivan Lanese

Publication date: 11 April 2017

Full work available at URL: https://arxiv.org/abs/1611.09067

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

choreographiesdeadlock freedomadaptable systems

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)

Related Items (12)

Certifying choreography compilation ⋮ Global Protocol Implementations via Attribute-Based Communication ⋮ From global choreographies to verifiable efficient distributed implementations ⋮ Functional choreographic programming ⋮ A formal theory of choreographic programming ⋮ A predicate transformer for choreographies. Computing preconditions in choreographic programming ⋮ The Paths to Choreography Extraction ⋮ Composition and decomposition of multiparty sessions ⋮ Most General Property-Preserving Updates ⋮ A core model for choreographic programming ⋮ Static and dynamic property-preserving updates ⋮ Unnamed Item

Uses Software

• Xtext
• AIOCJ
• Links

Cites Work

• Unnamed Item
• Unnamed Item
• DSOL: a declarative approach to self-adaptive service orchestrations
• Compositional Choreographies
• On Global Types and Multi-Party Session
• Deadlock-freedom-by-design
• Deciding choreography realizability
• Multiparty asynchronous session types
• Placement Inference for a Client-Server Calculus
• Structured Interactional Exceptions in Session Types
• From sequential programs to multi-tier applications by program transformation
• Structured Communication-Centred Programming for Web Services

This page was built for publication: