ENGLISH

Unfoldings: A Partial-Order Approach to Model Checking

By Javier Esparza , Keijo Heljanko

Book information

Publisher
Springer
Year
2008
ISBN
978-3-540-77425-9, 978-3-540-77426-6
DOI
10.1007/978-3-540-77426-6
Language
english
Format
PDF
Filesize
4 MB (4184007 bytes)
Series
Monographs in Theoretical Computer Science. An EATCS Series
Pages
176\176
Topic
Mathematics Logic
Orientation
yes
Scanned
yes
Time added
2013-08-01 04:00:00
Logics and Meanings of Programs; Theory of Computa

Description

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.

Similar books