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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Journal of logical and algebraic methods in programming Jg. 124; S. 100717
Hauptverfasser:	Dardha, Ornela, Pérez, Jorge A.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier Inc 01.01.2022
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!