CONCUR20: CONCUR 2020: 31ST INTERNATIONAL CONFERENCE ON CONCURRENCY THEORY
SLIDES

Decidable Inductive Invariants for Verification of Cryptographic Protocols with Unbounded Sessions

Emanuele D'Osualdo and Felix Stutz

Canonical Expressions of Finite-State Behaviours and Completeness of Equational Axiomatisations

Xinxin Liu and Tingting Yu

Session Types with Arithmetic Refinements

Ankush Das and Frank Pfenning

A Near-Linear-Time Algorithm for Weak Bisimilarity on Markov Chains

David N. Jansen, Jan Friso Groote, Ferry Timmers and Pengfei Yang

A Classification of Weak Asynchronous Models of Distributed Computing

Javier Esparza and Fabian Reiter
Total: 5 presentations.