First-class state change in plaid

SunshineJoshua,; NadenKarl,; StorkSven,; AldrichJonathan,; Tanter, Éric

doi:10.1145/2076021.2048122

Cited by 18 publications

(15 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Closest to our idea of resource-aware programming are the proposals presented in [3,66]. The first one introduces a typesafe-oriented programming language by extending the object paradigm with object states.…”

Section: Concluding Remarks and Discussionmentioning

confidence: 99%

“…The essential difference between the typesafe approach and ours is that for us resources are independent entities and that we rely on loose coupling design to separate fragments of code that use resources, from resources themselves, rather than scattering fixed operations through a set of states of objects. More precisely, access control over resources in the programming language in [66] is more fine-grained than ours: the adopted access control includes shared, immutable and exclusive accesses. Our approach, instead, supports only exclusive resource accesses.…”

Section: Concluding Remarks and Discussionmentioning

confidence: 99%

See 1 more Smart Citation

Checking global usage of resources handled with local policies

Bodei

Dinh

Ferrari

2017

Science of Computer Programming

View full text Add to dashboard Cite

We present a methodology to reason about resource usage (acquisition, release, revision, and so on) and, in particular, to predict bad usage of resources. Keeping in mind the interplay between local and global information that occur in application-resource interactions, we model resources as entities with local policies and we study global properties that govern overall interactions. Formally, our model is an extension of π-calculus with primitives to manage resources. To predict possible bad usage of resources, we develop a Control Flow Analysis that computes a static over-approximation of process behaviour

show abstract

Section: Concluding Remarks and Discussionmentioning

confidence: 99%

Section: Concluding Remarks and Discussionmentioning

confidence: 99%

Checking global usage of resources handled with local policies

Bodei

Dinh

Ferrari

2017

Science of Computer Programming

View full text Add to dashboard Cite

show abstract

“…Typestate systems require linear typing or some other form of alias control, to avoid conflicting state changes via multiple references. Approaches include the permission-based systems used in the Plural and Plaid languages [4,30] and the fine-grained approach of Militão et al [23]. Crafa and Padovani [10] develop a "chemical" approach to concurrent typestate oriented programming, allowing objects to be accessed and modified concurrently by several processes, each potentially changing only part of their state.…”

Section: Related Work Conclusion and Future Workmentioning

confidence: 99%

Resource Sharing via Capability-Based Multiparty Session Types

Voinea

Dardha

2019

Lecture Notes in Computer Science

View full text Add to dashboard Cite

A. Laura Voinea [0000−0003−4482−205X] , Ornela Dardha [0000−0001−9927−7875] , and Simon J. Gay [0000−0003−3033−9091] Abstract. Multiparty Session Types (MPST) are a type formalism used to model communication protocols among components in distributed systems, by specifying type and direction of data transmitted. It is standard for multiparty session type systems to use access control based on linear or affine types. While useful in offering strong guarantees of communication safety and session fidelity, linearity and affinity run into the well-known problem of inflexible programming, excluding scenarios that make use of shared channels or need to store channels in shared data structures.In this paper, we develop capability-based resource sharing for multiparty session types. In this setting, channels are split into two entities, the channel itself and the capability of using it. This gives rise to a more flexible session type system, which allows channel references to be shared and stored in persistent data structures. We illustrate our type system through a producer-consumer case study. Finally, we prove that the resulting language satisfies type safety.We now introduce a type system for the multiparty session π-calculus. The general methodology of multiparty session types is that system design begins with a global type, which specifies all of the communication among various roles. Given a global type G and a role p, projection yields a session type or local type G p that describes all of the communication involving p. This local type can be further projected for another role q, to give a partial session type that describes communication between p and q.

show abstract

“…fold & unfold are directly related to roll & unroll in [37]. These operations, which give the program access to quantified heap locations, resemble reasoning about capabilities [34,28]. These systems are primarily restricted to verifying (non-)aliasing properties and finite, non-relational facts about heap cells (i.e.…”

Section: Related Workmentioning

confidence: 99%

Predicate Abstraction for Linked Data Structures

Bakst

Jhala

2015

Lecture Notes in Computer Science

View full text Add to dashboard Cite

We present Alias Refinement Types (Art), a new approach that uses predicate-abstraction to automate the verification of correctness properties of linked data structures. While there are many techniques for checking that a heap-manipulating program adheres to its specification, they often require that the programmer annotate the behavior of each procedure, for example, in the form of loop invariants and pre-and post-conditions. We introduce a technique that lifts predicate abstraction to the heap by factoring the analysis of data structures into two orthogonal components: (1) Alias Types, which reason about the physical shape of heap structures, and (2) Refinement Types, which use simple predicates from an SMT decidable theory to capture the logical or semantic properties of the structures. We evaluate Art by implementing a tool that performs type inference for an imperative language, and empirically show, using a suite of data-structure benchmarks, that Art requires only 21% of the annotations needed by other state-of-the-art verification techniques.

show abstract

First-class state change in plaid

Cited by 18 publications

References 25 publications

Checking global usage of resources handled with local policies

Checking global usage of resources handled with local policies

Resource Sharing via Capability-Based Multiparty Session Types

Predicate Abstraction for Linked Data Structures

Contact Info

Product

Resources

About