WST — PROGRAM
Days: Saturday, 25 July 2026
Saturday, 25 July 2026
08:50-10:30
Termination of First-Order Rewriting
WST
Location:
C4.02
| 08:50-09:15 |
Semantic Labelling in Practice (abstract) 25 min
1 ASW Saarland
2 HTWK Leipzig
|
| 09:15-09:40 |
Termination of Innermost-Terminating Right-Linear Overlay Term Rewrite Systems (abstract) 25 min
1 Nagoya University
|
| 09:40-10:05 |
Unifying Semantic Path Order and Weighted Path Order (abstract) 25 min
1 JAIST
|
| 10:05-10:30 |
Beyond Absolute Positiveness for Universally Quantified Non-Linear Polynomial Constraints (abstract) 25 min
1 Birkbeck, University of London
|
10:30-11:00
Coffee Break
WST
Location:
C4.02
11:00-12:30
Termination of Loops
WST
Location:
C4.02
| 11:00-11:25 |
PaSTTeL: Parallel analysiS framework for Termination and non-Termination of Lasso programs (abstract) 25 min
1 Sorbonne Université, CNRS, LIP6, F-75005 Paris, France
2 Sorbonne Université, CNRS, LIP6, F-75005 Paris, France Université Paris Lumières, Université Paris Nanterre Nanterre, France
3 Dowsers
|
| 11:25-11:50 |
Loop Termination and Generalized Collatz Sequences (abstract) 25 min
1 CISPA Helmholtz Center for Information Security
|
| 11:50-12:15 |
On Deciding Constant Runtime of Linear Loops (abstract) 25 min
1 RWTH Aachen University
2 University of Sussex
|
| 12:15-12:30 |
termCOMP Part 1 (abstract) 15 min
1 RWTH Aachen University
|
12:30-14:00
Lunch
WST
Location:
C4.02
14:00-15:30
Beyond Classical Rewriting
WST
Location:
C4.02
| 14:00-14:25 |
Dependency Pairs for Expected Runtime Complexity of Probabilistic Term Rewriting (abstract) 25 min
1 RWTH Aachen University
|
| 14:25-14:50 |
Towards an HRS Category in TermComp (abstract) 25 min
1 University of Innsbruck
|
| 14:50-15:15 |
An Infinitary Lambda Calculus with Global Trace Condition (Extended Abstract) (abstract) 25 min
1 Università di Torino
2 Toho University
|
| 15:15-15:30 |
termCOMP Part 2 (abstract) 15 min
1 RWTH Aachen University
|
15:30-16:00
Coffee Break
WST
Location:
C4.02
16:00-17:45
Program Analysis
WST
Location:
C4.02
| 16:00-16:25 |
From Expectations to Moments: Improving Inference of Expected Runtimes (abstract) 25 min
1 RWTH Aachen University
|
| 16:25-16:50 |
Verifying LTL for Infinite State Systems via Termination Analysis (abstract) 25 min
1 RWTH Aachen University
|
| 16:50-17:15 |
Towards an Automated Reasoning Tool for Complexity Analysis of Automated Reasoners (abstract) 25 min
1 Universidad Politécnica de Madrid (UPM) and IMDEA Software Institute
2 Spanish Council for Scientific Research (CSIC) and IMDEA Software Institute
3 IMDEA Software Institute
4 Computer Science Laboratory of Sorbonne University (LIP6) and STMicroelectronics
|
| 17:15-17:45 |
WST Business Meeting & termCOMP Community Meeting (abstract) 30 min
1 RWTH Aachen University
2 Université de La Réunion
|