Isabelle files for verification of a hybrid transactional mutex lock

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. Download the theory files here. The zip file consists of two folders: <i> naive</i>, a simple implementation and proof, where the fast and slow path both synchronise on the same global variable, and <i> 2-Counter</i>, an improved implementation and proof, where the slow- and fast-path transactions synchronise on different variables, allowing more concurrency. The proofs require Isabelle 2016. If you encounter a problem loading Seq.thy, please make sure imports is set to "../HOLCF". This is a problem with the new Isabelle distribution.