2026-02-25

[Caml-list] RExAI Call for Papers

Call for Papers: RExAI 2026
International Workshop on Formal Requirements Engineering and Artificial Intelligence
May 4, 2026
co-located with NFM 2026 (May 5 - May 7, 2026), Los Angeles, California, USA

Overview
This workshop explores the intersection of formal requirements engineering and artificial intelligence (AI), addressing a central challenge in modern software and AI system development: how to precisely specify requirements for increasingly complex, heterogeneous, and autonomous systems, and how to verify and validate that such systems meet those requirements.

As AI technologies become deeply embedded in safety and mission-critical domains, from autonomous vehicles to medical diagnostics, financial systems to industrial automation and space exploration, the need for rigorous, formal approaches to requirements is becoming increasingly important. At the same time, traditional requirements engineering methods face new challenges when applied to systems with learning-enabled components, unpredictable behaviors, and emergent properties. The opacity of AI models and the semantic gap between high-level requirements and low-level model inputs and internals create significant impediments to verifying and validating that such systems meet their specified requirements.

The workshop welcomes extended abstract contributions on formal specification languages for AI systems, verification and validation techniques, requirements for trustworthy AI, case studies from real-world applications, and novel applications of AI to requirements engineering itself. We aim to foster dialogue between communities that have traditionally worked separately, building bridges toward more reliable, safe, and trustworthy AI systems grounded in rigorous requirements practices. Extended abstracts can summarize and cite results from recent published paper(s) and/or state your perspective.

Areas of interest include but are not limited to:




Important dates:
Paper submission guidelines
We invite extended abstracts of 2-4 pages (excluding references) in LNCS format, https://www.springer.com/gp/computer-science/lncs/conference-proceedings-guidelines. All submissions must be in English and fall into one of the following categories:
Please note that:
All submissions will be reviewed by members of the Program Committee. The paper review process is single-blind, which means that the author identities are not required to be anonymous and are visible to the PC members/reviewers, but reviewer identities are not visible to the authors. No special efforts are required to anonymize content in the paper (such as referencing the authors' prior work).
Policy on the use of Gen AI (same as NFM)
We understand the convenience afforded by the use of generative AI-based large language models to produce text in the submitted manuscript. However, we strongly encourage the authors to check the generated text for factual errors and inconsistencies. We encourage the authors to adopt appropriate standards for citing products obtained using generative AI (such as text, tables, graphics). Use of AI-based coding assistants is permitted, and we encourage authors to disclose the use of such tools as the community may find this scientifically interesting.
Submission will be via the OpenReview link:
To submit a paper on OpenReview, you must first create a profile and log in to the system. Then, navigate to the specific conference or venue's page on OpenReview, find the "Conference Submission" link, and click on it. Fill out the submission form, which will prompt you for paper details like title, authors, abstract, and keywords, before uploading the PDF of your paper.
Step-by-Step Submission Process
Important Considerations
 Chairs

2026-02-19

[Caml-list] FLoC Workshops - All the Calls

@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@

https://teal.cs.brown.edu/floc2026/
TEAL 2026: Tools for Educational Activities in Logic

@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@

Theorem Proving Components for Educational Software (ThEdu)
https://theduworkshop.github.io/ThEduWebSite/#thedu26-presentation

@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@

24th International Workshop on Satisfiability Modulo Theories (SMT)
https://smt-workshop.cs.uiowa.edu/2026/

@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@

====================================================
Call for Papers
UNIF 2026
The 40th International Workshop on Unification
July 24, 2026, Lisbon, Portugal
https://www.risc.jku.at/conferences/unif2026/
====================================================

UNIF 2026 is the 40th event in a series of international meetings devoted to unification theory and its applications. Unification is concerned with the problem of making two terms equal, finding solutions for equations or making formulas equivalent. It is a fundamental process used in a number of fields of computer science, including automated reasoning, term rewriting, logic programming, natural language processing, program analysis, types, etc.

The International Workshop on Unification (UNIF) is a yearly forum for researchers in unification theory and related fields to meet old and new colleagues, to present recent (even unfinished) work, and to discuss new ideas and trends. It is also a good opportunity for young researchers and scientists working in related areas to get an overview of the state of the art in unification theory.

Topics of interest to this forum include, but are not limited to:
- Syntactic and equational unification algorithms
- Matching and Constraint Solving
- Higher-Order Unification
- Unification in modal, fuzzy, temporal and description logics
- Anti-unification/generalization
- Semi-unification
- Disunification
- Narrowing
- Admissibility of Inference Rules
- Combination problems
- Formalization of unification and related techniques
- Complexity Issues
- Implementation techniques
- Applications

The 40th International Workshop on Unification is part of FLoC'26, affiliated with FSCD 2026 and IJCAR 2026.

** Important Dates

May 7, 2026: paper submission deadline.
May 29, 2026: author notification.
June 13, 2026: camera-ready paper submission deadline.
July 24, 2026: UNIF 2026 in Lisbon.

@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@

Call for papers: Isabelle Workshop 2026 (FLoC Lisbon)
=====================================================

Website: https://sketis.net/isabelle/isabelle-workshop-2026
Where: Lisbon (Portugal), associated with ITP and IJCAR, as part of FLoC
When: 24..25-Jul-2025 (UTC+1)

What:
This informal workshop will bring together users and developers of the
interactive theorem prover Isabelle. The year 2026 is special due to 40th
anniversary of Isabelle, so we allocate 2 full days for the event.

Important Dates:
- Paper submission deadline: 09-May-2026 (AoE)
- Notification of acceptance: 01-Jun-2026 (UTC+0)

Organisers and Program Chairs:
- Jasmin Blanchette
- Dmitry Traytel
- Makarius Wenzel

@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@

VAMPIRE 2026

The Vampire 2026 workshop will discuss recent developments in
implementation,
application, evaluation and comparison of first-order theorem provers,
including but not limited to Vampire, and their interaction with other
systems.

We seek submissions reporting on but not limited to:
- prerequisites for substantial progress in theorem proving tools
- implementation principles and practice
- heuristics and strategies for different application areas
- case studies, successful and unsuccessful
- missing features in modern theorem provers

Submissions can be in any form, ranging from work in progress to completed
work. For example, the users can submit:
- extended abstracts or full papers;
- theoretical papers;
- experimental papers and case studies;
- or in general any papers that can benefit tool developers and users.
Papers can be of any length, ranging from 1-page abstracts to full papers up
to 20 pages in length. The papers should use the EasyChair templates, which
can be found at https://easychair.org/publications/for_authors

Submissions should be made using the FLoC system, via the link
https://submissions.floc26.org/vampire/

The workshop post-proceedings will be published within the EasyChair EPiC
Series in Computing.

Important dates:
Paper submission: May 29, 2026 (AoE)
Notification of acceptance: June 5, 2026
Workshop: July 24, 2026

@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@

PAAR-2026: 10TH WORKSHOP ON PRACTICAL ASPECTS OF AUTOMATED REASONING
-- co-located with IJCAR 2026 --
-- as part of FLoC 2026 --

July 25, 2026, Lisbon, Portugal

Web site: https://paar2026.github.io/
Submission link: https://submissions.floc26.org/paar
Abstract registration deadline: April 14, 2026
Submission deadline: April 21, 2026
* Jan Jakubuv, Czech Technical University in Prague, CZ
* Cezary Kaliszyk, University of Melbourne, AU
* Daniela Kaufmann, TU Wien, AT
* Boris Konev, University of Liverpool, UK
* Daniel Le Berre, CNRS - Universit� d?Artois, FR
* Ondrej Lengal, Brno University of Technology, CZ
* Tomer Libal, University of Luxembourg, LU
* Michael Rawson, University of Southampton, UK
* Philipp Ruemmer, Uppsala University, SE
* Renate A. Schmidt, The University of Manchester, UK
* Stephan Schulz, DHBW Stuttgart, DE
* Frieder Stolzenburg, Harz University of Applied Sciences, DE
* Geoff Sutcliffe, University of Miami, US
* Sophie Tourret, Inria and MPI for Informatics, DE
* Zsolt Zombori, Alfr�d R�nyi Institute of Mathematics, Hungarian Academy of Sciences, HU

Publication
-----------
PAAR proceedings will be published electronically in a workshop
proceedings venue (such as CEUR workshop proceedings or
EasyChair Kalpa proceedings).

Venue
-----
IJCAR 2026 in Lisbon, Portugal

Important dates
---------------
* Abstract submission: April 14, 2026
* Paper submission: April 21, 2026
* Author notification: May 12, 2026
* Camera-ready paper versions due: July 1, 2026
* Workshop: July 25, 2026

@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@

WST 2026 - First Call for Papers
21st International Workshop on Termination
https://termination-portal.org/wiki/21st_International_Workshop_on_Termination

July 25, 2026, Lisbon, Portugal

Affiliated with IJCAR, July 26-29, 2026

The Workshop on Termination (WST) traditionally brings together, in an
informal setting, researchers interested in all aspects of
termination, whether this interest be practical or theoretical,
primary or derived. The workshop also provides a ground for
cross-fertilization of ideas from the different communities interested
in termination (e.g., working on computational mechanisms, programming
languages, software engineering, constraint solving, etc.). The
friendly atmosphere enables fruitful exchanges leading to joint
research and subsequent publications.

The workshop is held as part of the 2026 Federated Logic Conference
(FLoC 2026 https://www.floc26.org) and is affiliated with the
13th International Joint Conference on Automated Reasoning
(IJCAR 2026 https://www.floc26.org/ijcar).

IMPORTANT DATES

- title and abstract submission: April 28, 2026
- submission: May 5, 2026
- notification: May 26, 2026
- early registration: June 1, 2026
- final version: June 26, 2026
- workshop: July 25, 2026

@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@

Termination and Complexity Competition 2026

http://www.termination-portal.org/wiki/Termination_Competition_2026

Call for Participation

Since the beginning of the millennium, many research groups developed tools for fully automated termination and complexity analysis.

After a tool demonstration at the 2003 Termination Workshop in Valencia, the community decided to start an annual termination competition to spur the development of tools and termination techniques.

The termination and complexity competition focuses on automated termination and complexity analysis for all kinds of programming paradigms, including categories for term rewriting, imperative programming, logic programming, and functional programming. In all categories, we also welcome the participation of tools providing certifiable proofs. The goal of the termination and complexity competition is to demonstrate the power of the leading tools in each of these areas.

The competition will be affiliated with the International Workshop on Termination (WST 2026, https://termination-portal.org/wiki/21st_International_Workshop_on_Termination), which takes place at the Federated Logic Conference (FLoC 2026, https://www.floc26.org). It will be run on the RWTH University HPC cluster. The final run will be in parallel to the FLoC workshops on July 24th and 25th. The results will be presented at WST, and presumably also at IJCAR.

We strongly encourage all developers of termination and complexity analysis tools to participate in the competition. We also welcome the submission of termination and complexity problems, especially problems that come from applications.

A category is only run in the competition if there are at least 2 participants, at least 40 examples for this category in the underlying termination problem data base, and clearly defined rules. If there is no category that is convenient for your tool, you can contact the organizers, since other categories can be considered as well if enough participants are guaranteed.

For further information, we refer to the website of the termination and complexity competition: https://termination-portal.org/wiki/Termination_Competition_2026

Important dates
Tool and Benchmark Submission: June 26
Full Run: July 13-17
Live Run: July 24/25

@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@

2026-01-23

[Caml-list] MFCS 2026 - First Call for Papers

========================================================

MFCS 2026 - First Call for Papers

========================================================

The 51th conference on Mathematical Foundations of Computer Science (MFCS) will take place in:

Paris, France August 24th-28th, 2026

MFCS is among the conferences with the longest history in the field — the first conference in the series was held already in 1972. Traditionally, the conference moved between the Czech Republic, Poland, and Slovakia; since 2013, the conference has traveled around Europe.

The conference will be preceded, on August 23, by the Young Research Forum Workshop intended for students and postdocs.


NEW: Up to 10 papers will be accepted by the program committee, for which no presence onsite is required.

========================================================

Important dates and information

========================================================

Submissions: April 24th, 2026

Author notification: June 19th, 2026

Camera-ready version: June 26th, 2026

Conference: August 24th-28th, 2026 (YRF Workshop on August 23rd, afternoon)

Deadlines are firm; late submissions will not be considered. All dates are AoE.

Conference website: https://mfcs2026.irif.fr/

========================================================

Submission guidelines

========================================================

1) Papers must present original research on the theory of computer science. No prior publication and no simultaneous submission to other publication outlets (either a conference or a journal) is allowed. Authors are encouraged to also make full versions of their submissions freely accessible in an on-line repository such as arXiv.

2) Submissions take the form of an extended abstract of up-to 12 pages (LIPIcs document class), excluding title page, references and a clearly labelled appendix. The appendix may consist either of omitted proofs or of a full version of the submission, and it will be read at the discretion of program committee members. The extended abstract has to present the merits of the paper and its main contributions clearly, and describe the key concepts and technical ideas used to obtain the results. Submissions must provide the proofs which can enable the main mathematical claims of the paper to be verified.

3) Submissions authored or co-authored by members of the program committee are allowed.

4) At the time of submission, authors may declare that they are unable to attend the conference in Paris and therefore cannot give an in-person presentation. This choice will not influence the evaluation of submissions by the Program Committee. The Program Committee will rank all papers irrespective of their presentation status. Approximately 80 papers will be selected for in-person presentation, and up to 10 papers will be accepted without presentation. All accepted papers will be published in the same proceedings. This option is intended for authors who wish to publish their results at the conference but, for various reasons (e.g., family or financial constraints), are unable to attend the conference in person.

5) At least one author of each accepted paper with presentation is expected to register for the conference, and give the talk in-person. At least one author of each accepted paper without in-person presentation is expected to register for the conference for a reduced fee, and for each such paper the authors are expected to provide a pre-recorded video of the paper presentation that will be made available on-line during the conference. (Pre-recorded videos of the other papers are optional.)

6) Papers authored only by students should be marked as such at the time of submission in order to be eligible for the best student paper award.

7) MFCS proceedings are published in the Leibniz International Proceedings in Informatics (LIPIcs) series. The camera-ready version of accepted papers will need to comply with the LIPIcs style.

========================================================

MFCS 2025 Programme Committee

========================================================

Michal Koucký (Charles University, Czech Republic) - chair
Daniela Petrișan (Université Paris Cité, IRIF, France) - co-chair

C. Aiswarya (Chennai Mathematical Institute, India)
Christel Baier (Technische Universität Dresden, Germany)
Ivona Bezáková (Rochester Institute of Technology, USA)
Markus Bläser (Saarland University, Germany)
Achim Blumensath (Masaryk University, Czech Republic)
Martin Böhm (University of Wrocław, Poland)
Édouard Bonnet (CNRS, ENS de Lyon, France)
Joshua Brakensiek (University of California, Berkeley, USA)
André Chailloux (Inria de Paris, France)
Panagiotis Charalampopoulos (King's College London, UK)
Lorenzo Clemente (University of Warsaw, Poland)
Ugo Dal Lago (University of Bologna, Italy)
Debarati Das (Pennsylvania State University, USA)
Samir Datta (Chennai Mathematical Institute, India)
Jakub Gajarský (Masaryk University and University of Warsaw, Czech Republic/Poland)
Anna Gál (University of Texas at Austin, USA)
Sumegha Garg (Rutgers University, USA)
Mayank Goswami (City University of New York, USA)
Florian Horn (Université Paris Cité, IRIF, CNRS, France)
Dušan Knop (Czech Technical University, Czech Republic)
Hanna Komlos (Max Planck Institute for Informatics, Germany)
Stephan Kreutzer (TU Berlin, Germany)
Bruno Loff (University of Lisbon, Portugal)
Wolfgang Merkle (Heidelberg University, Germany)
Igor Carboni Oliveira (University of Warwick, UK)
Kristýna Pekárková (AGH University of Krakow, Poland)
Thomas Place (University of Bordeaux, LABRI, France)
Cécilia Pradic (Swansea University, UK)
Jakub Przybyło (AGH University of Krakow, Poland)
Colin Riba (ENS de Lyon, LIP, France)
Kilian Risse (Lund University, Sweden)
Robert Robere (McGill University, Canada)
Michał Skrzypczak (University of Warsaw, Poland)
Paweł Sobociński (TalTech, Estonia)
Henning Urbat (FAU Erlangen-Nürnberg, Germany)
Pavel Veselý (Charles University, Czech Republic)
Philip Wellnitz (National Institute of Informatics, Japan)
Sarah Winter (Université Paris Cite, IRIF, CNRS, France)
James Worrell (University of Oxford, UK)
Standa Živný (University of Oxford, UK)
==========================================

2026-01-15

[Caml-list] Call For Papers: 6th Workshop on Program Equivalence and Relational Reasoning (PERR2026 @ CAV/FLOC)

[with apologies for cross-postings]

======================================================================

       6th Workshop on Program Equivalence and Relational Reasoning
                24 July 2026 at ISCTE campus, Lisbon, Portugal
                  associated with CAV 2026 at FLOC 2026
                   https://perr-workshop.github.io/2026

======================================================================

Submission Deadline: Friday, 24 April, 2026 (AoE)


CALL FOR PAPERS/PRESENTATIONS

PERR is an annual international workshop dedicated to the formal verification of program equivalence and related relational problems. It is the 6th in a series of meetings that bring together researchers from different areas interested in equivalence and related questions. PERR 2026 will be a workshop at FLOC 2026, and a satellite event to CAV 2026.

Program equivalence is arguably one of the most interesting and at the same time important problems in formal verification. It is a cross-cutting topic that has attracted the interest of several research communities: the field of denotational (game) semantics, deductive software verification, bounded model checking, specification inference, software evolution and regression testing, etc.

The goal of the workshop is to bring researchers of the different fields in touch and to stimulate an exchange of ideas leading to forging a community working on PERR. It welcomes contributions from the topics mentioned above but is also open to new questions regarding program equivalence. This includes related research areas of relational reasoning like program refinement or the verification of hyperproperties, in particular of secure information flow.

      - regression verification
      - program equivalence
      - equivalence of higher order programs
      - product programs, relational calculi
      - verification of hyperproperties
      - program refinement, refinement calculus
      - specification of differences between programs
      - inferring semantic differences between programs
      - transformation validation
      - correct compiler transformations
      - automata bisimulation
      - AI-supported equivalence checking 
      - relational properties of AI-based systems
      - code equivalence checking in teaching and marking

This is an informal workshop that welcomes work in progress, overviews of more extensive work, programmatic or position papers and tool presentations.

SUBMISSION GUIDELINES

We invite two types of submissions:

      - Regular papers. Regular papers should be at most 15 pages (excluding references). They should present original research results, tools, or case studies.

      - Extended Abstracts. Extended abstracts should be at most 3 pages (excluding references). They should introduce work that has recently been published or is under review, or work in progress.

Submissions should be made using the PERR 2026 submission site:


Submissions must be a single PDF file, in LNCS format. 

The workshop will have informal proceedings, posted on the webpage, and speakers will be asked to consider submitting papers towards a post-proceedings volume.

IMPORTANT DATES

    Submission Deadline: Friday, 24 April, 2026 (AoE)
    Notification: Thursday, 28 May, 2026
    Workshop: Friday, 24 July, 2026

ORGANIZERS

    Mattias Ubrich, Karlsruhe Institute of Technology, Germany
    Dragana Milovancevic, Imperial College London, UK

2026-01-09

[Caml-list] FSCD 2026: Second Call for Papers

======================================================================
Updated information on: invited speakers, affiliated workshops
======================================================================
SECOND CALL FOR PAPERS
Eleventh International Conference on
Formal Structures for Computation and Deduction (FSCD 2026)
July 20-23, Lisbon, Portugal
https://fscd-conference.org/2026
Part of the Ninth Federated Logic Conference (FLoC 2026)


IMPORTANT DATES
---------------
All deadlines are midnight anywhere-on-earth (AoE); late submissions
will not be considered.

Abstract: January 23, 2026
Submission: January 30, 2026
Author Response: March 23-27, 2026
Notification: April 16, 2026
Final version: April 30, 2026


INVITED SPEAKERS
----------------
Andrej Bauer University of Ljubljana (FSCD Invited Speaker)
Laura Kovács Vienna University of Technology - TU Wien (FSCD
Invited Speaker)

Alessandra Russo Imperial College London (FLoC Keynote Speaker)
Giuseppe De Giacomo University of Oxford (FLoC Plenary Speaker)


AFFILIATED WORKSHOPS
--------------------
IFIP-WG1.6: Annual Meeting of the IFIP Working Group 1.6 on Rewriting
(July 18, Invited talks only)
ITRS: 12th Workshop on Intersection Types and Related Systems (July 18)
MSFP: 11th Workshop on Mathematically Structured Functional Programming
(July 18)
TGD: Tribute to Gilles Dowek (July 18)
GALOP: 17th Workshop on Games for Logic and Programming Languages (July
18-19)
LSFA: 21st International Symposium on Logical and Semantic Frameworks
with Applications (July 18-19)
TLLA: 10th International Workshop on Trends in Linear Logic and
Applications (July 18-19)
TERMGRAPH: 14th International Workshop on Computing with Terms and
Graphs (July 19)
WPTE: 12th International Workshop on Rewriting Techniques for Program
Transformations and Evaluation (July 19)
IWC: 15th International Workshop on Confluence (July 24)
LFMTP: Logical frameworks and meta-languages: Theory and Practice (July 24)
UNIF: 40th International Workshop on Unification (July 24)


OVERVIEW
--------
FSCD (https://fscd-conference.org/) covers all aspects of formal
structures for computation and deduction, from theoretical foundations
to applications. Building on two communities, RTA (Rewriting Techniques
and Applications) and TLCA (Typed Lambda Calculi and Applications), FSCD
embraces their core topics and broadens their scope to closely related
areas in logic, models of computation, semantics and verification in new
challenging areas.

The suggested, but not exclusive, list of topics for submission is:

1. Calculi:
- Rewriting systems (string, term, higher-order, nominal, graph,
conditional, modulo, infinitary, etc.);
- Lambda calculus;
- Logics (first-order, higher-order, equational, modal, linear,
classical, constructive, etc.);
- Proof theory (natural deduction, sequent calculus, proof nets, etc.);
- Type theory and logical frameworks;
- Homotopy type theory;
- Process algebras (synchronous, asynchronous, static and dynamic
semantics with and without time, etc.);
- Quantum calculi.

2. Methods in Computation and Deduction:
- Type systems (polymorphism, dependent, recursive, intersection,
session, etc.);
- Induction, coinduction;
- Matching, unification, completion, orderings;
- Strategies (normalisation, completeness, etc.);
- Tree automata;
- Model building and model checking;
- Proof search and theorem proving;
- Constraint solving and decision procedures.

3. Semantics:
- Operational semantics and abstract machines;
- Game Semantics and applications;
- Domain theory and categorical models;
- Quantitative models (timing, probabilities, etc.);
- Quantum computation and emerging models of computation.

4. Algorithmic Analysis and Transformations of Formal Systems:
- Type inference and type checking;
- Abstract Interpretation;
- Complexity analysis and implicit computational complexity;
- Checking termination, confluence, derivational complexity and related
properties;
- Symbolic computation.

5. Tools and Applications:
- Programming and proof environments;
- Verification tools;
- Proof assistants and interactive theorem provers;
- Applications in industry;
- Applications of formal systems in other sciences;
- Applications of formal systems in education.

6. Formal Systems for Modelling and Verification in new challenging areas:
- Certification;
- Security;
- Blockchain;
- Databases;
- Deep learning and machine learning algorithms;
- Planning.

PUBLICATION
-----------
The proceedings will be published as an electronic volume in the Leibniz
International Proceedings in Informatics (LIPIcs) of Schloss Dagstuhl.
All LIPIcs proceedings are open access.

SPECIAL ISSUE
-------------
There will be a special issue of Logical Methods in Computer Science of
selected papers. More details will be provided later.

SUBMISSION GUIDELINES
---------------------
The submission site is:

https://submissions.floc26.org/fscd/

Submissions must be formatted using the LIPIcs style files
(https://submission.dagstuhl.de/series/details/5#author).

Submissions can be made in two categories: regular research papers and
system descriptions. Please indicate in the submission page in HotCRP
and in the first page of the paper in which category you are submitting.
Regular research papers are limited to 15 pages, excluding references
and appendices. They must present original research which is unpublished
and not submitted elsewhere. System descriptions are limited to 15
pages, excluding references. Shorter papers are welcome and will be
given equal consideration. A system description must present new
software tools, or significantly new versions of such tools, in which
FSCD topics play an important role. An archive of the code with
instructions on how to install and run the tool must be submitted. In
addition, a webpage where the system can be experimented with should be
provided.

One author of each accepted paper is expected to register and present
the work in person at the conference. In case that this is not possible,
online presentation will be arranged, but in person registration will
still be required.

BEST PAPER AWARD BY JUNIOR RESEARCHERS
--------------------------------------
The programme committee will select a paper in which at least one author
is a junior researcher, i.e., either a student or someone whose PhD
award date is less than three years from the first day of the meeting.
When submitting the paper, other authors should declare to the PC Chair
that at least 50% of contribution is made by the junior researcher(s).

CODE OF CONDUCT
-----------------
FSCD 2026 stands by the FLoC 2026 Code of conduct
(https://www.floc26.org/policies).

PROGRAM COMMITTEE CHAIR
-----------------------
Frank Pfenning Carnegie Mellon University

PROGRAM COMMITTEE
-----------------
Alejandro Díaz-Caro INRIA (LORIA) & UNQuilmes, France & Argentina
Alexis Saurin CNRS & University Paris Cité, France
Alwen Tiu Australian National University, Australia
Andreas Abel Chalmers University of Technology & University of
Gothenburg, Sweden
Andreia Mordido University of Lisbon, Portugal
Cynthia Kop Radboud University Nijmegen, The Netherlands
Daniel Gratzer Aarhus University, Denmark
Dominic Orchard University of Kent & University of Cambridge, UK
Elaine Pimentel University College London, UK
Kristina Sojakova Free University of Amsterdam, The Netherlands
Kwangkeun Yi Seoul National University, Korea
Liron Cohen Ben-Gurion University, Israel
Małgorzata Biernacka University of Wrocław, Poland
Nao Hirokawa JAIST, Japan
Natarajan Shankar SRI International, USA
Niki Vazou IMDEA Madrid, Spain
Paul Downen UMass Lowell, USA
Peter Selinger Dalhousie University, Canada
Salvador Lucas Technical University of Valencia, Spain
Sarah Winkler Free University of Bozen-Bolzano, Italy
Ugo Dal Lago University of Bologna, Italy

CONFERENCE CHAIR
----------------
Sandra Alves University of Porto

WORKSHOPS CHAIR
---------------
Cynthia Kop Radboud University Nijmegen

FSCD STEERING COMMITTEE
-----------------------

Chair:
Patrick Baillot CNRS, University of Lille
Past Chair:
Herman Geuvers Radboud University Nijmegen
Workshop Chair:
Cynthia Kop Radboud University Nijmegen
Publicity Chair:
Carsten Fuhs Birkbeck University of London
Past PC Chairs:
Marco Gaboardi Boston University
Femke van Raamsdonk VU Amsterdam
Jakob Rehof TU Dortmund
Maribel Fernández King's College London
Elected Members:
Guilio Manzonetto Université Paris Cité
Ugo Dal Lago University of Bologna
Sandra Alves University of Porto
Jürgen Giesl RWTH Aachen