### Resumé

Originalsprog | Engelsk |
---|---|

Titel | Proceedings of the 14th International Symposium on Principles and Practice of Declarative Programming (PPDP '12) |

Antal sider | 12 |

Forlag | Association for Computing Machinery |

Publikationsdato | 2012 |

ISBN (Trykt) | 978-1-4503-1522-7 |

DOI | |

Status | Udgivet - 2012 |

Begivenhed | 14th sSmposium on Principles and Practice of Declarative Programming - Leuven, Belgien Varighed: 19. sep. 2012 → 21. sep. 2012 |

### Konference

Konference | 14th sSmposium on Principles and Practice of Declarative Programming |
---|---|

Land | Belgien |

By | Leuven |

Periode | 19/09/2012 → 21/09/2012 |

### Fingeraftryk

### Citer dette

*Proceedings of the 14th International Symposium on Principles and Practice of Declarative Programming (PPDP '12)*Association for Computing Machinery. https://doi.org/10.1145/2370776.2370778

}

*Proceedings of the 14th International Symposium on Principles and Practice of Declarative Programming (PPDP '12).*Association for Computing Machinery, 14th sSmposium on Principles and Practice of Declarative Programming, Leuven, Belgien, 19/09/2012. https://doi.org/10.1145/2370776.2370778

**Symbolic Evaluation Graphs and Term Rewriting - A General Methodology for Analyzing Logic Programs.** / Giesl, Jürgen; Ströder, Thomas; Schneider-Kamp, Peter; Emmes, Fabian; Fuhs, Carsten.

Publikation: Bidrag til bog/antologi/rapport/konference-proceeding › Konferencebidrag i proceedings › Forskning › peer review

TY - GEN

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

AU - Giesl, Jürgen

AU - Ströder, Thomas

AU - Schneider-Kamp, Peter

AU - Emmes, Fabian

AU - Fuhs, Carsten

PY - 2012

Y1 - 2012

N2 - 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). In this paper, 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.

AB - 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). In this paper, 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.

U2 - 10.1145/2370776.2370778

DO - 10.1145/2370776.2370778

M3 - Article in proceedings

SN - 978-1-4503-1522-7

BT - Proceedings of the 14th International Symposium on Principles and Practice of Declarative Programming (PPDP '12)

PB - Association for Computing Machinery

ER -