Multiparty Session Actors

Neykova, Rumyana; Yoshida, N.

doi:10.4204/eptcs.155.5

Cited by 17 publications

(27 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For example, runtime monitoring of Python extended to interrupts and actors are studied in [6] and [29], respectively. The above works use a protocol description language, Scribble [33], developed with Red Hat.…”

Section: Verification Of Concurrent Programs Based On Session Typesmentioning

confidence: 99%

Static deadlock detection for concurrent go by global session graph synthesis

Yoshida

2016

Proceedings of the 25th International Conference on Compiler Construction

Self Cite

View full text Add to dashboard Cite

Go is a programming language developed at Google, with channelbased concurrent features based on CSP. Go can detect global communication deadlocks at runtime when all threads of execution are blocked, but deadlocks in other paths of execution could be undetected. We present a new static analyser for concurrent Go code to find potential communication errors such as communication mismatch and deadlocks at compile time. Our tool extracts the communication operations as session types, which are then converted into Communicating Finite State Machines (CFSMs). Finally, we apply a recent theoretical result on choreography synthesis to generate a global graph representing the overall communication pattern of a concurrent program. If the synthesis is successful, then the program is free from communication errors.We have implemented the technique in a tool, and applied it to analyse common Go concurrency patterns and an open source application with over 700 lines of code.

show abstract

Section: Verification Of Concurrent Programs Based On Session Typesmentioning

confidence: 99%

Static deadlock detection for concurrent go by global session graph synthesis

Yoshida

2016

Proceedings of the 25th International Conference on Compiler Construction

Self Cite

View full text Add to dashboard Cite

show abstract

“…We are continuing the development of Scribble, its toolsuite and associated environments towards an integration into [44]. The theoretical framework developed in this article is extensible as a basis for other applications as demonstrated in our recent dynamic monitoring implementations for distributed actors [42] and timers [41]. For instance, the work in [41] extends run-time monitoring to real-time processes: monitors verify the punctuality of interactions against time constraints expressed as a timed extension of Scribble based on timed MPST [10].…”

Section: Discussionmentioning

confidence: 99%

Monitoring Networks through Multiparty Session Types

Bocchi

Chen

Demangeon

et al. 2013

Formal Techniques for Distributed Systems

Self Cite

View full text Add to dashboard Cite

In large-scale distributed infrastructures, applications are realised through communications among distributed components. The need for methods for assuring safe interactions in such environments is recognised, however the existing frameworks, relying on centralised verification or restricted specification methods, have limited applicability. This paper proposes a new theory of monitored π -calculus with dynamic usage of multiparty session types (MPST), offering a rigorous foundation for safety assurance of distributed components which asynchronously communicate through multiparty sessions. Our theory establishes a framework for semantically precise decentralised run-time enforcement and provides reasoning principles over monitored distributed applications, which complement existing static analysis techniques. We introduce asynchrony through the means of explicit routers and global queues, and propose novel equivalences between networks, that capture the notion of interface equivalence, i.e. equating networks offering the same services to a user. We illustrate our static-dynamic analysis system with an ATM protocol as a running example and justify our theory with results: satisfaction equivalence, local/global safety and transparency, and session fidelity.

show abstract

“…Many authors, such as [34,46,37], noted that the actor model does not address the issue of coordination. Coordination requires the possibility for an actor to have expectations on another actor's behavior, but the mere asynchronous message passing gives no means to foresee how a message receiver will behave.…”

Section: Meyer's Forces: Processor Action and Objectmentioning

confidence: 99%

“…For instance for what concerns the actor model. [37] proposes to use Scribble protocols and their relation to finite state machines for specification and runtime verification of actor interactions. Instead, in the case of service-oriented approaches, there are proposals of languages that allow capturing complex business processes as service compositions, either in the form of orchestrations (e.g.…”

Section: Meyer's Forces: Processor Action and Objectmentioning

confidence: 99%

Towards Data- and Norm-Aware Multiagent Systems

Baldoni

Baroglio

Calvanese

et al. 2016

Engineering Multi-Agent Systems

View full text Add to dashboard Cite

Abstract. We recall the key abstractions and models on which the major approaches to software specification rely, using Meyer's forces of computation as dimensions of comparison. Based on the identified strengths and lacks, we introduce data-awareness and of norm-awareness as recommended properties, explaining the advantages they bring about. We show that multiagent systems are a good candidate for the development of a data-and norm-aware programming, tracing directions for the realization of multiagent systems that are data and norm-aware. Finally, we report and comment some proposals from the multiagent systems literature that, though developed independently and not inserted in an organic framework, already face specific aspects that are relevant to bring about norm and data-awareness.

show abstract

Multiparty Session Actors

Cited by 17 publications

References 26 publications

Static deadlock detection for concurrent go by global session graph synthesis

Static deadlock detection for concurrent go by global session graph synthesis

Monitoring Networks through Multiparty Session Types

Towards Data- and Norm-Aware Multiagent Systems

Contact Info

Product

Resources

About