FoSSaCS 2021 Accepted Papers

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

Who's online

We have 243 guests and no members online

Site Hosted by