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 33

Record: found
Abstract: not found
Article: not found

Results on the propositional μ-calculus

Dexter Kozen (1983)

0 comments Cited 209 times – based on 0 reviews      Review now

Bookmark

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

Horn Clause Solvers for Program Verification

Nikolaj Bjørner, Arie Gurfinkel, Ken McMillan … (2015)

0 comments Cited 31 times – based on 0 reviews

Bookmark

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

Higher-Order Pushdown Trees Are Easy

Teodor Knapik, Damian Niwinski, Paweł Urzyczyn (2002)

0 comments Cited 29 times – based on 0 reviews

Bookmark

All references

Author and book information

Book Chapter

Publication date (Print): 2018

Publication date (Online): April 14 2018

Pages: 711-738

DOI: 10.1007/978-3-319-89884-1_25

SO-VID: 87577365-7ec4-4642-8fbe-51856e565722

History

Data availability:

Comments

Comment on this book

Book chapters

Cited by 1

A New Refinement Type System for Automated \(\nu \text {HFL}_\mathbb {Z}\) Validity Checking
Authors: Hiroyuki Katsura, Naoki Iwayama, Naoki Kobayashi …

See all cited by

Higher-Order Program Verification via HFL Model Checking

Read this book at

Related collections

Higher order chromatin architecture

Most cited references 33

Results on the propositional μ-calculus

Horn Clause Solvers for Program Verification

Higher-Order Pushdown Trees Are Easy

Author and book information

Book Chapter

History

Comments

Comment on this book

Book chapters

Similar content 2,646

Cited by 1