WPTE 2025
11th International Workshop on Rewriting Techniques for Program Transformations and Evaluation
Birmingham, UK
Sunday, July 20th, 2025
About
The aim of WPTE is to bring together researchers working on program transformations, evaluation, and operationally based programming language semantics, using rewriting methods, in order to share the techniques and recent developments and to exchange ideas to encourage further activation of research in this area.
Important Dates
- Submission of extended abstracts: 14th May 2025 (AoE), extended, at https://easychair.org/conferences/?conf=wpte2025
- Notification of acceptance: 11th June 2025 (delayed to the 13th)
- Early registration for the conference: 15th June 2025 (extended)
- Final version for informal proceedings: 30th June 2025
- Workshop: 20th July 2025
- Submission to post-proceedings/special issue: autumn 2025 (tbd)
Invited Speakers
Accepted Presentations (Speakers Underlined)
- Misaki Kojima and Naoki Nishida: On Transforming Prioritized Multithreaded Programs into Logically Constrained Term Rewrite Systems
- Kasper Hagens and Cynthia Kop: Bounded Rewriting Induction for LCTRSs
- Leonid Nosovitskiy and Adam D. Barwell: Refactoring Protocols For Crash Safety
- Takumi Sato and Koji Nakazawa: A Cyclic Proof System for Partial Correctness of Separation Logic with Recursive Calls
- David Sabel and Manfred Schmidt-Schauss: Probabilistic Lazy PCF with Real-Valued Choice
- Ghilain Bergeron, Horatiu Cirstea and Stephan Merz: Towards a verified compiler for Distributed PlusCal
- Naoki Nishida and Nozomi Taira: On Merging Constrained Rewrite Rules of Induction Hypotheses in Constrained Rewriting Induction
- Dragana Milovancevic, Carsten Fuhs and Viktor Kuncak: Proving Termination of Scala Programs by Constrained Term Rewriting
Topics of Interest
-
Correctness of program transformations, optimizations and translations.
-
Program transformations for proving termination, confluence, and other properties.
-
Correctness of evaluation strategies.
-
Operational semantics of programs, operationally-based program equivalences such as contextual equivalences and bisimulations.
-
Cost-models for arguing about the optimizing power of transformations and the costs of evaluation.
-
Program transformations for verification and theorem proving purposes.
-
Translation, simulation, equivalence of programs with different formalisms, and evaluation strategies.
-
Program transformations for applying rewriting techniques to programs in specific programming languages.
-
Program transformations for program inversions and program synthesis.
-
Program transformation and evaluation for Haskell and rewriting.
-
Rewriting-based transformations for bidirectional programming and reversible computation.
For submission guidelines and publication plans, see the Call for Papers.
Program Committee
- Martin Avanzini, Inria Sophia Antipolis
- Patrick Bahr, IT University of Copenhagen
- Demis Ballis, University of Udine
- Mirai Ikebuchi, Kyoto University
- Cynthia Kop, Radboud University Nijmegen (co-chair)
- Ivan Lanese, University of Bologna
- Pierre Lermusiaux, Inria Rennes
- Steven Libby, University of Portland
- Luca Roversi, University of Turin
- Janis Voigtländer, University of Duisburg-Essen (co-chair)
- Johannes Waldmann, Leipzig University of Applied Sciences
- Sarah Winkler, Free University of Bozen-Bolzano
Steering Committee
-
Ștefan Ciobâcă, Alexandru Ioan Cuza University, Iași
-
Horatiu Cirstea, LORIA, Université de Lorraine
-
Santiago Escobar, Universitat Politècnica de València
-
Joachim Niehren, Inria Lille
-
Naoki Nishida, Nagoya University
-
David Sabel, RheinMain University of Applied Sciences, Wiesbaden
-
Manfred Schmidt-Schauß, Goethe-University, Frankfurt am Main
Previous WPTEs