2026-07-21T14:16:54Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:1248 2025-09-25T07:01:28Z ddc:004 open_access

Termination of Programs using Term Rewriting and SAT Solving Giesl, Jürgen Schneider-Kamp, Peter Thiemann, René Swiderski, Stephan Nguyen, Manh Thang De Schreye, Daniel Serebrenik, Alexander Termination Term Rewriting Haskell Prolog SAT Solving There are many powerful techniques for automated termination analysis of term rewrite systems (TRSs). However, up to now they have hardly been used for real programming languages. In this talk, we describe recent results which permit the application of existing techniques from term rewriting in order to prove termination of programs. We discuss two possible approaches: 1. One could translate programs into TRSs and then use existing tools to verify termination of the resulting TRSs. 2. One could adapt TRS-techniques to the respective programming languages in order to analyze programs directly. We present such approaches for the functional language Haskell and the logic language Prolog. Our results have been implemented in the termination provers AProVE and Polytool. In order to handle termination problems resulting from real programs, these provers had to be coupled with modern SAT solvers, since the automation of the TRS-termination techniques had to improve significantly. Our resulting termination analyzers are currently the most powerful ones for Haskell and Prolog. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Jürgen Giesl and Peter Schneider-Kamp and René Thiemann and Stephan Swiderski and Manh Thang Nguyen and Daniel De Schreye and Alexander Serebrenik 2007 Is Part Of Dagstuhl Seminar Proceedings, Volume 7401, Deduction and Decision Procedures (2007) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/DagSemProc.07401.7 urn:nbn:de:0030-drops-12481 https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.07401.7 eng https://creativecommons.org/licenses/by/4.0/legalcode