Comparing type systems for deadlock freedom

Message-passing software systems exhibit non-trivial forms of concurrency and distribution; they are expected to follow intended protocols among communicating services, but also to never “get stuck”. This intuitive requirement has been expressed by liveness properties such as progress or (dead)lock...

Full description

Bibliographic Details

Published in:	Journal of logical and algebraic methods in programming Vol. 124; p. 100717
Main Authors:	Dardha, Ornela, Pérez, Jorge A.
Format:	Journal Article
Language:	English
Published:	Elsevier Inc 01.01.2022
Subjects:	Concurrency Deadlock freedom Linear logic Linear types Process calculi Session types Linear logic Linear types Deadlock freedom Session types Concurrency Process calculi
ISSN:	2352-2208
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!