A proof framework for concurrent programs

TL;DR: This paper presents a proof framework for verifying concurrent programs that communicate using global variables and is geared towards verification of models that have an unbounded state size and are as close to the original code as possible.

Abstract: This paper presents a proof framework for verifying concurrent programs that communicate using global variables. The approach is geared towards verification of models that have an unbounded state size and are as close to the original code as possible. The bakery algorithm is used as a demonstration of the framework basics, while the (full) framework with thread synchronization was used to verify and correct the reentrant readers writers algorithm as used in the Qt library.