D-CON 2019

Preliminary list of accepted talks

Note: This list is still subject to change

  • Filip Mazowiecki, LaBRI, University of Bordeaux - The Reachability Problem for Petri Nets is Not Elementary
  • Karoliina Lehtinen, University of Liverpool - Quasi-polynomial automata for playing with parity games.
  • Christoph Matheja, RWTH Aachen - Tutorial: An Introduction to Weakest Preexpectation Reasoning and Quantitative Separation Logic
  • Sebastian Kenter, WWU Münster - Expressing lock-sensitive reachability in graph structures
  • Jens Gutsfeld, WWU Münster - An Extension of CTL* for Recursive Programs
  • Lars Luthmann, TU Darmstadt - Checking Bisimulation of Parametric Timed Automata
  • Hendrik Göttmann, TU Darmstadt - Compositional Input/Output Conformance Testing of Live Timed Systems with Silent Transitions
  • Sebastian Wolff, TU Braunschweig - Decoupling Lock-Free Data Structures from Memory Reclamation for Static Analysis
  • Dennis Nolte, Universität Duisburg-Essen - Materialization matters: Investigating abstract graph rewriting
  • Christina Mika-Michalski, Universität Duisburg-Essen - Fixpoint Games on Continuous Lattices
  • Harsh Beohar, Universität Duisburg-Essen - Bisimulation maps in presheaf categories
  • Johannes Gareis, Otto-Friedrich-Universität Bamberg - Modal Interface Automata with Data
  • Ronja Enseleit, Humboldt-Universität zu Berlin - Soundness preserving asynchronous composition of workflow nets with interfaces
  • Daniel Stan, Uni Saarland - Syntactic Partial Order Compression for Probabilistic Reachability
  • Uwe Nestmann, TU Berlin - Discussion Session:Formal Verification of Distributed Algorithms