default search action
24th FoSSaCS@ETAPS 2021: Luxembourg
- Stefan Kiefer, Christine Tasson:
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. Lecture Notes in Computer Science 12650, Springer 2021, ISBN 978-3-030-71994-4 - Thorsten Altenkirch, Simon Boulier, Ambrus Kaposi, Christian Sattler, Filippo Sestini:
Constructing a universe for the setoid model. 1-21 - Mauricio Ayala-Rincón, Maribel Fernández, Daniele Nantes-Sobrinho, Deivid Vale:
Nominal Equational Problems. 22-41 - A. R. Balasubramanian, Javier Esparza, Mikhail A. Raskin:
Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy. 42-61 - Paolo Baldan, Richard Eggert, Barbara König, Tommaso Padoan:
Fixpoint Theory - Upside Down. 62-81 - Bartosz Bednarczyk, Jakub Michaliszyn:
"Most of" leads to undecidability: Failure of adding frequencies to LTL. 82-101 - Filippo Bonchi, Alessio Santamaria:
Combining Semilattices and Semimodules. 102-123 - Sougata Bose, Shankara Narayanan Krishna, Anca Muscholl, Gabriele Puppis:
One-way Resynchronizability of Word Transducers. 124-143 - Mario Bravetti, Julien Lange, Gianluigi Zavattaro:
Fair Refinement for Asynchronous Session Types. 144-163 - Philipp Czerner, Stefan Jaax:
Running Time Analysis of Broadcast Consensus Protocols. 164-183 - Alex Dixon, Ranko Lazic, Andrzej S. Murawski, Igor Walukiewicz:
Leafy automata for higher-order concurrency. 184-204 - Claudia Faggian, Giulio Guerrieri:
Factorization in Call-by-Name and Call-by-Value Calculi via Linear Logic. 205-225 - Yoji Fukihara, Shin-ya Katsumata:
Generalized Bounded Linear Logic and its Categorical Semantics. 226-246 - Alexander Gheorghiu, Sonia Marin:
Focused Proof-search in the Logic of Bunched Implications. 247-267 - Silvio Ghilardi, Alessandro Gianola, Deepak Kapur:
Interpolation and Amalgamation for Arrays with MaxDiff. 268-288 - Christian Uldal Graulund, Dmitrij Szamozvancev, Neel Krishnaswami:
Adjoint Reactive GUI Programming. 289-309 - Christoph Haase, Jakub Rózycki:
On the Expressiveness of Büchi Arithmetic. 310-323 - Patricia Johann, Enrico Ghiorzi, Daniel Jeffries:
Parametricity for Primitive Nested Types. 324-343 - Delia Kesner, Loïc Peyrot, Daniel Ventura:
The Spirit of Node Replication. 344-364 - Bartek Klin, Slawomir Lasota, Szymon Torunczyk:
Nondeterministic and co-Nondeterministic Implies Deterministic, for Data Languages. 365-384 - Orna Kupferman, Salomon Sickert:
Certifying Inexpressibility. 385-405 - Satoshi Kura:
A General Semantic Construction of Dependent Refinement Type Systems, Categorically. 406-426 - Richard Mayr, Sven Schewe, Patrick Totzke, Dominik Wojtczak:
Simple Stochastic Games with Almost-Sure Energy-Parity Objectives are in NP and coNP. 427-447 - Robert S. R. Myers, Stefan Milius, Henning Urbat:
Nondeterministic Syntactic Complexity. 448-468 - Robin Piedeleu, Fabio Zanasi:
A String Diagrammatic Axiomatisation of Finite-State Automata. 469-489 - Jonas Schmidt, Thomas Schwentick, Till Tantau, Nils Vortmeier, Thomas Zeume:
Work-sensitive Dynamic Complexity of Formal Languages. 490-509 - Gerco van Heerdt, Tobias Kappé, Jurriaan Rot, Alexandra Silva:
Learning Pomset Automata. 510-530 - Renaud Vilmart:
The Structure of Sum-Over-Paths, its Consequences, and Completeness for Clifford. 531-550 - Paul Wild, Lutz Schröder:
A Quantified Coalgebraic van Benthem Theorem. 551-571
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.