-
Parosh Abdulla, Mohamed Faouzi Atig and Jari Stenman.
Dense-Timed Pushdown Automata
-
Jiří Adámek, Nathan Bowler, Paul Blain Levy and Stefan Milius.
Coproducts of Monads on Set
-
Manindra Agrawal, S. Akshay, Blaise Genest and P. S. Thiagarajan.
Approximate Verification of the Symbolic Dynamics of Markov Chains
-
Rajeev Alur, Emmanuel Filiot and Ashutosh Trivedi.
Regular Transformations of Infinite Strings
-
Robert Atkey.
The Semantics of Parsing with Semantic Actions
-
Albert Atserias, Moritz Müller and Sergi Oliva.
Proof Complexity of Relativized Statements
-
Arnon Avron, Beata Konikowska and Anna Zamansky.
Modular Construction of Cut-Free Sequent Calculi for Paraconsistent Logics
-
Steve Awodey, Nicola Gambino and Kristina Sojakova.
Inductive Types in Homotopy Type Theory
-
David Baelde and Gopalan Nadathur.
Combining Deduction Modulo and Logics of Fixed-Point Definitions
-
Pablo Barceló, Diego Figueira and Leonid Libkin.
Graph Logics with Rational Relations and the Generalized Intersection Problem
-
Libor Barto, Marcin Kozik and Ross Willard.
Near Unanimity Constraints have Bounded Pathwidth Duality
-
Christoph Berkholz.
Lower Bounds for Existential Pebble Games and k-Consistency Tests
-
Jean-Philippe Bernardy and Guilhem Moulin.
A Computational Interpretation of Parametricity
-
Daniel Bundala, Joel Ouaknine and James Worrell.
On the Magnitude of Completeness Thresholds in Bounded Model Checking
-
Arnaud Carayol and Olivier Serre.
Collapsible Pushdown Automata and Labeled Recursion Schemes: Equivalence, Safety and Effective Selection
-
Krishnendu Chatterjee and Laurent Doyen.
Partial-Observation Stochastic Games: How to Win when Belief Fails
-
Krishnendu Chatterjee and Mathieu Tracol.
Decidable Problems for Probabilistic Automata on Infinite Words
-
Krishnendu Chatterjee and Yaron Velner.
Mean-Payoff Pushdown Games
-
Hubie Chen and Victor Dalmau.
Decomposing Quantified Conjunctive (or Disjunctive) Formulas
-
Hubie Chen and Moritz Müller.
An Algebraic Preservation Theorem for ℵ0-categorical Quantified Constraint Satisfaction
-
Yijia Chen and Jörg Flum.
On the Ordered Conjecture
-
Pierre Clairambault, Julian Gutierrez and Glynn Winskel.
The Winning Ways of Concurrent Games
-
Bob Coecke, Ross Duncan, Aleks Kissinger and Quanlong Wang.
Strong Complementarity and Non-locality in Categorical Quantum Mechanics
-
Carles Creus, Adrià Gascón, Guillem Godoy and Lander Ramos.
The HOM Problem is EXPTIME-complete
-
Michael Elberfeld, Martin Grohe and Till Tantau.
Where First-Order and Monadic Second-Order Logic Coincide
-
Javier Esparza, Pierre Ganty and Rupak Majumdar.
A Perfect Model for Bounded Verification
-
Nathanaël Fijalkow, Hugo Gimbert and Youssouf Oualhadj.
Deciding the Value 1 Problem of Probabilistic Leaktight Automata
-
Deepak Garg, Valerio Genovese and Sara Negri.
Countermodels from Sequent Calculi in Multi-Modal Logics
-
Sicun Gao, Jeremy Avigad and Edmund Clarke.
Delta-Decidability over the Reals
-
Serge Grigorieff and Pierre Valarcher.
Functionals using Bounded Information and the Dynamics of Algorithms
-
Stefan Göller, Jean Christoph Jung and Markus Lohrey.
The Complexity of Decomposing Modal and First-Order Theories
-
Clemens Grabmayer, Joerg Endrullis, Dimitri Hendriks, Jan Willem Klop and Lawrence S. Moss.
Automatic Sequences and Zip-Specifications
-
Serge Haddad, Sylvain Schmitz and Philippe Schnoebelen.
The Ordinal-Recursive Complexity of Timed-Arc Petri Nets, Data Nets, and Other Enriched Nets
-
Hugo Herbelin.
A Constructive Proof of the Axiom of Dependent Choice, Compatible with Classical Logic
-
Frédéric Herbreteau, B. Srivathsan and Igor Walukiewicz.
Better Abstractions for Timed Automata
-
Naohiko Hoshino.
Step Indexed Realizability Semantics for a Call-by-Value Language Based on Basic Combinatorial Objects
-
Guilhem Jaber, Nicolas Tabareau and Matthieu Sozeau.
Extending Type Theory with Forcing
-
Sanjay Jain, Alexei Miasnikov and Frank Stephan.
The Complexity of Verbal Languages over Groups
-
Petr Jancar.
Bisimulation Equivalence for First-Order Grammars
-
Jean-Baptiste Jeannin and Dexter Kozen.
Capsules and Separation Logic
-
Emanuel Kieronski, Jakub Michaliszyn, Ian Pratt-Hartmann and Lidia Tendera.
Two-Variable First-Order Logic with Equivalence Closure
-
Anvesh Komuravelli, Corina S. Pasareanu and Edmund M. Clarke.
Learning Probabilistic Systems from Tree Samples
-
Andreas Krebs and A. V. Sreejith.
Non-definability of Languages by Generalized First-Order Formulas over (N,+)
-
Stephan Kreutzer, Sebastian Siebertz and Viktor Engelmann.
Model-Checking on Ordered Structures
-
Annabelle McIver, Larissa Meinicke and Carroll Morgan.
A Kantorovich-Monadic Powerdomain for Information Hiding, with Probability and Nondeterminism
-
Damiano Mazza.
An Infinitary Affine Lambda-Calculus Isomorphic to the Full Lambda-Calculus
-
Paul-André Melliès.
Game Semantics in String Diagrams
-
Jakub Michaliszyn and Jan Otop.
Decidable Elementary Modal Logics
-
Benoît Monin and Laurent Bienvenu.
von Neumann's Biased Coin Revisited
-
Sebastian Muller and Iddo Tzameret.
Short Propositional Refutations for Dense Random 3CNF Formulas
-
Vivek Nigam.
On the Complexity of Linear Authorization Logics
-
Pawel Parys.
On the Significance of the Collapse Operation
-
Adrien Piérard and Eijiro Sumii.
A Higher-Order Distributed Calculus with Name Creation
-
Andre Platzer.
The Complete Proof Theory of Hybrid Systems
-
Sasha Rubin and Alexander Rabinovich.
Interpetations in Scattered Trees
-
David Sabel and Manfred Schmidt-Schauss.
Conservative Concurrency in Haskell
-
Peter Schuster.
Induction in Algebra: A First Case Study
-
Hugh Steele and Andrea Schalk.
Constructing Fully Complete Models for Multiplicative Linear Logic
-
Tony Tan.
An Automata Model for Trees with Ordered Data Values
-
Dmitriy Traytel, Andrei Popescu and Jasmin Christian Blanchette.
Foundational, Compositional (Co)Datatypes for Higher-Order Logic
-
Jamie Vicary.
Higher Semantics of Quantum Protocols