POPL 2026
Sun 11 - Sat 17 January 2026 Rennes, France
Wed 14 Jan 2026 14:25 - 14:50 at Réfectoire - Concurrency: Models Chair(s): Noam Zilberstein

The specifications of mainstream processor architectures, such as Arm, x86, and RISC-V, underlie modern computing, as the targets of compilers, operating systems, and hypervisors. However, despite extensive research and tooling for instruction-set architecture (ISA) and relaxed-memory semantics, recently including systems features, there still do not exist integrated mathematical models that suffice for foundational formal verification, of concurrent architecture properties or of systems software. Previous proof-assistant work has had to substantially simplify the ISA semantics, the concurrency model, or both.

We present ArchSem, an architecture-generic framework for architecture semantics, modularly combining ISA and concurrency models along a tractable interface of instruction-semantics effects, that covers a range of systems aspects. To do so, one has to handle many issues that were previously unclear, about the architectures themselves, the interface, the proper definition of reusable models, and the Rocq and Isabelle idioms required to make it usable. We instantiate it to the Arm-A and RISC-V instruction-set architectures and multiple concurrency models.

We demonstrate usability for proof, despite the scale, by establishing that the Arm architecture (in a particular configuration) provides a provable virtual memory abstraction, with a combination of Rocq, Isabelle, and paper proof. Previous work provides further confirmation of usability: the AxSL program logic for Arm relaxed concurrency was proved sound above an earlier version of ArchSem.

This establishes a basis for future proofs of architecture properties and systems software, above production architecture specifications.

Wed 14 Jan

Displayed time zone: Brussels, Copenhagen, Madrid, Paris change

14:00 - 15:40
Concurrency: ModelsPOPL at Réfectoire
Chair(s): Noam Zilberstein Cornell University
14:00
25m
Talk
Arbitration-Free Consistency Is Available (and Vice Versa)
POPL
Hagit Attiya Technion - Israel Institute of Technology, Constantin Enea LIX, CNRS, Ecole Polytechnique, Enrique Román-Calvo University of Freiburg
DOI
14:25
25m
Talk
ArchSem: Reusable Rigorous Semantics of Relaxed Architectures
POPL
Thibaut Pérami University of Cambridge, Thomas Bauereiss University of Cambridge, Brian Campbell University of Edinburgh, Zongyuan Liu Aarhus University, Nils Lauermann University of Cambridge, Alasdair Armstrong University of Cambridge, Peter Sewell University of Cambridge
DOI
14:50
25m
Talk
Consistent Updates for Scalable Microservices
POPL
Devora Chait-Roth New York University, Kedar Namjoshi Nokia Bell Labs, Thomas Wies New York University
DOI
15:15
25m
Talk
Recurrence Sets for Proving Fair Non-termination under Axiomatic Memory Consistency Models
POPL
Thomas Haas TU Braunschweig, Roland Meyer TU Braunschweig, Hernán Ponce de León Huawei Dresden Research Center, Andrés Lomelí Garduño Huawei Dresden Research Center
DOI