Type Reconstruction Algorithms for Deadlock-Free and Lock-Free Linear π-Calculi

Padovani, Luca; Chen, Tzu‐Chun; Tosatto, Andrea

doi:10.1007/978-3-319-19282-6_6

Cited by 4 publications

(3 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…First, we use two slots for representing the absence or presence of a certain I/O capability, instead of just one slot that contains either one or the other. This representation, which is also convenient in type reconstruction algorithms for the π-calculus [19,26,27], allows us to dualize a channel type by just swapping the content of the two slots. Second, we use types to represent capabilities so that type variables can stand for unknown capabilities.…”

Section: Typesmentioning

confidence: 99%

A simple library implementation of binary sessions

Padovani¹

2016

J. Funct. Prog.

Self Cite

View full text Add to dashboard Cite

Inspired by the continuation-passing encoding of binary sessions, we describe a simple approach to embed a hybrid form of session type checking into any programming language that supports parametric polymorphism. The approach combines static protocol analysis with dynamic linearity checks. To demonstrate the effectiveness of the technique, we implement a well-integrated OCaml module for session communications. For free, OCaml provides us with equirecursive session types, parametric behavioural polymorphism, complete session type inference, and session subtyping.

show abstract

Section: Typesmentioning

confidence: 99%

A simple library implementation of binary sessions

Padovani¹

2016

J. Funct. Prog.

Self Cite

View full text Add to dashboard Cite

show abstract

“…This can also improve the accuracy of the type system in some cases, as discussed in [11]. Finally, type reconstruction algorithms for related and similar type systems have been studied and implemented [12,13]. We are confident to say that they scale to type systems with arrow types and effects.…”

Section: Discussionmentioning

confidence: 98%

Types for Deadlock-Free Higher-Order Programs

Padovani

Novara

2015

Formal Techniques for Distributed Objects, Components, and Systems

Self Cite

View full text Add to dashboard Cite

Abstract. Type systems for communicating processes are typically studied using abstract models -e.g., process algebras -that distill the communication behavior of programs but overlook their structure in terms of functions, methods, objects, modules. It is not always obvious how to apply these type systems to structured programming languages. In this work we port a recently developed type system that ensures deadlock freedom in the π-calculus to a higher-order language.

show abstract

“…The reconstruction described in this article is only the first step for more advanced forms of analysis, such as those for reasoning on deadlocks and locks [19]. We have extended the tool in such a way that subsequent analyses can be plugged on top of the reconstruction algorithm for linear channels [21].…”

Section: Discussionmentioning

confidence: 99%

Type Reconstruction for the Linear \pi-Calculus with Composite Regular Types

Padovani¹

2015

Logical Methods in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. We extend the linear π-calculus with composite regular types in such a way that data containing linear values can be shared among several processes, if there is no overlapping access to such values. We describe a type reconstruction algorithm for the extended type system and discuss some practical aspects of its implementation. IntroductionThe linear π-calculus [15] is a formal model of communicating processes that distinguishes between unlimited and linear channels. Unlimited channels can be used without restrictions, whereas linear channels can be used for one communication only. Despite this seemingly severe restriction, there is evidence that a significant portion of communications in actual systems take place on linear channels [15]. It has also been shown that structured communications can be encoded using linear channels and a continuation-passing style [13,3]. The interest in linear channels has solid motivations: linear channels are efficient to implement, they enable important optimizations [9,8,15], and communications on linear channels enjoy important properties such as interference freedom and partial confluence [18,15]. It follows that understanding whether a channel is used linearly or not has a primary impact in the analysis of systems of communicating processes.Type reconstruction is the problem of inferring the type of entities used in an unannotated (i.e., untyped) program. In the case of the linear π-calculus, the problem translates into understanding whether a channel is linear or unlimited, and determining the type of messages sent over the channel. This problem has been addressed and solved in [10]. This work has been supported by ICT COST Action IC1201 BETTY, MIUR project CINA, Ateneo/CSP project SALT, and the bilateral project RS13MO12 DART. π-calculus extended with pairs, disjoint sums, and possibly infinite types. These features, albeit standard, gain relevance and combine in non-trivial ways with the features of the linear π-calculus. We explain why this is the case in the rest of this section.The term belowmodels a program made of a persistent service (the *-prefixed process waiting for messages on channel succ) that computes the successor of a number and a client (the new-scoped process) that invokes the service and prints the result of the invocation. Each message sent to the service is a pair made of the number x and a continuation channel y on which the service sends the result of the computation back to the client. There are three channels in this program, succ for invoking the service, print for printing numbers, and a private channel a which is used by the client for receiving the result of the invocation. In the linear π-calculus, types keep track of how each occurrence of a channel is being used. For example, the above program is well typed in the environmentwhere the type of print indicates not only the type of messages sent over the channel (int in this case), but also that print is never used for input operations (the 0 annotation) and is used once for one outpu...

show abstract

Type Reconstruction Algorithms for Deadlock-Free and Lock-Free Linear π-Calculi

Cited by 4 publications

References 22 publications

A simple library implementation of binary sessions

A simple library implementation of binary sessions

Types for Deadlock-Free Higher-Order Programs

Type Reconstruction for the Linear \pi-Calculus with Composite Regular Types

Contact Info

Product

Resources

About