Monday, 22 Aug 2016

09:25am - 09:30am

Registration

09:30am - 09:40am

Opening Remarks

09:40am - 10:40am

Tutorial: Algorithmic analysis for parameterized systems I
Rupak Majumdar, Max Planck Institute for Software Systems, Germany

10:40am - 11:00am

--- Group Photo & Coffee Break ---

11:00am - 11:40am

Fully automated shape analysis based on forest automata (PDF)
Ondrej Lengal, Brno University of Technology, Czech Republic

11:40am - 12:10pm

Register automata as a model for local computation in distributed query evaluation (PDF)
Tony Tan, National Taiwan University, Taiwan

12:10pm - 02:00pm

--- Lunch Break ---

02:00pm - 02:30pm

Distributed local strategies in broadcast networks
Nathalie Bertrand, Institut de Recherche en Informatique et en Automatique, France

02:30pm - 02:50pm

A question about Mazurkiewicz traces (PDF)
Mikolaj Bojanczyk, University of Warsaw, Poland

02:50pm - 03:40pm

--- Coffee Break ---

03:40pm - 04:10pm

Soundness in negotiations (PDF)
Denis Kuperberg, Technical University of Munich, Germany

04:10pm - 04:30pm

A multi estimations approach for computing backbones of hard and dense propositional formulae (PDF)
Yueling Zhang, East China Normal University, China

04:30pm - 05:00pm

SAT-based explicit LTL reasoning (PDF)
Geguang Pu, East China Normal University, China

Tuesday, 23 Aug 2016

09:25am - 09:30am

Registration

09:30am - 10:30am

Tutorial: Algorithmic analysis for parameterized systems II
Rupak Majumdar, Max Planck Institute for Software Systems, Germany

10:30am - 11:00am

--- Coffee Break ---

11:00am - 11:40am

The benefits of continuous over-approximations for vector addition systems with states
Christoph Hasse, Centre National de la Recherche Scientifique, France

11:40am - 12:10pm

The complexity of regular abstractions of one-counter languages (PDF)
Dmitry Chistikov, University of Oxford, UK

12:10pm - 02:00pm

--- Lunch Break ---

02:00pm - 03:00pm

On parametrized verification of asynchronous, shared-memory pushdown systems (PDF)
Anca Muscholl, Université Bordeaux, France

03:00pm - 03:30pm

--- Coffee Break ---

03:30pm - 04:00pm

Monoids as storage mechanisms
Georg Zetzsche, École Normale Supérieure de Cachan, France

04:00pm - 04:30pm

Constrained dynamic tree networks
Matthew Hague, Royal Holloway, University of London, UK

04:30pm - 05:00pm

A state equation for Petri nets with unordered data (PDF)
Piotrek Hofman, Centre National de la Recherche Scientifique and École Normale Supérieure de Cachan, France

Wednesday, 24 Aug 2016

09:25am - 09:30am

Registration

09:30am - 10:30am

Tutorial: Graph decompositions and the verification of concurrent recursive programs I (PDF 1, PDF 2)
Narayan Kumar Krishnan, Chennai Mathematical Institute, India

10:30am - 10:50am

--- Coffee Break ---

10:50am - 11:20am

Towards a regular theory of parameterized concurrent systems
Benedikt Bollig, Centre National de la Recherche Scientifique, France

11:20am - 11:50am

Proving liveness in parameterised probabilistic concurrent systems
Anthony Widjaja Lin, Yale-NUS College and National University of Singapore

11:50am - 12:20pm

Hitting families of schedules (PDF)
Filip Niksic, Max Planck Institute, Germany

Thursday, 25 Aug 2016

09:25am - 09:30am

Registration

09:30am - 10:30am

Tutorial: Graph decompositions and the verification of concurrent recursive programs II (PDF 1, PDF 2)
Narayan Kumar Krishnan, Chennai Mathematical Institute, India

10:30am - 10:50am

--- Coffee Break ---

10:50am - 11:20am

Population protocols and predicates
Pierre Ganty, Universidad Politécnica de Madrid, Spain

11:20am - 11:50am

Quantitative verification of parameterized systems (PDF)
Rayna Dimitrova, Max Planck Institute, Germany

11:50am - 12:20pm

On hierarchical communication topologies in the pi-calculus (PDF)
Emanuele D'Osualdo, University of Oxford, UK