Stateful Contracts for Affine Types

Tov, Jesse A.; Pucella, Riccardo

doi:10.1007/978-3-642-11957-6_29

Cited by 35 publications

(37 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Since OCaml's type system is not substructural we are unable to distinguish between linear and unlimited types and, in particular, we are unable to prevent multiple endpoint usages solely using the type system. Following ideas of Tov and Pucella [24] and Hu and Yoshida [11] and the design of FuSe [18], the idea is to associate each endpoint with a boolean flag indicating whether the endpoint can be safely used or not. The flag is initially set to true, indicating that the endpoint can be used, and is tested by every operation that uses the endpoint.…”

Section: Basic Setupmentioning

confidence: 99%

“…FuSe [18] is an OCaml implementation of binary sessions that combines static protocol enforcement with runtime checks for endpoint linearity [24,11] and resumption safety (Section 4.2). Support for sequential composition of session types based on resumptions was originally introduced in FuSe to describe iterative protocols, showing that a class of unbounded protocols could be described without resorting to (equi-)recursive types.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Context-Free Session Type Inference

Padovani

2017

Programming Languages and Systems

View full text Add to dashboard Cite

Abstract. Some interesting communication protocols can be precisely described only by context-free session types, an extension of conventional session types with a general form of sequential composition. The complex metatheory of context-free session types, however, hinders the definition of corresponding checking and inference algorithms. In this work we address and solve these problems introducing a new type system for context-free session types of which we provide two OCaml embeddings.

show abstract

Section: Basic Setupmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Context-Free Session Type Inference

Padovani

2017

Programming Languages and Systems

View full text Add to dashboard Cite

show abstract

“…In this sense, our contracts conform to the definition of "chaperone contracts" given by Strickland et al [2012], where chaperones are not allowed to affect the behavior of monitored objects. Tov and Pucella [2010] use stateful contracts for controlling the usage of affine functions (functions that can be applied at most once) when these flow into a region of the program that uses a conventional (i.e., non substructural) type system. Projections and Duality.…”

Section: Related Workmentioning

confidence: 99%

Chaperone contracts for higher-order sessions

Melgratti

Padovani

2017

Proc. ACM Program. Lang.

View full text Add to dashboard Cite

Contracts have proved to be an effective mechanism that helps developers in identifying those modules of a program that violate the contracts of the functions and objects they use. In recent years, sessions have been established as a key mechanism for realizing inter-module communications in concurrent programs. Just like values flow into or out of a function or object, messages are sent on, and received from, a session endpoint. Unlike conventional functions and objects, however, the kind, direction, and properties of messages exchanged in a session may vary over time, as the session progresses. This feature of sessions calls for contracts that evolve along with the session they describe.In this work, we extend to sessions the notion of chaperone contract (roughly, a contract that applies to a mutable object) and investigate the ramifications of contract monitoring in a higher-order language that features sessions. We give a characterization of a correct module, one that honors the contracts of the sessions it uses, and prove a blame theorem. Guided by the calculus, we describe a lightweight implementation of monitored sessions as an OCaml module with which programmers can benefit from static session type checking and dynamic contract monitoring using an off-the-shelf version of OCaml.

show abstract

“…Tov and Pucella [Tov and Pucella 2010] have recently shown how to use behavioral contracts to link code written in an affine language to code written in a conventionally typed language. The idea is to coerce affine values to non-affine ones that can be shared with the context, but can still be reasoned about safely using dynamic access counts.…”

Section: Related Workmentioning

confidence: 99%

Affine Refinement Types for Secure Distributed Programming

Bugliesi

Calzavara

Eigner

et al. 2015

ACM Trans. Program. Lang. Syst.

View full text Add to dashboard Cite

Recent research has shown that it is possible to leverage general-purpose theorem proving techniques to develop powerful type systems for the verification of a wide range of security properties on application code. Although successful in many respects, these type systems fall short of capturing resource-conscious properties that are crucial in large classes of modern distributed applications. In this paper, we propose the first type system that statically enforces the safety of cryptographic protocol implementations with respect to authorization policies expressed in affine logic. Our type system draws on a novel notion of "exponential serialization" of affine formulas, a general technique to protect affine formulas from the effect of duplication. This technique allows to formulate an expressive logical encoding of the authentication mechanisms underpinning distributed resource-aware authorization policies. We discuss the effectiveness of our approach on two case studies: the EPMO e-commerce protocol and the Kerberos authentication protocol. We finally devise a sound and complete type-checking algorithm, which is the key to achieving an efficient implementation of our analysis technique.

show abstract

Stateful Contracts for Affine Types

Cited by 35 publications

References 17 publications

Context-Free Session Type Inference

Context-Free Session Type Inference

Chaperone contracts for higher-order sessions

Affine Refinement Types for Secure Distributed Programming

Contact Info

Product

Resources

About