Java Typestate Checker

Mota, João; Giunti, Marco; Ravara, António

doi:10.1007/978-3-030-78142-2_8

“…Indeed, extending the theory of [8] with protocol subtyping, would make it possible to verify correctness also for class inheritance. particular, we have started integrating our algorithm (see Appendix A.1) into the Java checker [22], which is based on [8]. Finally, we plan to extend the syntax of session types managed by our tool, e.g.…”

Section: Discussionmentioning

confidence: 99%

A Session Subtyping Tool (Extended Version)

Bacchiani,

Bravetti,

Lange

et al. 2021

Preprint

0

View full text Add to dashboard Cite

Session types are becoming popular and have been integrated in several mainstream programming languages. Nevertheless, while many programming languages consider asynchronous fifo channel communication, the notion of subtyping used in session type implementations is the one defined by Gay and Hole for synchronous communication. This might be because there are several notions of asynchronous session subtyping, these notions are usually undecidable, and only recently sound (but not complete) algorithmic characterizations for these subtypings have been proposed. But the fact that the definition of asynchronous session subtyping and the theory behind related algorithms are not easily accessible to non-experts may also prevent further integration. The aim of this paper, and of the tool presented therein, is to make the growing body of knowledge about asynchronous session subtyping more accessible, thus promoting its integration in practical applications of session types.

show abstract

“…While originally introduced to track value initialisation [33], typestates have been explored extensively for objectoriented programming. The approach described for Bica is one approach for typestates in object-oriented languages that inspired the line of research on Mungo [3,13,22,[25][26][27]. In this line of work, typestates are based on session types and describe the permitted sequence of method calls, in a syntax similar to session types.…”

Section: Related Workmentioning

confidence: 99%

“…Accordingly, work has been undergoing to lessen this constraint. A recent implementation of the Mungo tool [26] supports access permissions similar to those described for Plaid.…”

Section: Related Workmentioning

confidence: 99%

Papaya: Global Typestate Analysis of Aliased Objects

Jakobsen

¹

,

Ravier

²

,

Dardha

³

2021

23rd International Symposium on Principles and Practice of Declarative Programming

View full text Add to dashboard Cite

Typestates are state machines used in object-oriented programming to specify and verify correct order of method calls on an object. To avoid inconsistent object states, typestates enforce linear typing, which eliminates-or at best limits-aliasing. However, aliasing is an important feature in programming, and the state-of-the-art on typestates is too restrictive if we want typestates to be adopted in real-world software systems.In this paper, we present a type system for an object-oriented language with typestate annotations, which allows for unrestricted aliasing, and as opposed to previous approaches it does not require linearity constraints. The typestate analysis is global and tracks objects throughout the entire program graph, which ensures that well-typed programs conform and complete the declared protocols. We implement our framework in the Scala programming language and illustrate our approach using a running example that shows the interplay between typestates and aliases. CCS CONCEPTS• Theory of computation → Formalisms; • Software and its engineering → Object oriented languages.

show abstract

“…While originally introduced to track value initialisation [32], typestates have been explored extensively for objectoriented programming. The approach described for Bica is one approach for typestates in object-oriented languages that inspired the line of research on Mungo [3,13,21,[24][25][26]. In this line of work, typestates are based on session types and describe the permitted sequence of method calls, in a syntax similar to session types.…”

Section: Related Workmentioning

confidence: 99%

“…Accordingly, work has been undergoing to lessen this constraint. A recent implementation of the Mungo tool [25] supports access permissions similar to those described for Plaid.…”

Section: Related Workmentioning

confidence: 99%

Papaya: Global Typestate Analysis of Aliased Objects Extended Version

Jakobsen,

Ravier,

Dardha

2021

Preprint

0

View full text Add to dashboard Cite

Typestates are state machines used in object-oriented programming to specify and verify correct order of method calls on an object. To avoid inconsistent object states, typestates enforce linear typing, which eliminates-or at best limits-aliasing. However, aliasing is an important feature in programming, and the state-of-the-art on typestates is too restrictive if we want typestates to be adopted in real-world software systems.In this paper, we present a type system for an object-oriented language with typestate annotations, which allows for unrestricted aliasing, and as opposed to previous approaches it does not require linearity constraints. The typestate analysis is global and tracks objects throughout the entire program graph, which ensures that well-typed programs conform and complete the declared protocols. We implement our framework in the Scala programming language and illustrate our approach using a running example that shows the interplay between typestates and aliases.

show abstract

Java Typestate Checker

Cited by 12 publications

References 25 publications

A Session Subtyping Tool (Extended Version)

A Session Subtyping Tool (Extended Version)

Papaya: Global Typestate Analysis of Aliased Objects

Papaya: Global Typestate Analysis of Aliased Objects Extended Version

Contact Info

Product

Resources

About