| 2018 | A Trace Semantics for System F Parametric Polymorphism. | Guilhem Jaber, Nikos Tzevelekos |
| 2018 | A Theory of Encodings and Expressiveness (Extended Abstract) - (Extended Abstract). | Rob van Glabbeek |
| 2018 | Verifying Higher-Order Functions with Tree Automata. | Thomas Genet, Timothe Haudebourg, Thomas P. Jensen |
| 2018 | Differential Calculus with Imprecise Input and Its Logical Framework. | Abbas Edalat, Mehrdad Maleki |
| 2018 | Modular Tableaux Calculi for Separation Theories. | Simon Docherty, David J. Pym |
| 2018 | The Effects of Adding Reachability Predicates in Propositional Separation Logic. | Stphane Demri, tienne Lozes, Alessio Mansutti |
| 2018 | A Hierarchy of Scheduler Classes for Stochastic Automata. | Pedro R. D'Argenio, Marcus Gerhold, Arnd Hartmanns, Sean Sedwards |
| 2018 | A New Linear Logic for Deadlock-Free Session-Typed Processes. | Ornela Dardha, Simon J. Gay |
| 2018 | Fitch-Style Modal Lambda Calculi. | Ranald Clouston |
| 2018 | Non-angelic Concurrent Game Semantics. | Simon Castellan, Pierre Clairambault, Jonathan Hayman, Glynn Winskel |
| 2018 | A Syntactic View of Computational Adequacy. | Marco Devesas Campos, Paul Blain Levy |
| 2018 | Games on Graphs with a Public Signal Monitoring. | Patricia Bouyer |
| 2018 | Symbolically Quantifying Response Time in Stochastic Models Using Moments and Semirings. | Hugo Bazille, Eric Fabre, Blaise Genest |
| 2018 | Comparator Automata in Quantitative Verification. | Suguman Bansal, Swarat Chaudhuri, Moshe Y. Vardi |
| 2018 | Automata for True Concurrency Properties. | Paolo Baldan, Tommaso Padoan |
| 2018 | Quotient Inductive-Inductive Types. | Thorsten Altenkirch, Paolo Capriotti, Gabe Dijkstra, Nicolai Kraus, Fredrik Nordvall Forsberg |
| 2018 | A Framework for Parameterized Monitorability. | Luca Aceto, Antonis Achilleos, Adrian Francalanza, Anna Inglfsdttir |
| 2018 | Guarded Traced Categories. | Sergey Goncharov, Lutz Schrder |
| 2018 | The Complexity of Graph-Based Reductions for Reachability in Markov Decision Processes. | Stphane Le Roux, Guillermo A. Prez |
| 2017 | Partial Derivatives for Context-Free Languages - From \mu -Regular Expressions to Pushdown Automata. | Peter Thiemann |
| 2017 | Almost Every Simply Typed λ-Term Has a Long β-Reduction Sequence. | Ryoma Sin'ya, Kazuyuki Asada, Naoki Kobayashi, Takeshi Tsukada |
| 2017 | Cyclic Arithmetic Is Equivalent to Peano Arithmetic. | Alex Simpson |
| 2017 | A Light Modality for Recursion. | Paula Severi |
| 2017 | Nominal Automata with Name Binding. | Lutz Schrder, Dexter Kozen, Stefan Milius, Thorsten Wimann |
| 2017 | A Truly Concurrent Game Model of the Asynchronous \pi -Calculus. | Ken Sakayori, Takeshi Tsukada |