IFIP WG 2.2 Meeting, Brno, September 17-19, 2018

Talks (in alphabetical order)

---

• Parosh Abdulla
  Dynamic Partial Order Reduction under the Release-Acquire Semantics
  slides
  

---

• Luis Caires
  Refinement Kinds: Type-safe Programming with Practical Type-level Computation
  abstract

---

• Mariangiola Dezani-Ciancaglini
  Java and Lambda: A Featherweight Story
  slides
  

---

• Radu Grosu
  TBA
  

---

• Naoki Kobayashi
  Probabilistic Higher-Order Recursion Schemes and Termination Probabilities
  slides
  

---

• Narayan Kumar Krishnan
  Verifying Asynchronous Programs with Nested Locks
  slides
  

---

• Antonin Kucera
  Game-Theoretic Approach to Security Problems
  slides
  

---

• Ugo dal Lago
  On Higher-Order Probabilistic Computation: Relational Reasoning, Termination, and Bayesian Programming
  abstract, slides
  

---

• Roland Meyer
  Regular Separability of Well-Structured Transition Systems
  abstract, slides
  

---

• Andrzej Murawski
  Linearity in Higher-Order Recursion Schemes
  abstract, slides
  

---

• Peter Mosses
  Funcons for Threads and Processes
  abstract, slides
  

---

• Uwe Nestmann
  Coupled Simulation (What? Why? How?)
  abstract

---

• Ernst-Rüdiger Olderog
  High-Level Representation of Benchmark Families for Petri Games
  abstract

---

• Igor Walukiewicz
  Towards Verification of Distributed Algorithms in the Heard-of Model
  slides
  

---