default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID29th FoSSaCS 2026: Turin, Italy
- Nathalie Bertrand
, Stefan Milius:
Foundations of Software Science and Computation Structures - 29th International Conference, FoSSaCS 2026, Held as Part of the International Joint Conferences on Theory and Practice of Software, ETAPS 2026, Turin, Italy, April 11-16, 2026, Proceedings. Lecture Notes in Computer Science 16503, Springer 2026, ISBN 978-3-032-22729-4 - Jirí Adámek:
Varieties of Quantitative Algebras Presented by 1-Basic Monads. 1-20 - Quentin Aristote, Daniela Petrisan:
Learning Bottom-Up Tree Automata Valued in Monoidal Categories. 21-42 - Sarvin Bahmani, Rasmus Ibsen-Jensen, Soumyajit Paul, Sven Schewe, Friedrich Slivovsky, Qiyi Tang, Dominik Wojtczak, Shufang Zhu:
The Complexity of Games with Randomised Control. 43-64 - Clotilde Bizière, Jérôme Leroux, Grégoire Sutre:
Bridging the Gap Between Plain VASS and Branching VASS. 65-87 - Filippo Bonchi, Cipriano Junior Cioffo:
Tapes as Stochastic Matrices of String Diagrams. 88-109 - Laura Bozzelli, Tadeusz Litak, Munyque Mittelmann, Aniello Murano:
Inquisitive Team Semantics of LTL. 110-132 - Béatrice Bérard, Benjamin Monmege, B. Srivathsan, Arnab Sur:
Synthesising Asynchronous Automata from Fair Specifications. 133-152 - Marco Campion, Isabella Mastroeni, Michele Pasqua, Caterina Urban:
Abstract Lipschitz Continuity - Combining Semantic and Quantitative Approximations. 153-177 - Yorgo Chamoun, Samuel Mimram:
Realization of Relational Presheaves. 178-197 - Xiaohong Chen, Horatiu Cheval, Dorel Lucanu, Grigore Rosu:
$\mathbb {K}$ Definitions as Matching Logic Theories, Formally. 198-219 - Liam Chung, Tobias Kappé:
Partial Reductions for Kleene Algebra with Linear Hypotheses. 220-239 - Noé Delorme, Simon Perdrix:
Diagrammatic Reasoning with Control as a Constructor, Applications to Quantum Circuits. 240-261 - Mariangiola Dezani-Ciancaglini, Besik Dundua, Furio Honsell:
Lambda Galore. 262-284 - Bernd Finkbeiner, Hadar Frenkel, Tim Rohde:
Complexity of Model Checking Second-Order Hyperproperties on Finite Structures. 285-306 - Aidan Healy, Bartek Klin:
Karp's NP-Complete Problems over First-Order Definable Structures. 307-327 - Robert M. Hierons, Mohammad Reza Mousavi:
Complete FSM Testing Using Strong Separability. 328-349 - Mayuko Kori, Kazuki Watanabe:
A No-go Theorem for Coalgebraic Product Construction. 350-371 - Adrienne Lancelot, Giulio Manzonetto, Guy McCusker, Gabriele Vanoni:
Interaction Improvement. 372-395 - Mathieu Lehaut, Anca Muscholl, Nir Piterman:
From Trees to Tree-Like: Distribution and Synthesis for Asynchronous Automata. 396-417 - Thea Li, Vladimir Zamdzhiev:
Quantum Coherence Spaces Revisited: A von Neumann (Co)Algebraic Approach. 418-439 - Nathan Lhote, Aliaume Lopez, Lia Schütze:
Well-quasi-orderings on word languages. 440-461 - Natasha Fernandes, Annabelle McIver, Parastoo Sadeghi:
Composition Theorems for f-Differential Privacy. 462-483 - Hernán C. Melgratti, Claudio Antares Mezzina, G. Michele Pinna:
On Reversibility in Petri Nets. 484-504 - Yoshiki Nakamura:
A Complete Propositional Dynamic Logic for Regular Expressions with Lookahead. 505-526 - Jakob Piribauer, Vinzent Zschuppe:
The Modal Logic of Abstraction Refinement. 527-548 - Benjamin Plummer, Corina Cîrstea:
A Coalgebraic Approach to Infinite Games. 549-570 - Adrien Pommellet, Amazigh Amrane, Edgar Delaporte, Geoffroy Du Prey, Oscar Peyron:
Active Learning Techniques for Pomset Recognizers. 571-592 - Matteo Spadetto:
A 2-categorical approach to the semantics of dependent type theory with computation axioms. 593-615 - Quentin Guilmant, Joël Ouaknine, Isa Vialard:
The Value Problem for Weighted Timed Games with Two Clocks is Undecidable. 616-635 - Paul Wild, Lutz Schröder, Karla Messing, Barbara König, Jonas Forster:
Generalized Kantorovich-Rubinstein Duality beyond Hausdorff and Kantorovich. 636-657
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.
last updated on 2026-09-01 03:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
