Symbolic Evaluation Graphs and Term Rewriting — A General Methodology for Analyzing Logic Programs

J. Giesl, T. Ströder, P. Schneider-Kamp, F. Emmes, C. Fuhs

Publikation: Kapitel i bog/rapport/konference-proceedingKonferencebidrag i proceedingsForskningpeer review

Abstrakt

There exist many powerful techniques to analyze termination and complexity of term rewrite systems (TRSs). Our goal is to use these techniques for the analysis of other programming languages as well. For instance, approaches to prove termination of definite logic programs by a transformation to TRSs have been studied for decades. However, a challenge is to handle languages with more complex evaluation strategies (such as Prolog, where predicates like the cut influence the control flow). We present a general methodology for the analysis of such programs. Here, the logic program is first transformed into a symbolic evaluation graph which represents all possible evaluations in a finite way. Afterwards, different analyses can be performed on these graphs. In particular, one can generate TRSs from such graphs and apply existing tools for termination or complexity analysis of TRSs to infer information on the termination or complexity of the original logic program. More information can be found in the full paper [1]. © 2013 Springer-Verlag.
OriginalsprogEngelsk
TitelLogic-Based Program Synthesis and Transformation
RedaktørerElvira Albert
Antal sider1
Vol/bind7844
ForlagSpringer
Publikationsdato2013
ISBN (Trykt)978-364238196-6
ISBN (Elektronisk)978-3-642-38197-3
DOI
StatusUdgivet - 2013
Begivenhed22nd International Symposium on Logic-Based Program Synthesis and Transformation - Leuven, Belgien
Varighed: 18. sep. 201220. sep. 2012

Konference

Konference22nd International Symposium on Logic-Based Program Synthesis and Transformation
LandBelgien
ByLeuven
Periode18/09/201220/09/2012
NavnLecture Notes in Computer Science
Vol/bind7844
ISSN0302-9743

Citationsformater