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

Celý popis

Podrobná bibliografia

Vydané v:	Journal of logical and algebraic methods in programming Ročník 124; s. 100717
Hlavní autori:	Dardha, Ornela, Pérez, Jorge A.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier Inc 01.01.2022
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!