Reading Group Proposals


12.12.19
Martin Helfrich
Succinct Population Protocols for Presburger Arithmetic
Link (soon)

05.12.19
Marijana Lazic
Verification of Threshold-Based Distributed Algorithms by Decomposition to Decidable Logics
Link

28.11.19
Philip Offtermatt
“Approaching Safety for Parameterized Systems via View Abstraction”
Link

21.11.19
READING GROUP: “Verifying monadic second order graph properties with tree automata”
(recommended by Mikhail Raskin)
Link

14.11.19
Debarghya
“Statistical limits of machine learning”
Link

08.11.19
Pierre Ganty
“Deciding language inclusion problems using quasiorders”
(Convey talk)

31.10.19
Tobias Prehn
“Immediate Observation in Mediated Population Protocols”
Link

01.10.19
READING GROUP: “Probability 1 computation with chemical reaction networks”
(recommended by Mikhail Raskin)
Link

17.09.19
Martin Helfrich
“Automatic Verification of non-silent Population Protocols”
Slides

03.09.19
Anantha Padmanabha
“Term Modal Logic”
Slides

20.08.19
Tobias Winkler
“On the Complexity of Reachability in Parametric Markov Decision Processes”
Slides

13.08.19
Marijana Lazic
Verification of Randomized Consensus Algorithms under Round-Rigid Adversaries
Slides

30.07.19
Gargi Balasubramaniam
“Towards Comprehensible Representation of Controllers using Machine Learning: Inductive Logic Programming”
Slides Infos Video

23.07.19
Kush Grover
“Learning Discrete Timed Automata”
Slides

16.07.19
Stefan Jaax
“Succinct Population Protocols”
(no slides)

18.06.19
Chana Weil-Kennedy
“Immidiate Observation Population Protocols”
Slides

11.06.19
Marijana Lazic
Reduction Techniques for Parameterized Model Checking and Synthesisof Fault-Tolerant Distributed Algorithms
Slides

28.05.19
Michael Blondin
“Affine Extensions of Integer Vector Addition Systems with States”
Slides

21.05.19
Martin Helfrich
“Synthesis of small Population Protocols”
Slides

14.05.19
Javier Esparza
“Expected Time of Population Protocols”
Slides

07.05.19
Philip Offtermatt
“Peregrine”
Slides

27.03.19 and 03.04.19
Fabian Reiter
“Distributed Automata and Algorithms”
Slides Slides

27.02.19
Michael Raskin
“Unreliable Population Protocols”
Slides

20.02.19
Chana Weil-Kennedy
“Immidiate Observation Population Protocols”
Slides

14.02.19
Stefan Jaax
“Broadcast Protocols”

16.01.19
Christian Müller
“Inductive Invariants for Noninterference in Multi-agent Workflows”
Slides

19.12.18
Christian Müller
“Specifying and Verifying Secrecy in Workflows
with Arbitrarily Many Agents”
Slides

12.12.18
Chana Weil-Kennedy
“Verification of Immediate Observation Population Protocols”
Slides

5.12.18
Philipp Meyer
“Peregrine – A Tool for Population Protocols”
Slides

28.11.18
Stefan Jaax
“Peregrine – A Tool for Population Protocols”
Slides

7.11.18 & 14.11.18 & 21.11.18
Javier Esparza
“Black Ninjas in the Dark: Analyzing Population Protocols”
Slides