000 | 03239nam a22005175i 4500 | ||
---|---|---|---|
001 | 978-3-540-77426-6 | ||
003 | DE-He213 | ||
005 | 20161121230719.0 | ||
007 | cr nn 008mamaa | ||
008 | 100301s2008 gw | s |||| 0|eng d | ||
020 |
_a9783540774266 _9978-3-540-77426-6 |
||
024 | 7 |
_a10.1007/978-3-540-77426-6 _2doi |
|
050 | 4 | _aQA76.758 | |
072 | 7 |
_aUMZ _2bicssc |
|
072 | 7 |
_aUL _2bicssc |
|
072 | 7 |
_aCOM051230 _2bisacsh |
|
082 | 0 | 4 |
_a005.1 _223 |
100 | 1 |
_aEsparza, Javier. _eauthor. |
|
245 | 1 | 0 |
_aUnfoldings _h[electronic resource] : _bA Partial-Order Approach to Model Checking / _cby Javier Esparza, Keijo Heljanko. |
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2008. |
|
300 |
_aXII, 172 p. 51 illus. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aMonographs in Theoretical Computer Science An EATCS Series, _x1431-2654 |
|
505 | 0 | _aTransition Systems and Products -- Unfolding Products -- Search Procedures for the Executability Problem -- More on the Executability Problem -- Search Procedures for the Repeated Executability Problem -- Search Procedures for the Livelock Problem -- Model Checking LTL -- Summary, Applications, Extensions, and Tools. | |
520 | _aModel 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. | ||
650 | 0 | _aComputer science. | |
650 | 0 | _aSoftware engineering. | |
650 | 0 | _aComputers. | |
650 | 0 | _aComputer logic. | |
650 | 1 | 4 | _aComputer Science. |
650 | 2 | 4 | _aSoftware Engineering/Programming and Operating Systems. |
650 | 2 | 4 | _aLogics and Meanings of Programs. |
650 | 2 | 4 | _aTheory of Computation. |
650 | 2 | 4 | _aSoftware Engineering. |
700 | 1 |
_aHeljanko, Keijo. _eauthor. |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer eBooks | |
776 | 0 | 8 |
_iPrinted edition: _z9783540774259 |
830 | 0 |
_aMonographs in Theoretical Computer Science An EATCS Series, _x1431-2654 |
|
856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/978-3-540-77426-6 |
912 | _aZDB-2-SCS | ||
950 | _aComputer Science (Springer-11645) | ||
999 |
_c502872 _d502872 |