We introduce TaDA Live, a separation logic for reasoning compositionally
about the termination of blocking fine-grained concurrent programs. The logic
contributes several innovations to obtain modular rely/guarantee style
reasoning for liveness properties and to blend them with logical atomicity. We
illustrate the subtlety of our specifications and reasoning on some
paradigmatic examples.Comment: 24 pages, 97 pages including appendi

D'Osualdo, Emanuele

Farzan, Azadeh

Gardner, Philippa

Sutherland, Julian