FoSSaCS 2018 Accepted Papers
- Simon Docherty and David Pym. Modular Tableaux Calculi for Separation Theories
- Luigi Santocanale. The equational theory of the natural join and of inner union is decidable
- Stéphane Le Roux and Guillermo Pérez. The Complexity of Graph-Based Reductions for Reachability in Markov Decision Processes
- Hugo Bazille, Eric Fabre and Blaise Genest. Symbolically Quantifying Response Time in Stochastic Models using Moments and Semirings
- Suguman Bansal, Swarat Chaudhuri and Moshe Vardi. Comparator Automata in Quantitative Verification
- Ranald Clouston. Fitch-Style Modal Lambda Calculi
- Guillaume Rabusseau. Minimization of Graph Weighted Models over Circular Strings
- Delia Kesner, Alejandro Rios and Andres Viso. Call-by-need, neededness and all that
- Thorsten Altenkirch, Paolo Capriotti, Gabe Dijkstra, Nicolai Kraus and Fredrik Nordvall Forsberg. Quotient Inductive-Inductive Types
- Simon Castellan, Pierre Clairambault, Jonathan Hayman and Glynn Winskel. Non-angelic concurrent game semantics
- Patricia Bouyer. Games on graphs with a public signal monitoring
- Ana Sokolova and Harald Woracek. Proper Semirings and Proper Convex Functors
- Pedro R. D'Argenio, Marcus Gerhold, Arnd Hartmanns and Sean Sedwards. A Hierarchy of Scheduler Classes for Stochastic Automata
- Clément Jacq and Paul-André Melliès. Categorical combinatorics for non deterministic strategies on simple games
- Thomas Genet, Timothée Haudebourg and Thomas Jensen. Verifying Higher-Order Functions with Tree Automata
- Ornela Dardha and Simon Gay. A New Linear Logic for Deadlock-Free Session-Typed Processes
- Shin-Ya Katsumata. A Double-Category Theoretic Analysis of Graded Linear Exponential Comonads
- Xinxin Liu, Tingting Yu and Wenhui Zhang. Logics for Bisimulation and Divergence
- Stéphane Demri, Étienne Lozes and Alessio Mansutti. The Effects of Adding Reachability Predicates in Propositional Separation Logic
- Sergey Goncharov and Lutz Schröder. Guarded Traced Symmetric Monoidal Categories
- Guilhem Jaber and Nikos Tzevelekos. A Trace Semantics for System F Parametric Polymorphism
- Étienne Miquey and Hugo Herbelin. Realizability interpretation and normalization of typed call-by-need λ-calculus with control
- Bernardo Toninho and Nobuko Yoshida. Depending on Session-Typed Processes
- Paolo Baldan and Tommaso Padoan. Automata for True Concurrency Properties
- Luca Aceto, Antonis Achilleos, Adrian Francalanza and Anna Ingolfsdottir. A Framework for Parameterized Monitorability
- Gabriel Scherer, Max New, Nicholas Rioux and Amal Ahmed. FabULous Interoperability for ML and a Linear Language
- Marco Devesas Campos and Paul Levy. A Syntactic View of Computational Adequacy
- Amr Sabry, Juliana Vizzotto and Benoît Valiron. From Symmetric Pattern-Matching to Quantum Control
- Sławomir Lasota and Radosław Piórkowski. WQO Dichotomy for 3-graphs
- Rob van Glabbeek. A Theory of Encodings and Expressiveness
- Abbas Edalat and Mehrdad Maleki. Differential Calculus with Imprecise Input and its Logical Framework