From Lock Freedom to Progress Using Session Types

Padovani, Luca

doi:10.4204/eptcs.137.2

Cited by 19 publications

(30 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…By combining session types and events in the same type language, inspired by [14], we are able to rely on usual session-based reasoning. Our approach differs from the preliminary ideas presented in [14] that combines session types with a typing discipline that relies on type simulation [11], in that our verification system is completely syntax driven and does not rely on extraimposed conditions (neither on type simulation nor on model-checking).…”

Section: Discussionmentioning

confidence: 99%

Typing Progress in Communication-Centred Systems

Vieira

Vasconcelos

2013

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. We present a type system for the analysis of progress in session-based communication centred systems. Our development is carried out in a minimal setting considering classic (binary) sessions, but building on and generalising previous work on progress analysis in the context of conversation types. Our contributions aim at underpinning forthcoming works on progress for session-typed systems, so as to support richer verification procedures based on a more foundational approach. Although this work does not target expressiveness, our approach already addresses challenging scenarios which are unaccounted for elsewhere in the literature, in particular systems that interleave communications on received session channels.

show abstract

Section: Discussionmentioning

confidence: 99%

Typing Progress in Communication-Centred Systems

Vieira

Vasconcelos

2013

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…In the context of the linear π-calculus, our type systems conjugate the advantages of both approaches and do so with minimal machinery. Indeed, all previous type systems for (dead)lock freedom rely on rich behavioral types (usages [22][23][24][25][26], session types [29], global types [1,9,10,15,16,19], conversation types [33]), and when they are able to deal with recursive processes it is because they take advantage of such richness (see Section 4), almost implying the necessity of rich types to ensure (dead)lock freedom. We have shown that this is not the case, at least for the linear π-calculus.…”

Section: Discussionmentioning

confidence: 99%

Deadlock and lock freedom in the linear π-calculus

Padovani

2014

Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Nin

Self Cite

124

View full text Add to dashboard Cite

We study two refinements of the linear π-calculus that ensure deadlock freedom (the absence of stable states with pending linear communications) and lock freedom (the eventual completion of pending linear communications). The main feature of both type systems is a new form of channel polymorphism that affects their accuracy in a significant way: they are the first of their kind that can deal with recursive processes connected by cyclic networks.

show abstract

“…The latter property is called responsiveness in [13]. Recently, Padovani [26] takes up lock-freedom from [16]. He defines a behavioral type system using asynchronously communicating session types and considers the progress property.…”

Section: Related Workmentioning

confidence: 99%

Trace- and failure-based semantics for responsiveness

2014

View full text Add to dashboard Cite

Abstract.We study open systems modeled as Petri nets with an interface for asynchronous (i.e., buffered) communication with other open systems. As a minimal requirement for successful communication, we investigate responsiveness, which guarantees that an open system and its environment always have the possibility to communicate. We investigate responsiveness with and without final states and also their respective bounded variants, where the number of pending messages never exceeds a previously known bound. Responsiveness accordance describes when one open system can be safely replaced by another open system. We present a trace-based characterization for each accordance variant. As none of the relations turns out to be compositional (i.e., it is no precongruence), we characterize the coarsest compositional relation (i.e., the coarsest precongruence) that is contained in each relation, using a variation of should testing. For the two unbounded variants, the precongruences are not decidable, but for the two bounded variants we show decidability.

show abstract

From Lock Freedom to Progress Using Session Types

Cited by 19 publications

References 15 publications

Typing Progress in Communication-Centred Systems

Typing Progress in Communication-Centred Systems

Deadlock and lock freedom in the linear π-calculus

Trace- and failure-based semantics for responsiveness

Contact Info

Product

Resources

About