May 2025 - Termtools - lists.rwth-aachen.de

CALL FOR NOMINATION - FSCD Steering Committee Membership Election 2025
by Carsten Fuhs 28 May '25

28 May '25

Formal Structures for Computation and Deduction (FSCD) Steering Committee Membership Election 2025 CALL FOR NOMINATION The FSCD SC consists of the SC Chair, 6 elected members, PC Chairs of the last 3 years, the Publicity Chair, Workshop Chair and former SC Chair. Every year the outgoing elected SC members are replaced by new members elected by a secret ballot. Each SC member normally serves for 3 years, unless exceptions apply (see the FSCD Rules of Business http://fscd-conference.org/organization/rules-of-business/ for details). Note that past SC members are allowed to run for SC membership again. The current steering committee composition, together with the serving time for each member, is available here: https://fscd-conference.org/organization/steering-committee/ Candidates for SC membership are requested to email the FSCD SC Chair an election statement (including a brief bio) on one a4 page, preferably in PDF, no later than * Friday 20 June 2025 (AoE) * The election statements will be posted on the FSCD webpage before the start of FSCD 2025. The election will take place at the General Meeting of FSCD 2025, 15-18 July 2025. Patrick Baillot patrick.baillot at univ-lille.fr FSCD SC Chair

1 0

Termination and Complexity Competition 2025: Call for Participation (Deadline August 6)
by Florian Frohn 26 May '25

26 May '25

*Termination and Complexity Competition 2025* http://www.termination-portal.org/wiki/Termination_Competition_2025 *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 2025, https://www.imn.htwk-leipzig.de/WST2025/). It will be run on the RWTH University HPC cluster <https://help.itc.rwth-aachen.de/service/rhr4fjjutttf/>. The final run and a presentation of the final results will be live at WST. 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 and at least 40 examples for this category in the underlying termination problem data base. 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_2025 <https://termination-portal.org/wiki/Termination_Competition_2025> _Important dates_ * Tool and Benchmark Submission: August 6, 2025 * First Run: August 20, 2025 * Bugfix Deadline: August 27, 2025 * Final Run: September 3/4, 2025 * Presentation of the results at WST: September 4, 2025

1 0

FSCD 2025: Call for Participation (early registration deadline: *15 June 2025*)
by Carsten Fuhs 19 May '25

19 May '25

FIRST CALL FOR PARTICIPATION Tenth International Conference on Formal Structures for Computation and Deduction (FSCD 2025) 14-20 July 2025, Birmingham, UK https://fscd-conference.org/2025/ In-cooperation with ACM SIGLOG IMPORTANT DATES --------------- Early registration: 15 June 2025 Workshops: 14 July and 19-20 July 2025 Conference: 15-18 July 2025 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. REGISTRATION ------------ Registration is now open, with the early deadline *** 15 June 2025 ***: https://shop.bham.ac.uk/conferences-and-events/college-of-engineering-physi… INVITED SPEAKERS ---------------- Liron Cohen, Ben-Gurion University Mariangiola Dezani, University of Torino Ekaterina Komendantskaya, University of Southampton Jose Meseguer, University of Illinois Urbana-Champaign ACCEPTED PAPERS --------------- The list of accepted papers can be found here: https://fscd2025.github.io/accepted.htm WORKSHOPS --------- * UNIF 2025: 39th International Workshop on Unification - 14 July 2025 * HOR 2025: 12th International Workshop on Higher-Order Rewriting - 14 July 2025 * WiL 2025: Women in Logic 2025 - 14 July 2025 * LFMTP 2025: International Workshop on Logical Frameworks and Meta Languages: Theory and Practice - 19 July 2025 * IFIP-WG1.6 2025: Annual Meeting of the IFIP Working Group 1.6 on Term Rewriting - 19 July 2025 * TLLA 2025: 9th International Workshop on Trends in Linear Logic and Applications - 19 and 20 July 2025 * GALOP 2025: 17th Workshop on Games for Logic and Programming Languages - 19 and 20 July 2025 * WPTE 2025: 11th International Workshop on Rewriting Techniques for Program Transformations and Evaluation - 20 July 2025 PROGRAMME COMMITTEE CHAIR ------------------------- Maribel Fernandez, King's College London, UK Email: fscd2025(a)easychair.org PROGRAMME COMMITTEE ------------------- Thorsten Altenkirch University of Nottingham, UK Sandra Alves University of Porto, Portugal Zena M. Ariola University of Oregon, US Mauricio Ayala-Rincon University of Brasilia, Brazil Kyungmin Bae Pohang University of Science and Technology, Korea Frederic Blanqui INRIA, France James Cheney University of Edinburgh, UK Ugo De'Liguoro University of Torino, Italy Santiago Escobar Universitat Politecnica de Valencia, Spain Silvia Ghilezan University of Novi Sad, Serbia Jean Goubault-Larrecq ENS Paris-Saclay, France Masahito Hasegawa Kyoto University, Japan Paul Blain Levy University of Birmingham, UK Christopher Lynch Clarkson University, US Assia Mahboubi INRIA, France, and VU Amsterdam, Netherlands Damiano Mazza CNRS, University Sorbonne Paris Nord, France Daniele Nantes-Sobrinho Imperial College, UK, and University of Brasilia, Brazil Naoki Nishida Nagoya University, Japan Valeria de Paiva Topos Institute, Berkeley, US Frank Pfenning Carnegie Mellon University, US Brigitte Pientka McGill University, Canada Alessandra di Pierro University of Verona, Italy Femke van Raamsdonk VU Amsterdam, Netherlands Simona Ronchi Della Rocca University of Torino, Italy Grigore Rosu University of Illinois Urbana-Champaign, US Manfred Schmidt-Schauss Goethe University, Germany Carolyn Talcott SRI, US Alvaro Tasistro Universidad ORT Uruguay Jamie Vicary University of Cambridge, UK Glynn Winskel Queen Mary University of London, UK CONFERENCE CHAIRS ----------------- Paul Blain Levy, University of Birmingham, UK Anupam Das, University of Birmingham, UK FSCD STEERING COMMITTEE ----------------------- Patrick Baillot (Chair), CNRS, University of Lille Ugo Dal Lago, University of Bologna Amy Felty, University of Ottawa Carsten Fuhs, Birkbeck, University of London (Publicity Chair) Marco Gaboardi, Boston University Herman Geuvers, Radboud University Nijmegen Juergen Giesl, RWTH Aachen University Cynthia Kop, Radboud University Nijmegen (SC Workshop Chair) Giulio Manzonetto, University Paris Cite Daniele Nantes, Imperial College London / University of Brasilia Femke van Raamsdonk, VU Amsterdam Jakob Rehof, TU Dortmund University SPONSORSHIP ----------- FSCD 2025 is proud to receive support from: University of Birmingham UK Research and Innovation The Research Institute on Verified Trustworthy Software Systems ANTI-HARASSMENT POLICY ---------------------- The open exchange of ideas and the freedom of thought and expression are central to the values and goals of SIGLOG. They require an environment that recognizes the inherent worth of every person and group. They flourish in communities that foster mutual understanding and embrace diversity. For these reasons, SIGLOG is committed to providing a harassment-free conference experience. As an event held in cooperation with SIGLOG, FSCD implements the ACM policy against harassment: https://www.acm.org/about-acm/policy-against-harassment

1 0

Request for Standard Answers for Code Termination Analysis in TPDB
by dengzl＠ios.ac.cn 19 May '25

19 May '25

Dear termcomp committee, Hello! I am a graduate student from the Chinese Academy of Sciences and a newcomer in the field of code analysis. In the future, I will try to do some work on code termination testing. I need to find some codes and their corresponding terminations. I have pulled the TPDB database corresponding to termcomp, but it seems that there is no corresponding termination explanation file for C language programs. For example, I can find the example.c file, but I cannot determine its standard answer for termination (yes/no/maybe). I have also pulled the termination results for termcomp 2024 competition, and I saw a VBS indicator on the website, but after further research, it does not seem to be the real standard answer. (I pulled the VBS results from this website: https://termcomp.github.io/Y2024/C.html ) So I contacted you to confirm whether there is a set of standard answers available for the termination analysis of codes related to TPDB. As this is my first attempt at working in the field of code analysis, I am unsure if I have followed the correct process for finding datasets and if I have missed any relevant information while browsing through TPDB. I hope you can forgive these questions. Thank you for considering my request. I look forward to hearing back from you soon. Best regards, Daniel Deng.

2 1

WST 2025 - Workshop on Termination, First Call for Papers
by Johannes Waldmann 12 May '25

12 May '25

====================================================================== WST 2025 - Call for Papers 20th International Workshop on Termination https://www.imn.htwk-leipzig.de/WST2025 September 3-4, 2025, Leipzig, Germany Co-located with IWC 2025, Sept. 2-3, 2025 ====================================================================== 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. IMPORTANT DATES - submission: June 25, 2025 - notification: July 16, 2025 - early registration: July 23, 2025 - final version: August 6, 2025 - workshop: September 3-4, 2025 TOPICS The 20th International Workshop on Termination welcomes contributions on all aspects of termination. In particular, papers investigating applications of termination (for example in complexity analysis, program analysis and transformation, theorem proving, program correctness, modeling computational systems, etc.) are very welcome. Topics of interest include (but are not limited to): - termination and complexity analysis in any domain (lambda calculus, declarative programming, rewriting, transition systems, probabilistic programs, etc.) - abstraction methods in termination analysis - certification of termination and complexity proofs - challenging termination problems - comparison and classification of termination methods - implementation of termination and complexity methods - non-termination analysis - normalization and infinitary normalization - operational termination of logic-based systems - ordinal notation and subrecursive hierarchies - SAT, SMT, and constraint solving for (non-)termination analysis - scalability and modularity of termination methods - well-founded relations and well-quasi-orders SUBMISSION GUIDELINES Submissions are short papers/extended abstracts which should not exceed 5 pages. There will be no formal reviewing. In particular, we welcome short versions of recently published articles and papers submitted elsewhere. The program committee checks relevance and provides additional feedback for each submission. The accepted papers will be made available electronically before the workshop. Papers should be submitted electronically via the submission page that will be announced here (at beginning of June). Please use LaTeX and the LIPIcs style file from https://github.com/dagstuhl-publishing/styles/ to prepare your submission. PROGRAM COMMITTEE - Carsten Fuhs, Birbeck, University of London - Jürgen Giesl, RWTH Aachen University - Dieter Hofbauer (co-chair), ASW Saarland - Pierre Lescanne, PLUME, ENS de Lyon - Salvador Lucas, DSIC & VRAIN, Universitat Politècnica de València - Aart Middeldorp, University of Innsbruck - Johannes Waldmann (co-chair), HTWK Leipzig - Akihisa Yamada, AIST, Japan TERMINATION COMPETITION Since 2003, the effect of WST to stimulate new research on termination has been enhanced by the Termination Competition https://termination-portal.org/wiki/Termination_Competition and its continuously developing Problem Databases containing thousands of programs as challenges for termination analysis in different categories. In 2025, the Termination Competition will run during WST. Authors of participating tools and benchmarks are invited to submit a short paper and give a presentation at the workshop.

1 0