Liveness−preserving Atomicity Abstraction
Modern concurrent algorithms are usually encapsulated in libraries, and complex algorithms are often constructed using libraries of simpler ones. We present the first theorem that allows harnessing this structure to give compositional liveness proofs to concurrent algorithms and their clients. We sh...
| Huvudupphovsmän: | , |
|---|---|
| Materialtyp: | Conference item |
| Publicerad: |
Springer−Verlag
2011
|