PaVeS at GandALF

The PaVeS group contributed with two accepted papers to GandALF’21: “Reconfigurable Broadcast Networks and Asynchronous Shared-Memory Systems are Equivalent” by A. R. Balasubramanian and Chana Weil-Kennedy and “Abduction of trap invariants in parameterized systems” by Javier Esparza, Mikhail Raskin and Christoph Welzel.


The PaVeS group contributed with two accepted papers to PODC’21: “Lower Bounds on the State Complexity of Population Protocols” by Philipp Czerner and Javier Esparza, and “Decision Power of Weak Asynchronous Models of Distributed Computing” by Philipp Czerner, Roland Guttenberg, Martin Helfrich, and Javier Esparza. Additionally, Roland Guttenberg presented this Read more…

Test-of-time award @ CONCUR’21

In this year’s test-of-time awards of CONCUR the paper “Reachability Analysis of Pushdown Automata: Application to Model-checking” of Ahmed Bouajjani, Javier Esparza, and Oded Maler is recognized as “a breakthrough paper that opened the way for the analysis of pushdown automata via model-checking techniques”.

PaVeS at FoSSaCS

The PaVeS group contributes to three papers in FoSSaCS’21: Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy by A. R. Balasubramanian, Javier Esparza and Mikhail Raskin, Runtime Analysis of Broadcast Consensus Protocols by Stefan Jaax and Philipp Czerner Certifying Inexpressibility by Orna Kupermann and Salomon Sickert