POPL 2025
Sun 19 - Sat 25 January 2025 Denver, Colorado, United States
Tue 21 Jan 2025 15:12 - 15:30 at Patty Cake - Static Analysis and Abstract Interpretation

We consider the problem of automated safety verification for distributed systems written using the actor model. The infinite state space of these systems prevents techniques such as symbolic execution or model checking from reaching a fixed point, leaving manual verification as the state-of-the- art. We propose a separation logic for actors extended with message histories recording the trace of messages handled during execution. During execution, we observe that these histories contain cycles for many common algorithms like Paxos, and this cyclic history is the cause of non-termination in prior techniques. We formalize requirements for soundly over-approximating these cyclic message histories, allowing for sound automated verification of safety properties via goal-directed abstract interpretation. Our techniques allow Paxos to be automatically proven safe without user-specified inductive invariants for the first time.

Tue 21 Jan

Displayed time zone: Mountain Time (US & Canada) change

14:00 - 15:30
Static Analysis and Abstract InterpretationTPSA at Patty Cake
14:00
18m
Talk
Compositional Shape Analysis with Shared Abduction and Biabductive Loop Acceleration (Extended Abstract)Remote
TPSA
Florian Sextl TU Wien, Austria, Adam Rogalewicz Brno University of Technology, Czechia, Tomáš Vojnar Brno University of Technology, Florian Zuleger TU Vienna
Pre-print
14:18
18m
Talk
Calculational design of Incorrectness Separation Logic
TPSA
Lorenzo Gazzella Università di Pisa
14:36
18m
Talk
Scalable Bug Detection for Internally Unsafe Libraries: A Logical Approach to Type Refutation
TPSA
Pedro Carrott Imperial College London, Sacha-Élie Ayoun Imperial College London, Azalea Raad Imperial College London
14:54
18m
Talk
Enhancing Infer Compositional Analysis with Summary Specialization
TPSA
15:12
18m
Talk
Cyclic Message Histories for Automated Safety Verification of Distributed Algorithms
TPSA
Christian Fontenot University of Colorado Boulder, Gowtham Kaki University of Colorado at Boulder, Bor-Yuh Evan Chang University of Colorado Boulder & Amazon