Record: found
Abstract: not found
Book Chapter: not found

SAT Solving for Termination Analysis with Polynomial Interpretations

other

Author(s): Carsten Fuhs , Jürgen Giesl , Aart Middeldorp , Peter Schneider-Kamp , René Thiemann , Harald Zankl

Publication date (Print): 2007

Publisher: Springer Berlin Heidelberg

Read this book at

Publisher

Buy book

Bookmark

There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.

Related collections

Most cited references 13

Record: found
Abstract: not found
Book Chapter: not found

On the Complexity of Derivation in Propositional Calculus

G. S. Tseitin (1970)

0 comments Cited 57 times – based on 0 reviews

Bookmark

Record: found
Abstract: not found
Book Chapter: not found

AProVE 1.2: Automatic Termination Proofs in the Dependency Pair Framework

Jürgen Giesl, Peter Schneider-Kamp, René Thiemann (2006)

0 comments Cited 44 times – based on 0 reviews

Bookmark

Record: found
Abstract: not found
Book Chapter: not found

The Dependency Pair Framework: Combining Techniques for Automated Termination Proofs

Jürgen Giesl, René Thiemann, Peter Schneider-Kamp (2005)

0 comments Cited 33 times – based on 0 reviews

Bookmark

All references

Author and book information

Book Chapter

Pages: 340-354

DOI: 10.1007/978-3-540-72788-0_33

SO-VID: ee5ed648-c1c8-405c-806c-c28c18baf3b3

History

Data availability:

SAT Solving for Termination Analysis with Polynomial Interpretations

Read this book at

Related collections

Software for SAXS correction and analysis

Most cited references 13

On the Complexity of Derivation in Propositional Calculus

AProVE 1.2: Automatic Termination Proofs in the Dependency Pair Framework

The Dependency Pair Framework: Combining Techniques for Automated Termination Proofs

Author and book information

Book Chapter

History

Comments

Comment on this book

Book chapters

Similar content 4,016

Cited by 17