The Plaid Language: Typed Core Specification

Aldrich, Jonathan; Beckman, Nels E.; Bocchino, Robert L.; Naden, Karl; Saini, Darpan; Stork, Sven; Sunshine, Joshua

doi:10.21236/ada558841

Cited by 6 publications

(8 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Access permission is hence suitable for characterizing the way (read and write) a shared resource is accessed by multiple references and can express the implicit dependencies present in the system while making them explicit, thereby the side effects. Furthermore, permission-based specifications pose their own ordering constraints and therefore can be used to perform method's operations in a non-interfering manner and parallelise code without using the low-level concurrency and ordering constraints [1,43].…”

Section: Parallelising Sequential Imperative Programs: a Motivation E...mentioning

confidence: 99%

See 1 more Smart Citation

Automatic Inference of Symbolic Permissions for Sequential Java Programs

Sadiq¹,

Li²,

Li³

et al. 2019

Preprint

View full text Add to dashboard Cite

In mainstream programming languages such as Java, a common way to enable concurrency is to manually introduce explicit concurrency constructs such as multi-threading. In multi-threaded programs, managing synchronization between threads is a complicated and challenging task for the programmers due to thread interleaving and heap interference that leads to problems such as deadlocks, data races. With these considerations in mind, access permission-based dependencies have been investigated as an alternative approach to verify the correctness of multi-threaded programs and to exploit the implicit concurrency present in sequential programs without using explicit concurrency constraints. However, significant annotation overhead can arise from manually adding permission-based specifications in a source program, diminishing the effectiveness of existing permission-based approaches.In this paper, we present a framework, Sip4J, to automatically extract access permission-based implicit dependencies from sequential Java programs, by performing inter-procedural static analysis of the source code. Moreover, we integrate and extend an existing permissionbased verification tool, Pulse, to automatically verify correctness of the inferred specifications and to reason about their concurrent behaviors. Our evaluation on some widely-used benchmarks gives strong evidence of the correctness of the inferred annotations and their effectiveness in enabling concurrency in sequential programs.

show abstract

Section: Parallelising Sequential Imperative Programs: a Motivation E...mentioning

confidence: 99%

“…Enabling concurrency for imperative and object-oriented languages has become one of the grand challenges for the IT industry today 1 . This is because of the nature of the imperative and objectoriented programming paradigms where the compiler follows the execution order in which the program is written, i.e., sequential.…”

Section: Introductionmentioning

confidence: 99%

Automatic Inference of Symbolic Permissions for Sequential Java Programs

Sadiq¹,

Li²,

Li³

et al. 2019

Preprint

View full text Add to dashboard Cite

show abstract

“…Plaid primitives are defined using Java classes and methods, which can be directly accessed in Plaid via their fully-qualified Java names. Details of both of these aspects of Plaid are discussed in more detail in the Plaid language definition [17].…”

Section: Elaborationmentioning

confidence: 99%

First-class state change in plaid

Sunshine

Naden

Stork

et al. 2011

Proceedings of the 2011 ACM International Conference on Object Oriented Programming Systems Languages and Applications

Self Cite

View full text Add to dashboard Cite

Objects model the world, and state is fundamental to a faithful modeling. Engineers use state machines to understand and reason about state transitions, but programming languages provide little support for building software based on state abstractions. We propose Plaid, a language in which objects are modeled not just in terms of classes, but in terms of changing abstract states. Each state may have its own representation, as well as methods that may transition the object into a new state. A formal model precisely defines the semantics of core Plaid constructs such as state transition and trait-like state composition. We evaluate Plaid through a series of examples taken from the Plaid compiler and the standard libraries of Smalltalk and Java. These examples show how Plaid can more closely model state-based designs, enhancing understandability, enhancing dynamic error checking, and providing reuse benefits.

show abstract

“…The current specification of the Plaid language [11] specifies Restricted Update as the design which will be implemented in future versions of Plaid. This choice was mostly pragmatic: it provides a fairly lightweight syntax and simple semantics that covers a use case we are confident we will need.…”

Section: Plaid's Designmentioning

confidence: 99%

Modular composition and state update in Plaid

Aldrich

Naden

Tanter

2010

Proceedings of the 4th Workshop on MechAnisms for SPEcialization, Generalization and inHerItance

Self Cite

View full text Add to dashboard Cite

At the core of the Plaid typestate-oriented programming language is the ability to change the representation of an object at run-time. As such, the semantics of the state change operation impact how Plaid programs are structured and how objects are composed in Plaid's trait-based composition system. We describe the challenges with respect to designing a modular state change operation and suggest two options. Secondly, we explore the issues both designs create for explicit conflict resolution and sketch a potential solution which eliminates the flattening property to allow conflicts to be resolved only when they come into scope.

show abstract

The Plaid Language: Typed Core Specification

Cited by 6 publications

References 2 publications

Automatic Inference of Symbolic Permissions for Sequential Java Programs

Automatic Inference of Symbolic Permissions for Sequential Java Programs

First-class state change in plaid

Modular composition and state update in Plaid

Contact Info

Product

Resources

About