We present Iris, a concurrent separation logic with a simple premise: monoids and invariants are all you need. Partial commutative monoids enable us to express—and invariants en...
Ralf Jung 0002, David Swasey, Filip Sieczkowski, K...
We present a method and a tool for generating succinct representations of sets of concurrent traces. We focus on trace sets that contain all correct or all incorrect permutations ...
Ashutosh Gupta, Thomas A. Henzinger, Arjun Radhakr...
Graphical choreographies, or global graphs, are general multiparty session specifications featuring expressive constructs such as forking, merging, and joining for representing a...
Program equivalence is a fundamental problem that has practical applications across a variety of areas of computing including compilation, optimization, software synthesis, formal...
Nate Foster, Dexter Kozen, Matthew Milano, Alexand...
a brief look at each paper and read its abstract. Each paper below includes a URL. Some papers are available for free, and others are available for free only to you as UMass studen...
Robert A. Cochran, Loris D'Antoni, Benjamin Livshi...
We show that the weak memory model introduced by the 2011 C and C++ standards does not permit many common source-tosource program transformations (such as expression linearisation...
Viktor Vafeiadis, Thibaut Balabonski, Soham Chakra...