Program
Global Schedule
| Mo Sep 5 |
Tue Sep 6 |
Wed Sep 7 |
Thu Sep 8 |
Fr Sep 9 |
Sa Sep 10 |
| QEST Tutorials | QEST | QEST | QEST | TGC | TGC |
| CONCUR | CONCUR | CONCUR | CONCUR | GASICS | |
| EXPRESS | COMPMOD |
||||
| SOS | LAM | ||||
| MLQA | FOCLASA | ||||
| SECCO | YR-CONCUR | ||||
| Reception | Excursion & Banquet |
Monday, September 5: QEST Tutorials, EXPRESS/SOS, MLQA/SECCO
Tuesday, September 6
Wednesday, September 7
Thursday, September 8
Friday, September 9
Saturday, September 10: TGC/GASICS, COMPMOD/LAM, FOCLASA/YR-CONCUR
FOCLASA Super C, 129 & 130 |
YR-CONCUR Super C, 531 & 532 |
| 08:45 – 09:00 Opening | 08:55 – 09:00 Opening |
| 09:00 – 10:00 | |
| Session F1: Invited Talk | Session Y1 |
| Joe Armstrong How Erlang Views the World and What We Have Learned in the Last 25 Years of Programming Distributed Systems |
Hongfei Fu Deciding Probabilistic Simulation between Probabilistic Pushdown Automata and Finite-State Systems |
| Bernd Puchala and Roman Rabinovich Graph Searching Games with Multiple Robbers and Games with Imperfect Information |
|
| 10:00 – 10:30 Coffee Break | |
| 10:30 – 12:00 | |
| Session F2: Concurrency Meets Coordination | Session Y2 |
| Ross Horne and Vladimiro Sassone A Verified Algebra for Linked Data |
Nikola Benes, Jan Křetínský and Mikael H. Møller Parametric Modal Transition Systems |
| Simon Ware and Robi Malik A State-Based Characterisation of the Conflict Preorder |
M. Praveen Parameterized Complexity of Analyzing Synchronized Transition Systems |
| Jose Proenca, Dave Clarke, Erik De Vink and Farhad Arbab Decoupled Execution of Synchronous Coordination Models via Behavioral Automata |
Romain Brenguier and Ocan Sankur Hardness of Untimed Language Universality |
| 12:00 – 14:30 Lunch Break | |
| 14:30 – 16:00 | |
| Session F3: Invited Tutorial | Session Y3 |
| Vladimir Klebanov VSTTE Competition and Some of Its Solutions |
Mai Thuong Tran Inheritance Can Not Be Observed Easily |
| Sandie Balaguer, Thomas Chatain and Stefan Haar Building Tight Occurrence Nets from Reveals Relations |
|
| Jonathan Heinen, Christina Jansen, Thomas Noll and Joost-Pieter Katoen Analysing Pointer-Programs by Means of Hyperedge Replacement Grammars |
|
| 16:00 – 16:30 Coffee Break | |
| 16:30 – 17:30 | |
| Session F4: Coordination of Resource-Constrained Systems | Session Y4 |
| Luca Aceto, Matteo Cimini, Anna Ingólfsdóttir, Arni Herman Reynisson, Steinar Hugi Sigurdarson and Marjan Sirjani Modelling and Simulation of Asynchronous Real-Time Systems using Timed Rebeca |
Friedrich Gretz Reasoning About Probabilistic Programs with Logical Inference |
| Chiara Bodei, Viet Dung Dinh and Gian Luigi Ferrari Predicting Global Usages of Resources Endowed with Local Policies |
Henri Hansen and Mark Timmer Confluence versus Ample Sets in Probabilistic Branching Time |
| 17:30 – 17:45 Closing | 17:30 – 17:35 Closing |
