Type Checking Liveness for Collaborative Processes with Bounded and Unbounded Recursion

Debois, Søren; Hildebrandt, Thomas; Yoshida, Nobuko

doi:10.1007/978-3-662-43613-4_1

Cited by 8 publications

(6 citation statements)

References 26 publications

(38 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A different notion of liveness called request-response is proposed in [15] based on binary session types. Their liveness means that when a particular label of a branching type (a request) is selected, a set of other labels (its responses) is eventually selected.…”

Section: Session Typesmentioning

confidence: 99%

Fencing off go: liveness and safety for channel-based programming

et al. 2017

Self Cite

View full text Add to dashboard Cite

Go is a production-level statically typed programming language whose design features explicit message-passing primitives and lightweight threads, enabling (and encouraging) programmers to develop concurrent systems where components interact through communication more so than by lock-based shared memory concurrency. Go can only detect global deadlocks at runtime, but provides no compile-time protection against all too common communication mismatches or partial deadlocks. This work develops a static verification framework for bounded liveness and safety in Go programs, able to detect communication errors and partial deadlocks in a general class of realistic concurrent programs, including those with dynamic channel creation and infinite recursion. Our approach infers from a Go program a faithful representation of its communication patterns as a behavioural type. By checking a syntactic restriction on channel usage, dubbed fencing, we ensure that programs are made up of finitely many different communication patterns that may be repeated infinitely many times. This restriction allows us to implement bounded verification procedures (akin to bounded model checking) to check for liveness and safety in types which in turn approximates liveness and safety in Go programs. We have implemented a type inference and liveness and safety checks in a tool-chain and tested it against publicly available Go programs. Updated on 27th Feb 2017. See Comments.

show abstract

Section: Session Typesmentioning

confidence: 99%

Fencing off go: liveness and safety for channel-based programming

et al. 2017

Self Cite

View full text Add to dashboard Cite

show abstract

“…However, the model considered is roleless since types describe interactions but without specifying which roles implement them. The work in [11] extends binary session types to specify response properties, that is applied to a variant of a collaborative BPMN process language to verify whether liveness for dead-lock free processes can be achieved. A recent paper by Lange et al [25] investigates a bounded liveness property for GO programs, where protocols are specified as global types.…”

Section: Conclusion and Related Workmentioning

confidence: 99%

Declarative Choreographies and Liveness

Hildebrandt¹,

López

Debois

et al. 2019

Formal Techniques for Distributed Objects, Components, and Systems

Self Cite

View full text Add to dashboard Cite

We provide the first formal model for declarative choreographies, which is able to express general omega-regular liveness properties. We use the Dynamic Condition Response (DCR) graphs notation for both choreographies and end-points. We define end-point projection as a restriction of DCR graphs and derive the condition for end-point projectability from the causal relationships of the graph. We illustrate the results with a running example of a Buyer-Seller-Shipper protocol. All the examples are available for simulation in the online DCR workbench at http://dcr.tools/forte19.

show abstract

“…A different notion of liveness called request-response is proposed in [16] based on binary session types. Their liveness means that when a particular label of a branching type (a request) is selected, a set of other labels (its responses) is eventually selected.…”

Section: Static Deadlock Detection In Synchronous Gomentioning

confidence: 99%

Fencing off Go: Liveness and Safety for Channel-based Programming (extended version)

Lange,

Ng,

Toninho

et al. 2016

Preprint

Self Cite

View full text Add to dashboard Cite

Go is a production-level statically typed programming language whose design features explicit message-passing primitives and lightweight threads, enabling (and encouraging) programmers to develop concurrent systems where components interact through communication more so than by lock-based shared memory concurrency. Go can only detect global deadlocks at runtime, but provides no compile-time protection against all too common communication mismatches or partial deadlocks.This work develops a static verification framework for bounded liveness and safety in Go programs, able to detect communication errors and partial deadlocks in a general class of realistic concurrent programs, including those with dynamic channel creation and infinite recursion. Our approach infers from a Go program a faithful representation of its communication patterns as a behavioural type. By checking a syntactic restriction on channel usage, dubbed fencing, we ensure that programs are made up of finitely many different communication patterns that may be repeated infinitely many times. This restriction allows us to implement bounded verification procedures (akin to bounded model checking) to check for liveness and safety in types which in turn approximates liveness and safety in Go programs. We have implemented a type inference and liveness and safety checks in a tool-chain and tested it against publicly available Go programs.

show abstract

Type Checking Liveness for Collaborative Processes with Bounded and Unbounded Recursion

Cited by 8 publications

References 26 publications

Fencing off go: liveness and safety for channel-based programming

Fencing off go: liveness and safety for channel-based programming

Declarative Choreographies and Liveness

Fencing off Go: Liveness and Safety for Channel-based Programming (extended version)

Contact Info

Product

Resources

About