连接器符合编排
Connectors meet Choreographies
摘要:
我们提出了Cho-Reo-graphics(CR),一个新的语言模型,统一了两个强大的编程范式的并发软件的基础上通信过程:Choreographic编程和外生协调。在CR中,程序员使用编排来指定进程之间所需的通信,并定义通信应该如何通过作为约束自动机给出的连接器来具体地动画化(例如,同步屏障和异步多播)。CR是第一个可以自由混合不同通信语义(由连接器确定)的编排演算;由于连接器是用户定义的,CR还支持许多以前无法用于编排的通信语义。我们开发了一个静态分析,保证在CR的编排和用户定义的连接器是兼容的,定义一个编译器从编排到基于连接器的进程演算,并证明了兼容性保证死锁自由的编译过程实现。
英文摘要:
We present Cho-Reo-graphies (CR), a new language model that unites two powerful programming paradigms for concurrent software based on communicating processes: Choreographic Programming and Exogenous Coordination. In CR, programmers specify the desired communications among processes using a choreography, and define how communications should be concretely animated by connectors given as constraint automata (e.g., synchronous barriers and asynchronous multi-casts). CR is the first choreography calculus where different communication semantics (determined by connectors) can be freely mixed; since connectors are user-defined, CR also supports many communication semantics that were previously unavailable for choreographies. We develop a static analysis that guarantees that a choreography in CR and its user-defined connectors are compatible, define a compiler from choreographies to a process calculus based on connectors, and prove that compatibility guarantees deadlock-freedom of the compiled process implementations.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。