Computer science/Concurrency

Rely-Guarantee Extensions and Locks

by Robert J. Colvin, Scott Heiner, Peter Höfner and Roger C. Su

The Weak Spectroscopy Game to Characterize Behavioral Equivalences

by Lisa A. Barthel, Leonard M. Hübner, Caroline Lemke, Karl P. P. Mattes, Lenard Mollenkopf and Benjamin Bisping

Formalization of (Conflict-)Serializability and Strict Two-Phase Locking

by Dmitriy Traytel

Definitive Set Semantics for LTL3

by Rayhana Amjad, Rob van Glabbeek and Liam O'Connor

Residuated Transition Systems II: Categorical Properties

by Eugene W. Stark

ConcurrentHOL

by Peter Gammie

Coupled Similarity and Contrasimilarity, and How to Compute Them

by Benjamin Bisping and Luisa Montanari

Formalization of CommCSL: A Relational Concurrent Separation Logic for Proving Information Flow Security in Concurrent Programs

by Thibault Dardinier

Residuated Transition Systems

by Eugene W. Stark

A Formal Development of a Polychronous Polytimed Coordination Language

by Hai Nguyen Van, Frédéric Boulanger and Burkhart Wolff

A Reduction Theorem for Store Buffers

by Ernie Cohen and Norbert Schirmer

Formalization of Concurrent Revisions

by Roy Overbeek

Concurrent Refinement Algebra and Rely Quotients

by Julian Fell, Ian J. Hayes and Andrius Velykis

A Constructive Proof for FLP

by Benjamin Bisping, Paul-David Brodmann, Tim Jungnickel, Christina Rickmann, Henning Seidler, Anke Stüber, Arno Wilhelm-Weidner, Kirstin Peters and Uwe Nestmann