Model Checking

الغلاف الأمامي
MIT Press, 04‏/12‏/2018 - 424 من الصفحات

An expanded and updated edition of a comprehensive presentation of the theory and practice of model checking, a technology that automates the analysis of complex systems.

Model checking is a verification technology that provides an algorithmic means of determining whether an abstract model—representing, for example, a hardware or software design—satisfies a formal specification expressed as a temporal logic formula. If the specification is not satisfied, the method identifies a counterexample execution that shows the source of the problem. Today, many major hardware and software companies use model checking in practice, for verification of VLSI circuits, communication protocols, software device drivers, real-time embedded systems, and security algorithms. This book offers a comprehensive presentation of the theory and practice of model checking, covering the foundations of the key algorithms in depth.

The field of model checking has grown dramatically since the publication of the first edition in 1999, and this second edition reflects the advances in the field. Reorganized, expanded, and updated, the new edition retains the focus on the foundations of temporal logic model while offering new chapters that cover topics that did not exist in 1999: propositional satisfiability, SAT-based model checking, counterexample-guided abstraction refinement, and software model checking. The book serves as an introduction to the field suitable for classroom use and as an essential guide for researchers.

 

ما يقوله الناس - كتابة مراجعة

لم نعثر على أي مراجعات في الأماكن المعتادة.

المحتويات

1 Introduction to the Second Edition
1
2 Introduction to the First Edition
3
3 Modeling Systems
15
4 Temporal Logic
37
5 CTL Model Checking
53
6 LTL and CTL Model Checking
71
7 Automata on Infinite Words and LTL Model Checking
85
8 Binary Decision Diagrams and Symbolic Model Checking
113
13 Abstraction
219
14 Software Model Checking
241
15 Verification with Automata Learning
257
16 Model Checking for the μCalculus
277
17 Symmetry
291
18 Infinite Families of FiniteState Systems
307
19 Discrete RealTime and Quantitative Temporal Analysis
329
20 Continuous Real Time
341

9 Propositional Satisfiability
137
10 SATBased Model Checking
153
11 Equivalences and Preorders between Structures
177
12 Partial Order Reduction
189

طبعات أخرى - عرض جميع المقتطفات

عبارات ومصطلحات مألوفة

حول المؤلف (2018)

Edmund M. Clark, Jr., is Professor of Computer Science at Carnegie Mellon University.

. Orna Grumberg is Professor of Computer Science at Technion, Israel Institute of Technology.

Daniel Kroening is Professor of Computer Science at the University of Oxford.

Doron Peled is Professor of Computer Science at Bar-Ilan University.

Helmut Veith was a Professor on the Faculty of Informatics at Vienna University of Technology (TU Vienna).

معلومات المراجع