Abstract is missing.
- Higher-Order Model Checking: An OverviewLuke Ong. 1-15 [doi]
- Privacy and the Price of DataDaniel Kifer. 16 [doi]
- From Categorical Logic to Facebook EngineeringPeter W. O'Hearn. 17-20 [doi]
- Names and Symmetry in Computer Science (Invited Tutorial)Andrew M. Pitts. 21-22 [doi]
- Recent Developments in Quantitative Information Flow (Invited Tutorial)Geoffrey Smith. 23-31 [doi]
- Reachability in Two-Dimensional Vector Addition Systems with States Is PSPACE-CompleteMichael Blondin, Alain Finkel, Stefan Göller, Christoph Haase, Pierre McKenzie. 32-43 [doi]
- Long-Run Average Behaviour of Probabilistic Vector Addition SystemsTomás Brázdil, Stefan Kiefer, Antonín Kucera, Petr Novotný. 44-55 [doi]
- Demystifying Reachability in Vector Addition SystemsJérôme Leroux, Sylvain Schmitz. 56-67 [doi]
- Petri Automata for Kleene AllegoriesPaul Brunet, Damien Pous. 68-79 [doi]
- Complexity Bounds for Sum-Product Logic via Additive Proof Nets and Petri NetsWillem Heijltjes, Dominic J. D. Hughes. 80-91 [doi]
- A Cubical Approach to Synthetic Homotopy TheoryDaniel R. Licata, Guillaume Brunerie. 92-103 [doi]
- Game Semantics for Type SoundnessTim Disney, Cormac Flanagan. 104-114 [doi]
- Programs for Cheap!Jennifer Hackett, Graham Hutton. 115-126 [doi]
- Polarised Intermediate Representation of Lambda Calculus with SumsGuillaume Munch-Maccagnoni, Gabriel Scherer. 127-140 [doi]
- On the Relative Usefulness of FireballsBeniamino Accattoli, Claudio Sacerdoti Coen. 141-155 [doi]
- Bisimilarity in Fresh-Register AutomataAndrzej S. Murawski, Steven J. Ramsay, Nikos Tzevelekos. 156-167 [doi]
- Branching Bisimilarity of Normed BPA Processes Is in NEXPTIMEWojciech Czerwinski, Petr Jancar. 168-179 [doi]
- Branching Bisimilarity on Normed BPA Is EXPTIME-CompleteChaodong He, Mingzhang Huang. 180-191 [doi]
- Distributed Graph AutomataFabian Reiter. 192-201 [doi]
- Separating Regular Languages with Two Quantifiers AlternationsThomas Place. 202-213 [doi]
- Star Height via GamesMikolaj Bojanczyk. 214-219 [doi]
- Nondeterminism in Game Semantics via SheavesTakeshi Tsukada, C.-H. Luke Ong. 220-231 [doi]
- The Parallel Intensionally Fully Abstract Games Model of PCFSimon Castellan, Pierre Clairambault, Glynn Winskel. 232-243 [doi]
- Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision ProcessesKrishnendu Chatterjee, Zuzana Komárková, Jan Kretínský. 244-256 [doi]
- Multidimensional beyond Worst-Case and Almost-Sure Problems for Mean-Payoff ObjectivesLorenzo Clemente, Jean-François Raskin. 257-268 [doi]
- Improved Algorithms for One-Pair and k-Pair Streett ObjectivesKrishnendu Chatterjee, Monika Henzinger, Veronika Loitzenbauer. 269-280 [doi]
- The Hunt for a Red Spider: Conjunctive Query Determinacy Is UndecidableTomasz Gogacz, Jerzy Marcinkowski. 281-292 [doi]
- The Complexity of Boundedness for Guarded LogicsMichael Benedikt, Balder ten Cate, Thomas Colcombet, Michael Vanden Boom. 293-304 [doi]
- Finite Open-World Query Answering with Number RestrictionsAntoine Amarilli, Michael Benedikt. 305-316 [doi]
- Tree-like Queries in OWL 2 QL: Succinctness and Complexity ResultsMeghyn Bienvenu, Stanislav Kikot, Vladimir V. Podolskii. 317-328 [doi]
- Path Logics for Querying Graphs: Combining Expressiveness and EfficiencyDiego Figueira, Leonid Libkin. 329-340 [doi]
- PDL Is the Bisimulation-Invariant Fragment of Weak Chain LogicFacundo Carreiro. 341-352 [doi]
- Monadic Second-Order Logic and Bisimulation Invariance for CoalgebrasSebastian Enqvist, Fatemeh Seifan, Yde Venema. 353-365 [doi]
- Defining Winning Strategies in Fixed-Point LogicFelix Canavoi, Erich Grädel, Simon Leßenich, Wied Pakusa. 366-377 [doi]
- Interpolation with Decidable Fixpoint LogicsMichael Benedikt, Balder ten Cate, Michael Vanden Boom. 378-389 [doi]
- A Complete Axiomatization of MSO on Infinite TreesAnupam Das, Colin Riba. 390-401 [doi]
- A Fibrational Account of Local StatesKenji Maillard, Paul-André Melliès. 402-413 [doi]
- Varieties of Languages in a CategoryJirí Adámek, Robert S. R. Myers, Henning Urbat, Stefan Milius. 414-425 [doi]
- Extensions of Domain Maps in Differential and Integral CalculusAbbas Edalat. 426-437 [doi]
- Descriptive Set Theory in the Category of Represented SpacesArno Pauly, Matthew de Brecht. 438-449 [doi]
- Domains of Commutative C-SubalgebrasChris Heunen, Bert Lindenhovius. 450-461 [doi]
- From Complexity to Algebra and Back: Digraph Classes, Collapsibility, and the PGPCatarina Carvalho, Florent R. Madelaine, Barnaby Martin. 462-474 [doi]
- Locally Finite Constraint Satisfaction ProblemsBartek Klin, Eryk Kopczynski, Joanna Ochremiak, Szymon Torunczyk. 475-486 [doi]
- Descriptive Complexity of List H-Coloring Problems in Logspace: A Refined DichotomyVíctor Dalmau, László Egri, Pavol Hell, Benoit Larose, Arash Rafiey. 487-498 [doi]
- One Context Unification Problems Solvable in Polynomial TimeAdria Gascón, Ashish Tiwari, Manfred Schmidt-Schauß. 499-510 [doi]
- Extending ALCQIO with TreesTomer Kotek, Mantas Simkus, Helmut Veith, Florian Zuleger. 511-522 [doi]
- Feedback Turing Computability, and Turing Computability as FeedbackNathanael Leedom Ackerman, Cameron E. Freer, Robert S. Lubarsky. 523-534 [doi]
- Regularity Preserving but Not Reflecting EncodingsJörg Endrullis, Clemens Grabmayer, Dimitri Hendriks. 535-546 [doi]
- Hyper Natural DeductionArnold Beckmann, Norbert Preining. 547-558 [doi]
- Parallelism and Synchronization in an Infinitary ContextUgo Dal Lago, Claudia Faggian, Benoît Valiron, Akira Yoshimizu. 559-572 [doi]
- A Diagrammatic Axiomatisation for Qubit EntanglementAmar Hadzihasanovic. 573-584 [doi]
- A Unifying Approach to the Gamma QuestionBenoit Monin, André Nies. 585-596 [doi]
- Abstract Hidden Markov Models: A Monadic Account of Quantitative Information FlowAnnabelle McIver, Carroll Morgan, Tahiry M. Rabehaja. 597-608 [doi]
- How Good Is a Strategy in a Game with Nature?Arnaud Carayol, Olivier Serre. 609-620 [doi]
- Entailment among Probabilistic ImplicationsAlbert Atserias, José L. Balcázar. 621-632 [doi]
- Metric Reasoning about ?-Terms: The Affine CaseRaphaëlle Crubillé, Ugo Dal Lago. 633-644 [doi]
- On the Complexity of Temporal Equilibrium LogicLaura Bozzelli, David Pearce. 645-656 [doi]
- A Note on the Complexity of Classical and Intuitionistic ProofsMatthias Baaz, Alexander Leitsch, Giselle Reis. 657-666 [doi]
- On the Complexity of Linear Arithmetic with DivisibilityAntonia Lechner, Joël Ouaknine, James Worrell. 667-676 [doi]
- Characterising Choiceless Polynomial Time with First-Order InterpretationsErich Grädel, Wied Pakusa, Svenja Schalthofer, Lukasz Kaiser. 677-688 [doi]
- Universal Covers, Color Refinement, and Two-Variable Counting Logic: Lower Bounds for the DepthAndreas Krebs, Oleg Verbitsky. 689-700 [doi]
- A Canonical Form for Weighted Automata and Applications to Approximate MinimizationBorja Balle, Prakash Panangaden, Doina Precup. 701-712 [doi]
- Automata-Based Abstraction Refinement for µHORS Model CheckingNaoki Kobayashi, Xin Li. 713-724 [doi]
- Nested Weighted AutomataKrishnendu Chatterjee, Thomas A. Henzinger, Jan Otop. 725-737 [doi]
- Timed Pushdown Automata RevisitedLorenzo Clemente, Slawomir Lasota. 738-749 [doi]
- The Target Discounted-Sum ProblemUdi Boker, Thomas A. Henzinger, Jan Otop. 750-761 [doi]