Dependent session types via intuitionistic linear type theory

Toninho, Bernardo; Caires, Luís; Pfenning, Frank

doi:10.1145/2003476.2003499

Cited by 65 publications

(86 citation statements)

References 35 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We motivate a technique to certify properties of exchanged data in multiparty session types (MPST) using a notion of value dependencies [17]. We begin with a brief introduction of the original MPST framework and its shortcomings with respect to expressing certain functional constraints on global protocols.…”

Section: Motivationmentioning

confidence: 99%

“…To overcome this issue, we propose the adoption of value dependent multiparty session types, which refine multiparty session types by adding type dependencies to specifications of exchanged data (extending the work of [12,17] for the binary setting).…”

Section: Multiparty Session Typesmentioning

confidence: 99%

“…While a wide range of works on binary and multiparty session types exist in the literature [3,4,9,10], the two that are most related to this work consist of the logically-motivated value dependent binary session types of [2,12,17] and the assertion-based extensions of multiparty session types [1].…”

Section: Related Workmentioning

confidence: 99%

“…The line of work of [17] is the main inspiration for our approach, which essentially extends their binary framework to the multiparty setting. The work of [12,17] takes the interpretation of intuitionistic linear logic as (binary) session typed processes and extends it with first-order quantification over exponential objects, which are the proof witnesses for the data-dependent properties expressed in session types.…”

Section: Related Workmentioning

confidence: 99%

“…The work of [12,17] takes the interpretation of intuitionistic linear logic as (binary) session typed processes and extends it with first-order quantification over exponential objects, which are the proof witnesses for the data-dependent properties expressed in session types. The key challenges that arise when moving to a multiparty setting consist in defining an adequate notion of projection that preserves the dependencies expressed in global types in a way that is locally consistent to all involved participants.…”

Section: Related Workmentioning

confidence: 99%

See 4 more Smart Citations

Certifying Data in Multiparty Session Types

Toninho¹,

Yoshida²

2016

A List of Successes That Can Change the World

Self Cite

View full text Add to dashboard Cite

Multiparty session types (MPST) are a typing discipline for ensuring the coordination of multi-agent communication in concurrent and distributed programs. The original MPST framework mainly focuses on the communication aspects of concurrency, unable to capture important data invariants in communicating programs. This work introduces value dependent types to the MPST framework in order to increase its expressiveness for certifying invariants of data exchanged among multiple participants. The key idea is to impose constraints on the exchanged data, which is explicitly witnessed at runtime by proof objects. The enriched MPST framework provides programmers with a precise global description of the interaction and data dependent patterns, from which local (data dependent) descriptions can be automatically generated for each endpoint, faithfully capturing at a local level the global data constraints. The framework ensures the absence of communication errors and guarantees communication progress in well-typed multiparty sessions. We also develop an extension of value dependencies based on proof irrelevance that enables the selective erasure of proof objects at runtime.

show abstract

Section: Motivationmentioning

confidence: 99%

Section: Multiparty Session Typesmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

See 3 more Smart Citations

Certifying Data in Multiparty Session Types

Toninho¹,

Yoshida²

2016

A List of Successes That Can Change the World

Self Cite

View full text Add to dashboard Cite

show abstract

Automated Modular Verification for Relaxed Communication Protocols

Costea

Chin

Qin

et al. 2018

Programming Languages and Systems

View full text Add to dashboard Cite

Ensuring software correctness and safety for communicationcentric programs is important but challenging. In this paper we introduce a solution for writing communication protocols, for checking protocol conformance and for verifying implementation safety. This work draws on ideas from both multiparty session types, which provide a concise way to express communication protocols, as well as from separationstyle logics for shared-memory concurrency, which provide strong safety guarantees for resource sharing. On the one hand, our proposal improves the expressiveness and precision of session types, without sacrificing their conciseness. On the other hand, it increases the applicability of software verification as well as its precision, by making it protocol aware. We also show how to perform the verification of such programs in a modular and automatic fashion. one of the communicating entities requires the re-validation of the entire system. Since validation might be expensive, or difficult to achieve if the source code of certain components is not available, it is desirable for the developer to be able to only validate her changes locally, rather than at the global level. Over the last decades, behavioral types [35,26] have been studied as specifications of the interactions in communicating systems. In particular, multiparty session types [23], or MPSTs, provide a user-friendly syntax for writing choreographic specifications of distributed systems, and a lightweight mechanism for enforcing communication safety. Communication is considered correct when the system's constituent processes are statically type-checked against the end-point projections of the MPST. This formalism and its numerous extensions are attractive in checking if the implementation follows the intended communication pattern, but it lacks the strong safety and correctness guarantees normally provided by the resource-aware verification systems. Specifically, the MPST approach checks if a transmission's exchanged type is the expected one. However, in their most common form, MPSTs are unable to assert something about the message's numerical properties, and even less so about its carried resources in the case of tightly coupled systems. All these, while numerical properties and resource sharing constitute the pièce de résistance for separation logic [38], a logic for reasoning about resource sharing. In this work, we attach a communication logic in the user-friendly style of MPST, to a separation logic for program verification. Even though we draw on ideas from MPST, the proposed logic differs from MPST in a number of features which yield a more expressive communication specification-without compromising its friendly syntax. The current proposal ultimately leads to stronger guarantees w.r.t. the safety and correctness of distributed system. We shall next highlight these differences. Writing Multiparty Communication Protocols. The language we propose for writing communication protocols is described in Fig. 1a. Similar to MPST, the language contains the te...

show abstract

A Pragmatic, Scalable Approach to Correct-by-Construction Process Composition Using Classical Linear Logic Inference

Papapanagiotou

Fleuriot

2019

Logic-Based Program Synthesis and Transformation

View full text Add to dashboard Cite

The need for rigorous process composition is encountered in many situations pertaining to the development and analysis of complex systems. We discuss the use of Classical Linear Logic (CLL) for correct-by-construction resource-based process composition, with guaranteed deadlock freedom, systematic resource accounting, and concurrent execution. We introduce algorithms to automate the necessary inference steps for binary compositions of processes in parallel, conditionally, and in sequence. We combine decision procedures and heuristics to achieve intuitive and practically useful compositions in an applied setting.

show abstract

Dependent session types via intuitionistic linear type theory

Cited by 65 publications

References 35 publications

Certifying Data in Multiparty Session Types

Certifying Data in Multiparty Session Types

Automated Modular Verification for Relaxed Communication Protocols

A Pragmatic, Scalable Approach to Correct-by-Construction Process Composition Using Classical Linear Logic Inference

Contact Info

Product

Resources

About