On this page:
Invited Speakers
- Daniel Kifer
Privacy and the Price of Data - Anca Muscholl
Automated Synthesis of Distributed Controllers - Peter O'Hearn
From Categorical Logic to Facebook Engineering - C.-H. Luke Ong
Recent Advances in Higher-order Model Checking - Andrew Pitts
Names and Symmetry in Computer Science (tutorial) - Geoffrey Smith
Quantitative Information Flow (tutorial)
Presented Papers
Entries are ordered by surname of first author
- Beniamino Accattoli Claudio Sacerdoti Coen
On the Relative Usefulness of FireballsMore Information... - Nathanael Leedom Ackerman Cameron E. Freer Robert S. Lubarsky
Feedback Turing Computability, and Turing Computability as FeedbackMore Information... - Jiri Adamek Robert S. R. Myers Henning Urbat Stefan Milius
Varieties of Languages in a CategoryMore Information... - Antoine Amarilli Michael Benedikt
Finite Open-World Query Answering with Number RestrictionsMore Information... - Albert Atserias José L.Balcázar
Entailment among Probabilistic ImplicationsMore Information... - Matthias Baaz Alexander Leitsch Giselle Reis
A Note on the Complexity of Classical and Intuitionistic ProofsMore Information... - Borja Balle Prakash Panangaden Doina Precup
A Canonical Form for Weighted Automata and Applications to Approximate MinimizationMore Information... - Arnold Beckmann Norbert Preining
Hyper Natural DeductionMore Information... - Michael Benedikt Balder ten Cate Thomas Colcombet Michael Vanden Boom
The Complexity of Boundedness for Guarded LogicsMore Information... - Michael Benedikt Balder ten Cate Michael Vanden Boom
Interpolation with Decidable Fixpoint LogicsMore Information... - Meghyn Bienvenu Stanislav Kikot Vladimir V. Podolskii
Tree-like Queries in OWL 2 QL: Succinctness and Complexity ResultsMore Information... - Michael Blondin Alain Finkel Stefan Göller Christoph Haase Pierre McKenzie
Reachability in Two-Dimensional Vector Addition Systems with States Is PSPACE-CompleteMore Information... - Mikołaj Bojańczyk
Star Height via GamesMore Information... - Udi Boker Thomas A. Henzinger Jan Otop
The Target Discounted-Sum ProblemMore Information... - Laura Bozzelli David Pearce
On the Complexity of Temporal Equilibrium LogicMore Information... - Tomáš Brázdil Stefan Kiefer Antonín Kučera Petr Novotný
Long-Run Average Behaviour of Probabilistic Vector Addition SystemsMore Information... - Paul Brunet Damien Pous
Petri Automata for Kleene AllegoriesMore Information... - Felix Canavoi Erich Grädel Simon Leßenich Wied Pakusa
Defining Winning Strategies in Fixed-Point LogicMore Information... - Arnaud Carayol Olivier Serre
How Good Is a Strategy in a Game with Nature? 609-620 Albert Atserias, José LMore Information... - Facundo Carreiro
PDL Is the Bisimulation-Invariant Fragment of Weak Chain LogicMore Information... - Catarina Carvalho Florent R. Madelaine Barnaby Martin
From Complexity to Algebra and Back: Digraph Classes, Collapsibility, and the PGPMore Information... - Simon Castellan Pierre Clairambault Glynn Winskel
The Parallel Intensionally Fully Abstract Games Model of PCFMore Information... - Krishnendu Chatterjee Zuzana Komárková Jan Kretínský
Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision ProcessesMore Information... - Krishnendu Chatterjee Monika Henzinger Veronika Loitzenbauer
Improved Algorithms for One-Pair and k-Pair Streett ObjectivesMore Information... - Krishnendu Chatterjee Thomas A. Henzinger Jan Otop
Nested Weighted AutomataMore Information... - Lorenzo Clemente Jean-François Raskin
Multidimensional beyond Worst-Case and Almost-Sure Problems for Mean-Payoff ObjectivesMore Information... - Lorenzo Clemente Slawomir Lasota
Timed Pushdown Automata RevisitedMore Information... - Raphaëlle Crubillé Ugo Dal Lago
Metric Reasoning about ?-Terms: The Affine CaseMore Information... - Wojciech Czerwiński Petr Jančar
Branching Bisimilarity of Normed BPA Processes Is in NEXPTIMEMore Information... - Ugo Dal Lago Claudia Faggian Benoît Valiron Akira Yoshimizu
Parallelism and Synchronization in an Infinitary ContextMore Information... - Víctor Dalmau László Egri Pavol Hell Benoit Larose Arash Rafiey
Descriptive Complexity of List H-Coloring Problems in Logspace: A Refined DichotomyMore Information... - Anupam Das Colin Riba
A Complete Axiomatization of MSO on Infinite TreesMore Information... - Tim Disney Cormac Flanagan
Game Semantics for Type SoundnessMore Information... - Abbas Edalat
Extensions of Domain Maps in Differential and Integral CalculusMore Information... - Jörg Endrullis Clemens Grabmayer Dimitri Hendriks
Regularity Preserving but Not Reflecting EncodingsMore Information... - Sebastian Enqvist Fatemeh Seifan Yde Venema
Monadic Second-Order Logic and Bisimulation Invariance for CoalgebrasMore Information... - Diego Figueira Leonid Libkin
Path Logics for Querying Graphs: Combining Expressiveness and EfficiencyMore Information... - Adria Gascón Ashish Tiwari Manfred Schmidt-Schauß
One Context Unification Problems Solvable in Polynomial TimeMore Information... - Tomasz Gogacz Jerzy Marcinkowski
The Hunt for a Red Spider: Conjunctive Query Determinacy Is UndecidableMore Information... - Erich Grädel Wied Pakusa Svenja Schalthofer Lukasz Kaiser
Characterising Choiceless Polynomial Time with First-Order InterpretationsMore Information... - Jennifer Hackett Graham Hutton
Programs for Cheap! 115-126 Guillaume Munch-Maccagnoni, Gabriel Scherer: Polarised Intermediate Representation of Lambda Calculus with SumsMore Information... - Amar Hadzihasanovic
A Diagrammatic Axiomatisation for Qubit EntanglementMore Information... - Chaodong He Mingzhang Huang
Branching Bisimilarity on Normed BPA Is EXPTIME-CompleteMore Information... - Willem Heijltjes Dominic J. D. Hughes
Complexity Bounds for Sum-Product Logic via Additive Proof Nets and Petri NetsMore Information... - Chris Heunen Bert Lindenhovius
Domains of Commutative C-SubalgebrasMore Information... - Daniel Kifer
Privacy and the Price of DataMore Information... - Bartek Klin Eryk Kopczyński Joanna Ochremiak Szymon Toruńczyk
Locally Finite Constraint Satisfaction ProblemsMore Information... - Naoki Kobayashi Xin Li
Automata-Based Abstraction Refinement for μHORS Model CheckingMore Information... - Tomer Kotek Mantas Simkus Helmut Veith Florian Zuleger
Extending ALCQIO with TreesMore Information... - Andreas Krebs Oleg Verbitsky
Universal Covers, Color Refinement, and Two-Variable Counting Logic: Lower Bounds for the DepthMore Information... - Antonia Lechner Joël Ouaknine James Worrell
On the Complexity of Linear Arithmetic with DivisibilityMore Information... - Jérôme Leroux Sylvain Schmitz
Demystifying Reachability in Vector Addition SystemsMore Information... - Daniel R. Licata Guillaume Brunerie
A Cubical Approach to Synthetic Homotopy TheoryMore Information... - Kenji Maillard Paul-André Melliès
A Fibrational Account of Local StatesMore Information... - Annabelle McIver Carroll Morgan Tahiry M. Rabehaja
Abstract Hidden Markov Models: A Monadic Account of Quantitative Information FlowMore Information... - Benoit Monin André Nies
A Unifying Approach to the Gamma QuestionMore Information... - Andrzej S. Murawski Steven J. Ramsay Nikos Tzevelekos
Bisimilarity in Fresh-Register AutomataMore Information... - Peter W. O'Hearn
From Categorical Logic to Facebook EngineeringMore Information... - Luke Ong
Higher-Order Model Checking: An OverviewMore Information... - Arno Pauly Matthew de Brecht
Descriptive Set Theory in the Category of Represented SpacesMore Information... - Andrew M. Pitts
Names and Symmetry in Computer Science (Invited Tutorial)More Information... - Thomas Place
Separating Regular Languages with Two Quantifiers AlternationsMore Information... - Fabian Reiter
Distributed Graph AutomataMore Information... - Geoffrey Smith
Recent Developments in Quantitative Information Flow (Invited Tutorial)More Information... - Takeshi Tsukada C.-H. Luke Ong
Nondeterminism in Game Semantics via SheavesMore Information...
Organizers
General ChairLuke Ong Program ChairCatuscia Palamidessi Publicity ChairAndrzej Murawski Workshops ChairPatricia Bouyer-Decitre |
Program Committee:Pablo Barceló (U. Chile); Gilles Barthe (IMDEA); Andrej Bauer (IMFM); Lev Beklemishev (Russian Ac. of Sci.); Patricia Bouyer-Decitre (CNRS & ENS Cachan); Adam Chlipala (MIT); Agata Ciabattoni (TU Wien); Véronique Cortier (CNRS Loria); Pedro D'Argenio (UN Cordoba); Anuj Dawar (U. Cambridge); Mariangiola Dezani-Ciancaglini (U. Torino); Yuxi Fu (SJTU); Rob van Glabbeek (NICTA); Ichiro Hasuo (U. Tokyo); Martin Hofmann (LMU); Delia Kesner (U. Paris Diderot); Barbara König (U. Duisburg-Essen); Laura Kovács (Chalmers UT); Dexter Kozen (Cornell U.); Manfred Kufleitner (U. Stuttgart); Anthony W. Lin (Yale-NUS College); Simone Martini (U. Bologna); Madhavan Mukund (Chennai Math. Inst.); Filip Murlak (U. Warsaw); Gopalan Nadathur (U. Minnesota); Frank Pfenning (CMU); Ian Pratt-Hartmann (U. Manchester); Albert Rubio (U. Barcelona); Peter Selinger (Dalhousie U.); Alexandra Silva (Radboud U.); Tachio Terauchi (JAIST); Bow-Yaw Wang (Academia Sinica) Organizing CommitteeMartín Abadi; Luca Aceto; Rajeev Alur; Maria PaolaBonacina; Patricia Bouyer-Decitre; Krishnendu Chatterjee; Adriana Compagnoni; Anuj Dawar; Nachum Dershowitz; Maribel Fernández; Martin Grohe; Orna Grumberg; Masahito Hasegawa; Thomas A. Henzinger; Phokion Kolaitis; Orna Kupferman; Benoit Larose; Dale Miller; Michael Mislove; Andrzej Murawski; Luke Ong; Catuscia Palamidessi; Prakash Panangaden; Kristoffer Rose; Andre Scedrov; David Shmoys; Matt Valeriote Advisory BoardMartín Abadi; Samson Abramsky; Rajeev Alur; Bob Constable; Thierry Coquand; Thomas Henzinger; Jean-Pierre Jouannaud; Phokion Kolaitis; Dexter Kozen; Dale Miller; John Mitchell; Prakash Panangaden; Andrew Pitts; Gordon Plotkin; Moshe Y. Vardi; Glynn Winskel |