Termination in Impure Concurrent Languages

Demangeon, Romain; Hirschkoff, Daniel; Sangiorgi, Davide

doi:10.1007/978-3-642-15375-4_23

Cited by 20 publications

(37 citation statements)

References 8 publications

(9 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As a future work, we would like to continue the study of the introduced equivalence by investigating a labelled characterisation of barbed congruence and algebraic characterisations, or transferring type-based techniques from the π-calculus (e.g. to control termination, lock-freedom and deadlock [32,14,18,19]). Moreover, we would like to investigate other approaches to observational semantics such as may and must testing.…”

Section: Resultsmentioning

confidence: 99%

Playing with Bisimulation in Erlang

Lanese

Sangiorgi

Zavattaro

2019

Models, Languages, and Tools for Concurrent and Distributed Programming

Self Cite

View full text Add to dashboard Cite

Erlang is a functional and concurrent programming language. The aim of this paper is to investigate basic properties of the Erlang concurrency model, which is based on asynchronous communication through mailboxes accessed via pattern matching. To achieve this goal, we consider Core Erlang (which is an intermediate step in Erlang compilation) and we define, on top of its operational semantics, an observational semantics following the approach used to define asynchronous bisimulation for the π-calculus. Our work allows us to shed some light on the management of process identifiers in Erlang, different from the various forms of name mobility already studied in the literature. In fact, we need to modify standard definitions to cope with such specific features of Erlang.

show abstract

“…Interesting results have been obtained recently indicating that those techniques can be quite useful in the concurrent context too, thus being potentially interesting for CBUS. Results in this direction have been published in [34], [25], [35], [36], [55], [32], [29], [14], [15], [50] In [34], techniques ensuring termination combining tools coming from term rewriting with logical relations are introduced and exploited in the context of a π-calculus with functional and imperative names. Noticeably, the introduced technique allows to capture a large class of programs and processes.…”

Section: Resource Controlmentioning

confidence: 99%

Service-Oriented Computing

Yangui¹,

Rodriguez²,

Tari

2019

Lecture Notes in Computer Science

View full text Add to dashboard Cite

“…Techniques for ensuring termination, hence divergence freedom, for the π -calculus have been studied in, e.g., [6,27,32].…”

Section: E[ F ]mentioning

confidence: 99%

Eager Functions as Processes

Durier

Hirschkoff

Sangiorgi

2018

Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science

Self Cite

View full text Add to dashboard Cite

We study Milner's encoding of the call-by-value λ-calculus into the π-calculus. We show that, by tuning the encoding to two subcalculi of the π-calculus (Internal π and Asynchronous Local π), the equivalence on λ-terms induced by the encoding coincides with Lassen's eager normal-form bisimilarity, extended to handle η-equality. As behavioural equivalence in the π-calculus we consider contextual equivalence and barbed congruence. We also extend the results to preorders. A crucial technical ingredient in the proofs is the recently-introduced technique of unique solutions of equations, further developed in this paper. In this respect, the paper also intends to be an extended case study on the applicability and expressiveness of the technique.

show abstract

“…Another rather prolific research line is centered around linearity in the sense of Girard's linear logic [Girard 1987], and has been initiated by the seminal work of Kobayashi, Pierce and Turner [Kobayashi et al 1999]. This has been followed by many type systems, based or not on linearity, guaranteeing forms of deadlock-freedom [Kobayashi 2006;Padovani 2014], livelockfreedom [Kobayashi 2000], termination [Demangeon et al 2010b;Deng and Sangiorgi 2004], or combinations thereof. Again, none of them aim at the kind of completeness property we are interested at here.…”

Section: Introductionmentioning

confidence: 99%

“…It is thus hard to precisely contextualize this work, at least in the realm of concurrency theory. The comparison, e.g., with the work on termination [Demangeon et al 2010b;Deng and Sangiorgi 2004] is a good example: their typability implies strong normalization, while we characterize a weak form of normalization (plus error-freedom), but guaranteeing completeness, which in their work is by construction impossible.…”

Section: Introductionmentioning

confidence: 99%

Intersection types and runtime errors in the pi-calculus

Lago

Visme

Mazza

et al. 2019

Proc. ACM Program. Lang.

View full text Add to dashboard Cite

We introduce a type system for the π-calculus which is designed to guarantee that typable processes are well-behaved, namely they never produce a run-time error and, even if they may diverge, there is always a chance for them to łfinish their workž, i.e., to reduce to an idle process. The introduced type system is based on non-idempotent intersections, and is thus very powerful as for the class of processes it can capture. Indeed, despite the fact that the underlying property is Π 0 2-complete, there is a way to show that the system is complete, i.e., that any well-behaved process is typable, although for obvious reasons infinitely many derivations need to be considered.

show abstract

Termination in Impure Concurrent Languages

Cited by 20 publications

References 8 publications

Playing with Bisimulation in Erlang

Service-Oriented Computing

Eager Functions as Processes

Intersection types and runtime errors in the pi-calculus

Contact Info

Product

Resources

About