posted on 2017-04-20, 11:49authored byBrijesh Dongol, Alasdair Armstrong
This page contains Isabelle theory files for proving correctness
of hybrid transactional memory in a modular fashion,
leveraging
the TMS2
specification and Lesani et
al's results,
these proofs establish opacity of two novel hybrid versions of the
Dalessandro et al.'s
transactional mutex lock .
Modularisation is based on a concept we refer to as open I/O automata.
naive, a simple implementation and proof, where the fast and slow path
both synchronise on the same global variable, and
2-Counter, an improved implementation and proof, where the
slow- and fast-path transactions synchronise on different variables, allowing
more concurrency.