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

Predicate Abstraction and CEGAR for Disproving Termination of Higher-Order Functional Programs

other

Author(s): Takuya Kuwahara , Ryosuke Sato , Hiroshi Unno , Naoki Kobayashi

Publication date (Online): July 14 2015

Publisher: Springer International Publishing

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 20

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

Z3: An Efficient SMT Solver

Leonardo de Moura, Nikolaj Bjørner (2008)

0 comments Cited 132 times – based on 0 reviews

Bookmark

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

Construction of abstract state graphs with PVS

Susanne Graf, Hassen Saïdi (1997)

0 comments Cited 45 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

All references

Author and book information

Book Chapter

Publication date (Print): 2015

Publication date (Online): July 14 2015

Pages: 287-303

DOI: 10.1007/978-3-319-21668-3_17

SO-VID: f32fe9ed-ae4e-4668-b220-b4cb9480f9df

History

Data availability:

Predicate Abstraction and CEGAR for Disproving Termination of Higher-Order Functional Programs

Read this book at

Related collections

Higher order chromatin architecture

Most cited references 20

Z3: An Efficient SMT Solver

Construction of abstract state graphs with PVS

AProVE 1.2: Automatic Termination Proofs in the Dependency Pair Framework

Author and book information

Book Chapter

History

Comments

Comment on this book

Book chapters

Similar content 2,349

Cited by 5