Proof-Carrying Code in a Session-Typed Process Calculus

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

doi:10.1007/978-3-642-25379-9_4

Cited by 26 publications

(24 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…rule (T∃L)) implies inputing a type and then using the session as A, agnostic to what the actual received type can be. Note that in the presence of polymorphism the identity rule (Tid) (not present in [6,7], but used in [26,21,20]) is necessary, since it is the only way of typing a session with a type variable.…”

Section: Fig 1 π-Calculus Labeled Transition Systemmentioning

confidence: 99%

“…In the remainder of this introduction, we briefly describe the logical interpretation of [6] and illustrate the potential of our model of polymorphic sessions with an example. Our ongoing research program on logical foundations for session-based concurrency [6,26,21,7,20,8] builds upon an interpretation of intuitionistic linear logical propositions as session types, sequent proofs as π-calculus processes [25], and cut elimination as process communication. In the resulting Curry-Howard correspondence, well-typed processes enjoy strong forms of type preservation and global progress [6,7], and are strongly normalizing [20].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Behavioral Polymorphism and Parametricity in Session-Based Communication

Caires

Pérez

Pfenning

et al. 2013

Lecture Notes in Computer Science

Self Cite

107

View full text Add to dashboard Cite

Abstract. We investigate a notion of behavioral genericity in the context of session type disciplines. To this end, we develop a logically motivated theory of parametric polymorphism, reminiscent of the Girard-Reynolds polymorphic λ-calculus, but casted in the setting of concurrent processes. In our theory, polymorphism accounts for the exchange of abstract communication protocols and dynamic instantiation of heterogeneous interfaces, as opposed to the exchange of data types and dynamic instantiation of individual message types. Our polymorphic session-typed process language satisfies strong forms of type preservation and global progress, is strongly normalizing, and enjoys a relational parametricity principle. Combined, our results confer strong correctness guarantees for communicating systems. In particular, parametricity is key to derive non-trivial results about internal protocol independence, a concurrent analogous of representation independence, and non-interference properties of modular, distributed systems.

show abstract

Section: Fig 1 π-Calculus Labeled Transition Systemmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Behavioral Polymorphism and Parametricity in Session-Based Communication

Caires

Pérez

Pfenning

et al. 2013

Lecture Notes in Computer Science

Self Cite

107

View full text Add to dashboard Cite

show abstract

“…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 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 1 more Smart Citation

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

Relating Process Languages for Security and Communication Correctness (Extended Abstract)

Nantes

Pérez

2018

Formal Techniques for Distributed Objects, Components, and Systems

View full text Add to dashboard Cite

Abstract. Process calculi are expressive specification languages for concurrency. They have been very successful in two research strands: (a) the analysis of security protocols and (b) the enforcement of correct messagepassing programs. Despite their shared foundations, languages and reasoning techniques for (a) and (b) have been separately developed. Here we connect two representative calculi from (a) and (b): we encode a (high-level) π-calculus for multiparty sessions into a (low-level) applied π-calculus for security protocols. We establish the correctness of our encoding, and we show how it enables the integrated analysis of security properties and communication correctness by re-using existing tools.

show abstract

Proof-Carrying Code in a Session-Typed Process Calculus

Cited by 26 publications

References 20 publications

Behavioral Polymorphism and Parametricity in Session-Based Communication

Behavioral Polymorphism and Parametricity in Session-Based Communication

Certifying Data in Multiparty Session Types

Relating Process Languages for Security and Communication Correctness (Extended Abstract)

Contact Info

Product

Resources

About