Implementing RPO and POLO using SAT.

Peter Schneider-Kamp; Carsten Fuhs; René Thiemann; Jürgen Giesl; Elena Annov; Michael Codish; Aart Middeldorp; Harald Zankl

Implementing RPO and POLO using SAT.

Peter Schneider-Kamp, Carsten Fuhs, René Thiemann, Jürgen Giesl, Elena Annov, Michael Codish, Aart Middeldorp, Harald Zankl

Department of Computer Science

Research output: Contribution to conference › Paper › peer-review

Abstract

Well-founded orders are the most basic, but also most important ingredient to virtually all termination analyses. Numerous fully automated search algorithms for these classes have therefore been devised and implemented in termination tools. Unfortunately, for termination problems occurring in practice, the performance of existing algorithms is often insufficient.
Performance can be improved significantly by reducing these search problems to decision problems for which more efficient algorithms already exist. Here, we introduce an encoding of RPO and POLO to the satisfiability of propositional logic (SAT). We implemented these encodings in our termination tool AProVE. Extensive experiments have shown that one can obtain speedups in orders of magnitude by this encoding and the application of modern SAT solvers.

Original language	English GB
State	Published - 2007
Event	Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs - Country, Dagstuhl, Germany Duration: 8 Jul 2007 → 13 Jul 2007 https://www.dagstuhl.de/07281

Conference

Conference	Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs
Country/Territory	Germany
City	Dagstuhl
Period	8/07/07 → 13/07/07
Internet address	https://www.dagstuhl.de/07281

Access to Document

Cite this

@conference{f14c4e2e22714f6d8d44a85d65261303,

title = "Implementing RPO and POLO using SAT.",

abstract = "Well-founded orders are the most basic, but also most important ingredient to virtually all termination analyses. Numerous fully automated search algorithms for these classes have therefore been devised and implemented in termination tools. Unfortunately, for termination problems occurring in practice, the performance of existing algorithms is often insufficient.Performance can be improved significantly by reducing these search problems to decision problems for which more efficient algorithms already exist. Here, we introduce an encoding of RPO and POLO to the satisfiability of propositional logic (SAT). We implemented these encodings in our termination tool AProVE. Extensive experiments have shown that one can obtain speedups in orders of magnitude by this encoding and the application of modern SAT solvers.",

author = "Peter Schneider-Kamp and Carsten Fuhs and Ren{\'e} Thiemann and J{\"u}rgen Giesl and Elena Annov and Michael Codish and Aart Middeldorp and Harald Zankl",

note = "DBLP License: DBLP's bibliographic metadata records provided through http://dblp.org/ are distributed under a Creative Commons CC0 1.0 Universal Public Domain Dedication. Although the bibliographic metadata records are provided consistent with CC0 1.0 Dedication, the content described by the metadata records is not. Content may be subject to copyright, rights of privacy, rights of publicity and other restrictions.; Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs ; Conference date: 08-07-2007 Through 13-07-2007",

year = "2007",

language = "אנגלית",

url = "https://www.dagstuhl.de/07281",

}

TY - CONF

T1 - Implementing RPO and POLO using SAT.

AU - Schneider-Kamp, Peter

AU - Fuhs, Carsten

AU - Thiemann, René

AU - Giesl, Jürgen

AU - Annov, Elena

AU - Codish, Michael

AU - Middeldorp, Aart

AU - Zankl, Harald

N1 - DBLP License: DBLP's bibliographic metadata records provided through http://dblp.org/ are distributed under a Creative Commons CC0 1.0 Universal Public Domain Dedication. Although the bibliographic metadata records are provided consistent with CC0 1.0 Dedication, the content described by the metadata records is not. Content may be subject to copyright, rights of privacy, rights of publicity and other restrictions.

PY - 2007

Y1 - 2007

N2 - Well-founded orders are the most basic, but also most important ingredient to virtually all termination analyses. Numerous fully automated search algorithms for these classes have therefore been devised and implemented in termination tools. Unfortunately, for termination problems occurring in practice, the performance of existing algorithms is often insufficient.Performance can be improved significantly by reducing these search problems to decision problems for which more efficient algorithms already exist. Here, we introduce an encoding of RPO and POLO to the satisfiability of propositional logic (SAT). We implemented these encodings in our termination tool AProVE. Extensive experiments have shown that one can obtain speedups in orders of magnitude by this encoding and the application of modern SAT solvers.

AB - Well-founded orders are the most basic, but also most important ingredient to virtually all termination analyses. Numerous fully automated search algorithms for these classes have therefore been devised and implemented in termination tools. Unfortunately, for termination problems occurring in practice, the performance of existing algorithms is often insufficient.Performance can be improved significantly by reducing these search problems to decision problems for which more efficient algorithms already exist. Here, we introduce an encoding of RPO and POLO to the satisfiability of propositional logic (SAT). We implemented these encodings in our termination tool AProVE. Extensive experiments have shown that one can obtain speedups in orders of magnitude by this encoding and the application of modern SAT solvers.

M3 - הרצאה

T2 - Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs

Y2 - 8 July 2007 through 13 July 2007

ER -

Implementing RPO and POLO using SAT.

Abstract

Conference

Access to Document

Fingerprint

Cite this