Detailed Program -- Track B

See also the complete program, or the topics and PC of Track B.

Tuseday, July 6

Session 1: Automata

  • Blaise Genest, Hugo Gimbert, Anca Muscholl and Igor Walukiewicz. Optimal Zielonka-Type Construction of Deterministic Asynchronous Automata
  • Pierre Chambart and Philippe Schnoebelen. Pumping And Counting On The Regular Post's Embedding Problem
  • Udi Boker, Orna Kupferman and Adin Rosenberg. Alternation Removal in Büchi Automata
  • Laurent Braud and Arnaud Carayol. Linear orders in the pushdown hierarchy

Session 2: Formal Languages

  • Mai Gehrke, Serge Grigorieff and Jean-Eric Pin. A topological approach to recognition
  • Norbert Blum. On LR(k)-parsers of polynomial size
  • Georg Zetzsche. On Erasing Productions in Random Context Grammars

Wednesday, July 7

Session 4: Semantics

  • James Laird. Game Semantics for Call-by-Value Polymorphism
  • Martin Hofmann, Aleksandr Karbyshev and Helmut Seidl. What is a pure functional?
  • Francesco Ranzato and Roberto Giacobazzi. Example-Guided Abstraction Simplification
  • Annabelle McIver, Larissa Meinicke and Carroll Morgan. Compositional closure for Bayes Risk in probabilistic noninterference

Session 5: Graphs, Categories and Quantum Information

  • Ross Duncan and Simon Perdrix. Rewriting measurement-based quantum computations with generalised flow
  • Bob Coecke and Aleks Kissinger. The compositional structure of multipartite quantum entanglement
  • Arend Rensink. Compositionality in Graph Transformation

Session 6: Best Papers

Chair: Burkhard Monien

  • Leslie Ann Goldberg and Mark Jerrum. Approximating the Partition Function of the Ferromagnetic Potts Model
  • George B. Mertzios, Ignasi Sau, Mordechai Shalom and Shmuel Zaks. Placing Regenerators in Optical Networks to Satisfy Multiple Sets of Requests
  • Yijia Chen and Jörg Flum. On optimal proof systems and logics for PTIME

Thursday, July 8

Session 7: Logic

  • Pietro Sala, Angelo Montanari and Gabriele Puppis. Maximal decidable fragments of Halpern and Shoham’s modal logic of intervals
  • Emanuel Kieroński, Jerzy Marcinkowski and Jakub Michaliszyn. B and D are enough to make the Halpern - Shoham logic undecidable
  • Antonis Achilleos, Michael Lampis and Valia Mitsou. Parameterized Modal Satisfiability
  • Raul Leal, Gaelle Fontaine and Yde Venema. Automata for Coalgerbas: an an approach via predicate liftings

Friday, July 9

Session 8: Concurrency

  • Ivan Lanese, Jorge A. Perez, Davide Sangiorgi and Alan Schmitt. On the Expressiveness of Polyadic and Synchronous Communication in Higher-Order Process Calculi
  • Daniel Hirschkoff and Damien Pous. On Bisimilarity and Substitution in Presence of Replication
  • Peter Habermehl, Roland Meyer and Harro Wimmel. The Downward-Closure of Petri net Languages
  • Tomas Brazdil, Petr Jancar and Antonin Kucera. Reachability Games on Extended Vector Addition Systems with States

Session 9: Probabilistic Computation

  • Hugo Gimbert and Youssouf Oualhadj. Probabilistic Automata: Decidable and Undecidable Problems
  • Tomas Brazdil, Javier Esparza, Stefan Kiefer and Michael Luttenberger. Space-efficient scheduling of stochastically generated tasks
  • John Fearnley. Exponential Lower Bounds For Policy Iteration

Saturday, July 10

Session 10: Automata

  • Thomas Colcombet, Denis Kuperberg and Sylvain Lombardy. Regular Temporal Cost Functions
  • Stefan Göller, Christoph Haase, Joel Ouaknine and James Worrell. Model Checking Succinct and Parametric One-Counter Automata
  • Benedikt Bollig, Paul Gastin, Benjamin Monmege and Marc Zeitoun. Pebble weighted automata and transitive closure logics
  • Krishnendu Chatterjee and Laurent Doyen. Energy Parity Games


Conference Information


Blix theme adapted by David Gilbert, powered by PmWiki