| 2021 | "Most of" leads to undecidability: Failure of adding frequencies to LTL. Bartosz Bednarczyk, Jakub Michaliszyn |
| 2021 | A General Semantic Construction of Dependent Refinement Type Systems, Categorically. Satoshi Kura |
| 2021 | A Quantified Coalgebraic van Benthem Theorem. Paul Wild, Lutz Schröder |
| 2021 | A String Diagrammatic Axiomatisation of Finite-State Automata. Robin Piedeleu, Fabio Zanasi |
| 2021 | Adjoint Reactive GUI Programming. Christian Uldal Graulund, Dmitrij Szamozvancev, Neel Krishnaswami |
| 2021 | Certifying Inexpressibility. Orna Kupferman, Salomon Sickert |
| 2021 | Combining Semilattices and Semimodules. Filippo Bonchi, Alessio Santamaria |
| 2021 | Constructing a universe for the setoid model. Thorsten Altenkirch, Simon Boulier, Ambrus Kaposi, Christian Sattler, Filippo Sestini |
| 2021 | Factorization in Call-by-Name and Call-by-Value Calculi via Linear Logic. Claudia Faggian, Giulio Guerrieri |
| 2021 | Fair Refinement for Asynchronous Session Types. Mario Bravetti, Julien Lange, Gianluigi Zavattaro |
| 2021 | Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy. A. R. Balasubramanian, Javier Esparza, Mikhail A. Raskin |
| 2021 | Fixpoint Theory - Upside Down. Paolo Baldan, Richard Eggert, Barbara König, Tommaso Padoan |
| 2021 | Focused Proof-search in the Logic of Bunched Implications. Alexander Gheorghiu, Sonia Marin |
| 2021 | Foundations of Software Science and Computation Structures - 24th International Conference, FOSSACS 2021, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2021, Luxembourg City, Luxembourg, March 27 - April 1, 2021, Proceedings Stefan Kiefer, Christine Tasson |
| 2021 | Generalized Bounded Linear Logic and its Categorical Semantics. Yoji Fukihara, Shin-ya Katsumata |
| 2021 | Interpolation and Amalgamation for Arrays with MaxDiff. Silvio Ghilardi, Alessandro Gianola, Deepak Kapur |
| 2021 | Leafy automata for higher-order concurrency. Alex Dixon, Ranko Lazic, Andrzej S. Murawski, Igor Walukiewicz |
| 2021 | Learning Pomset Automata. Gerco van Heerdt, Tobias Kappé, Jurriaan Rot, Alexandra Silva |
| 2021 | Nominal Equational Problems. Mauricio Ayala-Rincón, Maribel Fernández, Daniele Nantes-Sobrinho, Deivid Vale |
| 2021 | Nondeterministic Syntactic Complexity. Robert S. R. Myers, Stefan Milius, Henning Urbat |
| 2021 | Nondeterministic and co-Nondeterministic Implies Deterministic, for Data Languages. Bartek Klin, Slawomir Lasota, Szymon Torunczyk |
| 2021 | On the Expressiveness of Büchi Arithmetic. Christoph Haase, Jakub Rózycki |
| 2021 | One-way Resynchronizability of Word Transducers. Sougata Bose, Shankara Narayanan Krishna, Anca Muscholl, Gabriele Puppis |
| 2021 | Parametricity for Primitive Nested Types. Patricia Johann, Enrico Ghiorzi, Daniel Jeffries |
| 2021 | Running Time Analysis of Broadcast Consensus Protocols. Philipp Czerner, Stefan Jaax |
| 2021 | Simple Stochastic Games with Almost-Sure Energy-Parity Objectives are in NP and coNP. Richard Mayr, Sven Schewe, Patrick Totzke, Dominik Wojtczak |
| 2021 | The Spirit of Node Replication. Delia Kesner, Loïc Peyrot, Daniel Ventura |
| 2021 | The Structure of Sum-Over-Paths, its Consequences, and Completeness for Clifford. Renaud Vilmart |
| 2021 | Work-sensitive Dynamic Complexity of Formal Languages. Jonas Schmidt, Thomas Schwentick, Till Tantau, Nils Vortmeier, Thomas Zeume |