### Resumé

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

Titel | Logic-Based Program Synthesis and Transformation |

Redaktører | Elvira Albert |

Antal sider | 1 |

Vol/bind | 7844 |

Forlag | Springer |

Publikationsdato | 2013 |

ISBN (Trykt) | 978-364238196-6 |

ISBN (Elektronisk) | 978-3-642-38197-3 |

DOI | |

Status | Udgivet - 2013 |

Begivenhed | 22nd International Symposium on Logic-Based Program Synthesis and Transformation - Leuven, Belgien Varighed: 18. sep. 2012 → 20. sep. 2012 |

### Konference

Konference | 22nd International Symposium on Logic-Based Program Synthesis and Transformation |
---|---|

Land | Belgien |

By | Leuven |

Periode | 18/09/2012 → 20/09/2012 |

Navn | Lecture Notes in Computer Science |
---|---|

Vol/bind | 7844 |

ISSN | 0302-9743 |

### Citer dette

*Logic-Based Program Synthesis and Transformation*(Bind 7844). Springer. Lecture Notes in Computer Science, Bind. 7844 https://doi.org/10.1007/978-3-642-38197-3_1

}

*Logic-Based Program Synthesis and Transformation.*bind 7844, Springer, Lecture Notes in Computer Science, bind 7844, 22nd International Symposium on Logic-Based Program Synthesis and Transformation , Leuven, Belgien, 18/09/2012. https://doi.org/10.1007/978-3-642-38197-3_1

**Symbolic Evaluation Graphs and Term Rewriting — A General Methodology for Analyzing Logic Programs.** / Giesl, J.; Ströder, T.; Schneider-Kamp, P.; Emmes, F.; Fuhs, C.

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.

AU - Ströder, T.

AU - Schneider-Kamp, P.

AU - Emmes, F.

AU - Fuhs, C.

PY - 2013

Y1 - 2013

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). 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.

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). 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.

U2 - 10.1007/978-3-642-38197-3_1

DO - 10.1007/978-3-642-38197-3_1

M3 - Article in proceedings

SN - 978-364238196-6

VL - 7844

BT - Logic-Based Program Synthesis and Transformation

A2 - Albert, Elvira

PB - Springer

ER -