FoSSaCS 2026

The conference invites submissions on theories and methods to support the analysis, integration, synthesis, transformation, and verification of programs and software systems. The specific topics covered by the conference include, but are not limited to, the following:

• categorical models and logics;
• language theory, automata, and games;
• modal, spatial, and temporal logics;
• type theory and proof theory;
• concurrency theory and process calculi;
• rewriting theory;
• semantics of programming languages;
• program analysis, correctness, transformation, and verification;
• logics of programming;
• software specification and refinement;
• models of concurrent, reactive, stochastic, distributed, hybrid, and mobile systems;
• emerging models of computation;
• logical aspects of computational complexity;
• models of software security;
• logical foundations of data bases

Please find a list of accepted papers below:

• Paul Wild, Lutz Schröder, Karla Messing, Barbara König and Jonas Forster. Generalized Kantorovich-Rubinstein Duality beyond Hausdorff and Kantorovich
• Liam Chung and Tobias Kappé. Partial Reductions for Kleene Algebra with Single-Word Hypotheses
• Quentin Aristote and Daniela Petrisan. Learning bottom-up tree automata valued in monoidal categories
• Benjamin Plummer and Corina Cirstea. A Coalgebraic Approach to Infinite Games
• Aliaume Lopez, Nathan Lhote and Lia Schuetze. Well-quasi-orderings on word languages
• Jiri Adamek. Quantitative Algebras Presented via Monads
• Jakob Piribauer and Vinzent Zschuppe. The Modal Logic of Abstraction Refinement
• Matteo Spadetto. A 2-categorical approach to the semantics of dependent type theory with computation axioms
• Noé Delorme and Simon Perdrix. Diagrammatic Reasoning with Control as a Constructor, Applications to Quantum Circuits
• Marco Campion, Isabella Mastroeni, Michele Pasqua and Caterina Urban. Abstract Lipschitz Continuity: Combining Semantic and Quantitative Approximations
• Mariangiola Dezani-Ciancaglini, Besik Dundua and Furio Honsell. Lambda Galore
• Adrien Pommellet, Amazigh Amrane, Edgar Delaporte, Geoffroy Du Prey and Oscar Peyron. Active Learning Techniques for Pomset Recognizers
• Mayuko Kori and Kazuki Watanabe. A No-go Theorem for Coalgebraic Product Construction
• Aidan Healy and Bartek Klin. Karp’s NP-complete problems over first-order definable structures
• Xiaohong Chen, Horatiu Cheval, Dorel Lucanu and Grigore Rosu. K Definitions as Matching Logic Theories, Formally
• Laura Bozzelli, Tadeusz Litak, Munyque Mittelmann and Aniello Murano. Inquisitive team semantics of LTL
• Annabelle McIver, Natasha Fernandes and Parastoo Sadeghi. Composition Theorems for f-Differential Privacy
• Sarvin Bahmani, Rasmus Ibsen-Jensen, Soumyajit Paul, Sven Schewe, Friedrich Slivovsky, Qiyi Tang, Dominik Wojtczak and Shufang Zhu. The Complexity of Games with Randomised Control
• Robert Hierons and Mohammad Reza Mousavi. Complete FSM Testing Using Strong Separability
• Thea Li and Vladimir Zamdzhiev. Quantum Coherence Spaces Revisited: A von Neumann (Co)Algebraic Approach
• Isa Vialard, Joël Ouaknine and Quentin Guilmant. The Value Problem for Weighted Timed Games with Two Clocks is Undecidable
• Mathieu Lehaut, Anca Muscholl and Nir Piterman. From Trees to Tree-Like: Distribution and Synthesis for Asynchronous Automata
• Yoshiki Nakamura. A Complete Propositional Dynamic Logic for Regular Expressions with Lookahead
• Adrienne Lancelot, Giulio Manzonetto, Guy McCusker and Gabriele Vanoni. Interaction Improvement
• Filippo Bonchi and Cipriano Junior Cioffo. Tapes as Stochastic Matrices of String Diagrams
• Hernán Melgratti, Claudio Antares Mezzina and G. Michele Pinna. On Reversibility in Petri Nets
• Yorgo Chamoun and Samuel Mimram. Realization of relational presheaves
• Béatrice Bérard, Benjamin Monmege, B Srivathsan and Arnab Sur. Synthesising Asynchronous Automata from Fair Specifications
• Bernd Finkbeiner, Hadar Frenkel and Tim Rohde. Complexity of Model Checking Second-Order Hyperproperties on Finite Structures
• Clotilde Bizière, Jérôme Leroux and Grégoire Sutre. Bridging the Gap Between Plain VASS and Branching VASS

The FoSSaCS 2026 proceedings will be published in Springer LNCS. In addition, there will be a special issue of the diamond open-access journal Logical Methods in Computer Science with extended version of selected papers from the conference.

FoSSaCS solicits just a single paper category—research papers. The page limit is 18 pp excluding references, respecting the Springer’s LNCS format at the submission time. Additional material (no page limit) can be placed in a clearly marked appendix, at the end of the paper.

Program Committee (PC) members of FoSSaCS will be allowed to submit up to one paper to FoSSaCS. These submissions will be held to a higher acceptance threshold – for example, PC submissions will not be part of the final vote.

The paper review process will be double-blind. Authors must make a good faith effort to anonymize their submissions, and they should not identify themselves either explicitly or by implication (e.g. through the references or acknowledgments).

The important dates are available in the Joint Call for Papers.

The papers can be submitted here.

FoSSaCS 2026 will have a post-paper-acceptance voluntary artifact evaluation. Authors will be encouraged to submit artifacts for evaluation after paper notification. The outcome will not alter the paper’s acceptance decision.

For more information about FoSSaCS artifact evaluation, please contact Guillermo Alberto Perez.

Detailed information can be found here.

PC Chairs

• Nathalie Bertrand (Inria Rennes, France)
• Stefan Milius (Friedrich-Alexander Universität Erlangen-Nürnberg, Germany)

PC Members

• Franz Baader (TU Dresden, Germany)
• Tegan Brennan (Stevens Institute of Technology, USA)
• Yijia Chen (Shanghai Jiao Tong University, China)
• Pierre Clairambault (CNRS, France)
• Pedro D’Argenio (Universidad Nacional de Córdoba, Argentina)
• Ugo Dal Lago (University of Bologna, Italy)
• Laure Daviaud (University of East Anglia, UK)
• Stephane Demri, (CNRS, France)
• Josee Desharnais (Université Laval, Canada)
• Jérémy Dubut (École Polytechnique, France)
• Maribel Fernandez (King’s College London, UK)
• Bernd Finkbeiner (CISPA Helmholtz Center for Information Security, Germany)
• Wan Fokkink (Vrije Universiteit Amsterdam, The Netherlands)
• Jean Goubault-Larrecq (ENS Paris Saclay, France)
• Bart Jacobs (Radboud University Nijmegen, The Netherlands)
• Shin-ya Katsumata (Kyoto Sangyo University, Japan)
• Sławek Lasota (University of Warsaw, Poland)
• Alessio Mansutti (IMDEA Software Institute, Spain)
• Anca Muscholl (Université de Bordeaux, France)
• Elaine Pimentel (University College London, UK)
• Alexandra Silva (Cornell University, USA)
• Rui Soares Barbosa (International Iberian Nanotechnology Laboratory, Portugal)
• Pawel Sobocinski (Tallinn University of Technology, Estonia)
• Srivathsan (Chennai Mathematical Institute, India)
• Christine Tasson (ISAE Supaero, France)
• Rob van Glabbeek (University of Edinburgh, UK)
• Frits Vaandrager (Radboud University, The Netherlands)
• Martin Zimmermann (Aalborg University, Denmark)