Table of Contents

• Trade-off analysis meets probabilistic model checkingChristel Baier, Clemens Dubslaff, Sascha Klüppelholz. 1 [doi]
• Abstract interpretation: past, present and futurePatrick Cousot, Radhia Cousot. 2 [doi]
• Understanding biology through logicJasmin Fisher. 3 [doi]
• Computer-checked mathematics: a formal proof of the odd order theoremAssia Mahboubi. 4 [doi]
• The Ackermann award 2014Anuj Dawar. 5 [doi]
• Citations for the test-of-time award from 1994Dexter Kozen. 6 [doi]
• Infinite-state energy gamesParosh Aziz Abdulla, Mohamed Faouzi Atig, Piotr Hofman, Richard Mayr, K. Narayan Kumar, Patrick Totzke. 7 [doi]
• Beta reduction is invariant, indeedBeniamino Accattoli, Ugo Dal Lago. 8 [doi]
• Regular combinators for string transformationsRajeev Alur, Adam Freilich, Mukund Raghothaman. 9 [doi]
• Asymptotic behaviour in temporal logicEugene Asarin, Michel Blockelet, Aldric Degorre, Catalin Dima, Chunyan Mu. 10 [doi]
• Weight monitoring with linear temporal logic: complexity and decidabilityChristel Baier, Joachim Klein, Sascha Klüppelholz, Sascha Wunderlich. 11 [doi]
• Graph logics with rational relations: the role of word combinatoricsPablo Barceló, Pablo Muñoz. 12 [doi]
• Effective interpolation and preservation in guarded logicsMichael Benedikt, Balder ten Cate, Michael Vanden Boom. 13 [doi]
• On the discriminating power of passivation and higher-order interactionMarco Bernardo, Davide Sangiorgi, Valeria Vignudelli. 14 [doi]
• A domain-theoretic approach to Brownian motion and general continuous stochastic processesPaul Bilokon, Abbas Edalat. 15 [doi]
• Two-way cost automata and cost logics over infinite treesAchim Blumensath, Thomas Colcombet, Denis Kuperberg, Pawel Parys, Michael Vanden Boom. 16 [doi]
• μ-calculusMikolaj Bojanczyk, Christoph Dittmann, Stephan Kreutzer. 17 [doi]
• Logic for communicating automata with parameterized topologyBenedikt Bollig. 18 [doi]
• Logical characterization of weighted pebble walking automataBenedikt Bollig, Paul Gastin, Benjamin Monmege, Marc Zeitoun. 19 [doi]
• Coinduction up-to in a fibrational settingFilippo Bonchi, Daniela Petrisan, Damien Pous, Jurriaan Rot. 20 [doi]
• Model checking existential logic on partially ordered setsSimone Bova, Robert Ganian, Stefan Szeider. 21 [doi]
• Zero-reachability in probabilistic multi-counter automataTomás Brázdil, Stefan Kiefer, Antonín Kucera, Petr Novotný, Joost-Pieter Katoen. 22 [doi]
• The complexity of admissibility in Omega-regular gamesRomain Brenguier, Jean-François Raskin, Mathieu Sassolas. 23 [doi]
• HFlavien Breuvart. 24 [doi]
• A decision procedure for satisfiability in separation logic with inductive predicatesJames Brotherston, Carsten Fuhs, Juan A. Navarro Pérez, Nikos Gorogiannis. 25 [doi]
• Secure equilibria in weighted gamesVéronique Bruyère, Noémie Meunier, Jean-François Raskin. 26 [doi]
• Weak MSO: automata and expressiveness modulo bisimilarityFacundo Carreiro, Alessandro Facchini, Yde Venema, Fabio Zanasi. 27 [doi]
• Symmetry in concurrent gamesSimon Castellan, Pierre Clairambault, Glynn Winskel. 28 [doi]
• Decidability of weak logics with deterministic transitive closureWitold Charatonik, Emanuel Kieronski, Filip Mazowiecki. 29 [doi]
• Equality and fixpoints in the calculus of structuresKaustuv Chaudhuri, Nicolas Guenot. 30 [doi]
• The tractability frontier of graph-like first-order query setsHubie Chen. 31 [doi]
• One hierarchy spawns another: graph deconstructions and the complexity classification of conjunctive queriesHubie Chen, Moritz Müller. 32 [doi]
• On the total variation distance of labelled Markov chainsTaolue Chen, Stefan Kiefer. 33 [doi]
• System F with coercion constraintsJulien Cretin, Didier Rémy. 34 [doi]
• The geometry of synchronizationUgo Dal Lago, Claudia Faggian, Ichiro Hasuo, Akira Yoshimizu. 35 [doi]
• On the pigeonhole and related principles in deep inference and monotone systemsAnupam Das. 36 [doi]
• Expressive completeness of separation logic with two variables and no separating conjunctionStéphane Demri, Morgan Deters. 37 [doi]
• A new correctness criterion for MLL proof netsThomas Ehrhard. 38 [doi]
• On periodically iterated morphismsJörg Endrullis, Dimitri Hendriks. 39 [doi]
• Pattern logics and auxiliary relationsDiego Figueira, Leonid Libkin. 40 [doi]
• Substitution, jumps, and algebraic effectsMarcelo P. Fiore, Sam Staton. 41 [doi]
• Satisfiability modulo counting: a new approach for analyzing privacy propertiesMatthew Fredrikson, Somesh Jha. 42 [doi]
• Achieving new upper bounds for the hypergraph duality problem through logicGeorg Gottlob, Enrico Malizia. 43 [doi]
• KAT + B!Niels Bjørn Bugge Grathwohl, Dexter Kozen, Konstantinos Mamouras. 44 [doi]
• Symmetric normalisation for intuitionistic logicNicolas Guenot, Lutz Straßburger. 45 [doi]
• Equilibria of concurrent games on event structuresJulian Gutierrez, Michael Wooldridge. 46 [doi]
• Subclasses of presburger arithmetic and the weak EXP hierarchyChristoph Haase. 47 [doi]
• Senescent ground tree rewrite systemsM. Hague. 48 [doi]
• Preservation and decomposition theorems for bounded degree structuresFrederik Harwath, Lucas Heimberg, Nicole Schweikardt. 49 [doi]
• No proof nets for MLL with units: proof equivalence in MLL is PSPACE-completeWillem Heijltjes, Robin Houston. 50 [doi]
• Abstract interpretation from Büchi automataMartin Hofmann 0001, Wei Chen. 51 [doi]
• Memoryful geometry of interaction: from coalgebraic components to algebraic effectsNaohiko Hoshino, Koko Muroya, Ichiro Hasuo. 52 [doi]
• Axioms and decidability for type isomorphism in the presence of sumsDanko Ilik. 53 [doi]
• Functional reactive typesAlan Jeffrey. 54 [doi]
• Probably safe or liveJoost-Pieter Katoen, Lei Song 0001, Lijun Zhang 0001. 55 [doi]
• A quest for algorithmically random infinite structuresBakhadyr Khoussainov. 56 [doi]
• On the succinctness of query rewriting over shallow ontologiesStanislav Kikot, Roman Kontchakov, Vladimir V. Podolskii, Michael Zakharyaschev. 57 [doi]
• Turing machines with atoms, constraint satisfaction problems, and descriptive complexityBartek Klin, Slawomir Lasota, Joanna Ochremiak, Szymon Torunczyk. 58 [doi]
• Local temporal reasoningEric Koskinen, Tachio Terauchi. 59 [doi]
• On Hanf-equivalence and the number of embeddings of small induced subgraphsStephan Kreutzer, Nicole Schweikardt. 60 [doi]
• Non-elementary complexities for branching VASS, MELL, and extensionsRanko Lazic, Sylvain Schmitz. 61 [doi]
• Infinite sequential games with real-valued payoffsStéphane Le Roux, Arno Pauly. 62 [doi]
• Hyper-Ackermannian bounds for pushdown vector addition systemsJérôme Leroux, M. Praveen, Grégoire Sutre. 63 [doi]
• Transition systems over gamesPaul Blain Levy, Sam Staton. 64 [doi]
• Compositional verification of termination-preserving refinement of concurrent programsHongjin Liang, Xinyu Feng, Zhong Shao. 65 [doi]
• Eilenberg-MacLane spaces in homotopy type theoryDaniel R. Licata, Eric Finster. 66 [doi]
• MSO queries on trees: enumerating answers under updatesKatja Losemann, Wim Martens. 67 [doi]
• On the computing power of +, -, and ×Marcello Mamino. 68 [doi]
• On the Hoare theory of monadic recursion schemesKonstantinos Mamouras. 69 [doi]
• Formulae-as-types for an involutive negationGuillaume Munch-Maccagnoni. 70 [doi]
• A type theory for productive coprogramming via guarded recursionRasmus Ejlers Møgelberg. 71 [doi]
• Deadlock and lock freedom in the linear π-calculusLuca Padovani. 72 [doi]
• On context semantics and interaction netsMatthieu Perrinel. 73 [doi]
• Anchored LTL separationGrgur Petric Maretic, Mohammad Torabi Dashti, David A. Basin. 74 [doi]
• Separating regular languages with first-order logicThomas Place, Marc Zeitoun. 75 [doi]
• Logics with counting and equivalenceIan Pratt-Hartmann. 76 [doi]
• A functional functional interpretationPierre-Marie Pédrot. 77 [doi]
• ω-regular games over Böhm treesTakeshi Tsukada, C.-H. Luke Ong. 78 [doi]
• Finite-memory strategy synthesis for robust multidimensional mean-payoff objectivesYaron Velner. 79 [doi]
• Faster decision of first-order graph propertiesRyan Williams. 80 [doi]