Yet Another Type System for Lock-Free Processes
Résumé
A network of processes is lock free if every message produced in it is eventually consumed and if every process waiting for a message eventually receives one. We study a type system guaranteeing that well-typed process networks are lock free. Despite its minimality, our type system subsumes existing type-based approaches for lock freedom. In particular, we show that interactions whose lock freedom is guaranteed by design, because they are described by a global specification, can be realized as a well-typed network of processes.
Origine : Fichiers produits par l'(les) auteur(s)
Loading...