Tasks in Modular Proofs of Concurrent Algorithms

Armando Castañeda, Aurélie Hurault, Philippe Quéinnec +1

Proving correctness of distributed or concurrent algorithms is a mind-challenging and complex process. Slight errors in the reasoning are difficult to find, calling for computer-ch…