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 11

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

What’s Decidable About Arrays?

Aaron R. Bradley, Zohar Manna, Henny B. Sipma (2005)

0 comments Cited 29 times – based on 0 reviews

Bookmark

Record: found
Abstract: not found
Conference Proceedings: not found

General decidability theorems for infinite-state systems

P.A. Abdulla, K. Cerans, B. Jonsson … (1996)

0 comments Cited 25 times – based on 0 reviews

Bookmark

Record: found
Abstract: not found
Article: not found

Symbolic model checking with rich assertional languages

Y. Kesten, O. Maler, M. Marcus … (2001)

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

Bookmark

All references

Author and book information

Book Chapter

Pages: 67-82

DOI: 10.1007/978-3-540-71070-7_6

SO-VID: e87a6b10-34ed-4db1-9f2c-525bae8aa76a

History

Data availability:

Comments

Comment on this book

Book chapters

Cited by 11

Satisfiability Modulo Theories
Authors: Clark Barrett, Cesare Tinelli
MCMT: A Model Checker Modulo Theories
Authors: Silvio Ghilardi, Silvio Ranise
Automatic Verification of Integer Array Programs
Authors: Marius Bozga, Peter Habermehl, Radu Iosif …

See all cited by

Towards SMT Model Checking of Array-Based Systems

Read this book at

Related collections

Socioecological systems

Most cited references 11

What’s Decidable About Arrays?

General decidability theorems for infinite-state systems

Symbolic model checking with rich assertional languages

Author and book information

Book Chapter

History

Comments

Comment on this book

Book chapters

Similar content 5,662

Cited by 11