On this page:
Invited Speakers
- Robert J. Aumann
Backward Induction in Games of Perfect Information - Robert L. Constable
On Building Constructive Formal Theories of Computation Noting the Roles of Turing, Church, and Brouwer - Joan Feigenbaum
Privacy, Anonymity, and Accountability in Ad-Supported Services - Jan Willem Klop
Term Rewriting and Lambda Calculus (tutorial) - Leonid A. Levin
Turing's Password: What Internet Cannot Leak - André Platzer
Logics of Dynamical Systems (tutorial)
Invited Papers
- Robert J. Aumann
Backward Induction in Games of Perfect InformationMore Information... - Robert L. Constable
On Building Constructive Formal Theories of Computation Noting the Roles of Turing, Church, and BrouwerMore Information... - Joan Feigenbaum
Privacy, Anonymity, and Accountability in Ad-Supported ServicesMore Information... - Jan Willem Klop
Term Rewriting and Lambda CalculusMore Information... - Leonid A. Levin
Turing's Password: What Internet Cannot LeakMore Information... - André Platzer
Logics of Dynamical SystemsMore Information...
Presented Papers
Entries are ordered by surname of first author
- Parosh A. Abdulla Mohamed Faouzi Atig Jari Stenman
Dense-Timed Pushdown AutomataMore Information... - Jiri Adamek Stefan Milius Nathan Bowler Paul Blain Levy
Coproducts of Monads on SetMore Information... - Manindra Agrawal S. Akshay Blaise Genest P. S. Thiagarajan
Approximate Verification of the Symbolic Dynamics of Markov ChainsMore Information... - Rajeev Alur Emmanuel Filiot Ashutosh Trivedi
Regular Transformations of Infinite StringsMore Information... - Robert Atkey
The Semantics of Parsing with Semantic ActionsMore Information... - Arnon Avron Beata Konikowska Anna Zamansky
Modular Construction of Cut-free Sequent Calculi for Paraconsistent LogicsMore Information... - Steven Awodey Nicola Gambino Kristina Sojakova
Inductive Types in Homotopy Type TheoryMore Information... - David Baelde Gopalan Nadathur
Combining Deduction Modulo and Logics of Fixed-Point DefinitionsMore Information... - Pablo Barceló Diego Figueira Leonid Libkin
Graph Logics with Rational Relations and the Generalized Intersection ProblemMore Information... - Libor Barto Marcin Kozik Ross Willard
Near Unanimity Constraints Have Bounded Pathwidth DualityMore Information... - Christoph Berkholz
Lower Bounds for Existential Pebble Games and k-Consistency TestsMore Information... - Jean-Philippe Bernardy Guilhem Moulin
A Computational Interpretation of ParametricityMore Information... - Laurent Bienvenu Benoit Monin
Von Neumann's Biased Coin RevisitedMore Information... - Daniel Bundala Joël Ouaknine James Worrell
On the Magnitude of Completeness Thresholds in Bounded Model CheckingMore Information... - Arnaud Carayol Olivier Serre
Collapsible Pushdown Automata and Labeled Recursion Schemes: Equivalence, Safety and Effective SelectionMore Information... - Krishnendu Chatterjee Laurent Doyen
Partial-Observation Stochastic Games: How to Win When Belief FailsMore Information... - Krishnendu Chatterjee Mathieu Tracol
Decidable Problems for Probabilistic Automata on Infinite WordsMore Information... - Krishnendu Chatterjee Yaron Velner
Mean-Payoff Pushdown GamesMore Information... - Hubie Chen Víctor Dalmau
Decomposing Quantified Conjunctive (or Disjunctive) FormulasMore Information... - Hubie Chen Moritz Müller
An Algebraic Preservation Theorem for Aleph-Zero Categorical Quantified Constraint SatisfactionMore Information... - Yijia Chen Jörg Flum
On the Ordered ConjectureMore Information... - Pierre Clairambault Julian Gutierrez Glynn Winskel
The Winning Ways of Concurrent GamesMore Information... - Bob Coecke Ross Duncan Aleks Kissinger Quanlong Wang
Strong Complementarity and Non-locality in Categorical Quantum MechanicsMore Information... - Carles Creus Adria Gascón Guillem Godoy Lander Ramos
The HOM Problem is EXPTIME-CompleteMore Information... - Michael Elberfeld Martin Grohe Till Tantau
Where First-Order and Monadic Second-Order Logic CoincideMore Information... - Viktor Engelmann Stephan Kreutzer Sebastian Siebertz
First-Order and Monadic Second-Order Model-Checking on Ordered StructuresMore Information... - Javier Esparza Pierre Ganty Rupak Majumdar
A Perfect Model for Bounded VerificationMore Information... - Nathanaël Fijalkow Hugo Gimbert Youssouf Oualhadj
Deciding the Value 1 Problem for Probabilistic Leaktight AutomataMore Information... - Sicun Gao Jeremy Avigad Edmund M. Clarke
Delta-Decidability over the RealsMore Information... - Deepak Garg Valerio Genovese Sara Negri
Countermodels from Sequent Calculi in Multi-Modal LogicsMore Information... - Stefan Göller Jean Christoph Jung Markus Lohrey
The Complexity of Decomposing Modal and First-Order TheoriesMore Information... - Clemens Grabmayer Jörg Endrullis Dimitri Hendriks Jan Willem Klop Lawrence S. Moss
Automatic Sequences and Zip-SpecificationsMore Information... - Serge Grigorieff Pierre Valarcher
Functionals Using Bounded Information and the Dynamics of AlgorithmsMore Information... - Serge Haddad Sylvain Schmitz Philippe Schnoebelen
The Ordinal-Recursive Complexity of Timed-arc Petri Nets, Data Nets, and Other Enriched NetsMore Information... - Hugo Herbelin
A Constructive Proof of Dependent Choice, Compatible with Classical LogicMore Information... - Frédéric Herbreteau B. Srivathsan Igor Walukiewicz
Better Abstractions for Timed AutomataMore Information... - Naohiko Hoshino
Step Indexed Realizability Semantics for a Call-by-Value Language Based on Basic Combinatorial ObjectsMore Information... - Guilhem Jaber Nicolas Tabareau Matthieu Sozeau
Extending Type Theory with ForcingMore Information... - Sanjay Jain Alexei Miasnikov Frank Stephan
The Complexity of Verbal Languages over GroupsMore Information... - Petr Jančar
Decidability of DPDA Language Equivalence via First-Order GrammarsMore Information... - Jean-Baptiste Jeannin Dexter C. Kozen
Capsules and SeparationMore Information... - Emanuel Kieronski Jakub Michaliszyn Ian Pratt-Hartmann Lidia Tendera
Two-Variable First-Order Logic with Equivalence ClosureMore Information... - Anvesh Komuravelli Corina S. Pasareanu Edmund M. Clarke
Learning Probabilistic Systems from Tree SamplesMore Information... - Andreas Krebs A. V. Sreejith
Non-definability of Languages by Generalized First-order Formulas over (N, +)More Information... - Damiano Mazza
An Infinitary Affine Lambda-Calculus Isomorphic to the Full Lambda-CalculusMore Information... - Annabelle McIver Larissa Meinicke Carroll Morgan
A Kantorovich-Monadic Powerdomain for Information Hiding, with Probability and NondeterminismMore Information... - Paul-André Melliès
Game Semantics in String DiagramsMore Information... - Jakub Michaliszyn Jan Otop
Decidable Elementary Modal LogicsMore Information... - Sebastian Müller Iddo Tzameret
Short Propositional Refutations for Dense Random 3CNF FormulasMore Information... - Vivek Nigam
On the Complexity of Linear Authorization LogicsMore Information... - Pawel Parys
On the Significance of the Collapse OperationMore Information... - Adrien Piérard Eijiro Sumii
A Higher-Order Distributed Calculus with Name CreationMore Information... - André Platzer
The Complete Proof Theory of Hybrid SystemsMore Information... - Alexander M. Rabinovich Sasha Rubin
Interpretations in Trees with Countably Many BranchesMore Information... - David Sabel Manfred Schmidt-Schauß
Conservative Concurrency in HaskellMore Information... - Andrea Schalk Hugh Steele
Constructing Fully Complete Models for Multiplicative Linear LogicMore Information... - Peter Schuster
Induction in Algebra: A First Case StudyMore Information... - Tony Tan
An Automata Model for Trees with Ordered Data ValuesMore Information... - Dmitriy Traytel Andrei Popescu Jasmin Christian Blanchette
Foundational, Compositional (Co)datatypes for Higher-Order Logic: Category Theory Applied to Theorem ProvingMore Information... - Jamie Vicary
Higher Semantics of Quantum ProtocolsMore Information...
Short Presentations
Entries are ordered by surname of first author
- Samson Abramsky Lucien Hardy
Logical Bell InequalitiesMore Information... - Martin Avanzini Naohi Eguchi Georg Moser
A New Order-Theoretic Characterisation of the Polytime Computable FunctionsMore Information... - Pablo Barceló Leonid Libkin Miguel Romero
Approximations of Conjunctive QueriesMore Information... - Thomas Dinsdale-Young Lars Birkedal Philippa Gardner Matthew Parkinson Hongseok Yang
Views: Compositional Reasoning for Concurrent ProgramsMore Information... - Amelie Gheerbrant Balder ten Cate
Complete Axiomatizations of Fragments of Monadic Second- Order Logic on Finite TreesMore Information... - Stefan Hetzl Lutz Straßburger
Herbrand-Confluence for Cut Elimination in Classical First-Order LogicMore Information... - Akitoshi Kawamura Norbert Müller Carsten Rösnick Martin Ziegler
Uniform Polytime Computable Operators on Univariate Real Analytic FunctionsMore Information... - Antti Kuusisto Jeremy Meyers Jonni Virtema
Undecidable First-Order Theories of Affine GeometriesMore Information... - Kim Larsen Radu Mardare Prakash Panangaden
A Metric Analogue of Stone Duality for Markov ProcessesMore Information... - Marc Lasson Chantal Keller
Parametricity in an Impredicative SortMore Information... - Daniel Leivant
The Comprehension Cube, its Primitive Recursive CornerMore Information... - Yangjia Li Nengkun Yu Mingsheng Ying
Termination of Nondeterministic Quantum ProgramsMore Information... - Konstantinos Mamouras
Canonical Progress Measures for Parity GamesMore Information... - Daniel Neider Roman Rabinovich Martin Zimmermann
Down the Borel Hierarchy: Solving Muller Games via Safety GamesMore Information... - Matthieu Perrinel
On the Expressivity of Linear Logic Subsystems Characterizing Polynomial TimeMore Information... - Thomas Seiller
Graphs of Interaction: AdditivesMore Information... - John Wickerson Mike Dodds Matthew Parkinson
Ribbon Proofs for Separation LogicMore Information...
Organizers
General ChairRajeev Alur Program ChairNachum Dershowitz Conference ChairVlatko Lipovac Andre Scedrov Publicity ChairStephan Kreutzer Andrzej Murawski Workshops ChairAdriana Compagnoni Maribel Fernández |
Program Committee:Christel Baier (Dresden Univ. of Technology); Lev Beklemishev (Steklov Inst. of Mathematics); Andreas Blass (Univ. of Michigan); Manuel Bodirsky (École Polytechnique); Mikołaj Bojańczyk (Warsaw Univ.); Ahmed Bouajjani (Univ. Paris Diderot); Patricia Bouyer-Decitre (CNRS); Andrei Bulatov (Simon Fraser Univ.); Hubert Comon-Lundh (ENS Cachan); Anuj Dawar (Univ. of Cambridge); Gilles Dowek (INRIA); Martín Escardó (Univ. of Birmingham); Maribel Fernández (King's College London); Rob van Glabbeek (NICTA); Rosalie Iemhoff (Utrecht Univ.); Neil Immerman (UMass, Amherst); Max Kanovich (Queen Mary, Univ. of London); Naoki Kobayashi (Tohoku Univ.); Orna Kupferman (Hebrew Univ.); Marta Kwiatkowska (Univ. of Oxford); Olivier Laurent (CNRS - ENS Lyon); Richard Mayr (Univ. of Edinburgh); Andrzej Murawski (Univ. of Leicester); David Plaisted (Univ. North Carolina, Chapel Hill); Davide Sangiorgi (Univ. of Bologna) Organizing CommitteeMartín Abadi; Rajeev Alur; Franz Baader; Paul Beame; Samuel Buss; Edmund M. Clarke; Adriana Compagnoni; Nachum Dershowitz; Martín Escardó; Maribel Fernández; Lance Fortnow; Jürgen Giesl; Martin Grohe; Jean-Pierre Jouannaud; Phokion Kolaitis; Stephan Kreutzer; Benoit Larose; Vlatko Lipovac; Johann A. Makowsky; Michael Mislove; Burkhard Monien; Andrzej Murawski; Philip Scott; Matt Valeriote Advisory BoardMartín Abadi; Samson Abramsky; Yuri Gurevich; Thomas A. Henzinger; Claude Kirchner; Phokion Kolaitis; Dexter Kozen; Ursula Martin; John Mitchell; Luke Ong; Leszek Pacholski; Prakash Panangaden; Gordon Plotkin; Andre Scedrov; Moshe Y. Vardi; Glynn Winskel |