Model checking is a prominent technique used in the hardware and
software industries for automatic verification. While it is very
successful in finding subtle bugs in distributed systems, it faces
the state explosion problem - the number of reachable states grows
exponentially in the number of concurrent components.
In this book the authors introduce unfoldings, an approach to
model checking which alleviates the state explosion problem by
means of concurrency theory. They offer a gentle introduction to
the basics of the method, and in particular they detail an
unfolding-based algorithm for model checking concurrent systems
against properties specified as formulas of linear temporal logic
(LTL). Self-contained chapters cover transition systems and their
products; unfolding products; search procedures for basic
verification problems, such as reachability and livelocks; and
model checking LTL. The final chapter summarizes the results of the
book, and points the reader to tools and case studies.
The book will be of value to researchers and graduate students
engaged in automatic verification and concurrency theory.
General
Imprint: |
Springer-Verlag
|
Country of origin: |
Germany |
Series: |
Monographs in Theoretical Computer Science. An EATCS Series |
Release date: |
March 2008 |
First published: |
2008 |
Authors: |
Javier Esparza
• Keijo Heljanko
|
Dimensions: |
235 x 155 x 16mm (L x W x T) |
Format: |
Hardcover
|
Pages: |
172 |
Edition: |
2008 ed. |
ISBN-13: |
978-3-540-77425-9 |
Categories: |
Books >
Computing & IT >
Computer programming >
Software engineering
|
LSN: |
3-540-77425-4 |
Barcode: |
9783540774259 |
Is the information for this product incomplete, wrong or inappropriate?
Let us know about it.
Does this product have an incorrect or missing image?
Send us a new image.
Is this product missing categories?
Add more categories.
Review This Product
No reviews yet - be the first to create one!