Scalable Techniques for Formal Verification

ISBN-13: 9781441959973 / Angielski / Twarda / 2010 / 243 str.

Sandip Ray

Opis

This book is about formal veri?cation, that is, the use of mathematical reasoning to ensure correct execution of computing systems. With the increasing use of c- puting systems in safety-critical and security-critical applications, it is becoming increasingly important for our well-being to ensure that those systems execute c- rectly. Over the last decade, formal veri?cation has made signi?cant headway in the analysis of industrial systems, particularly in the realm of veri?cation of hardware. A key advantage of formal veri?cation is that it provides a mathematical guarantee of their correctness (up to the accuracy of formal models and correctness of r- soning tools). In the process, the analysis can expose subtle design errors. Formal veri?cation is particularly effective in ?nding corner-case bugs that are dif?cult to detect through traditional simulation and testing. Nevertheless, and in spite of its promise, the application of formal veri?cation has so far been limited in an ind- trial design validation tool ?ow. The dif?culties in its large-scale adoption include the following (1) deductive veri?cation using theorem provers often involves - cessive and prohibitive manual effort and (2) automated decision procedures (e. g., model checking) can quickly hit the bounds of available time and memory. This book presents recent advances in formal veri?cation techniques and d- cusses the applicability of the techniques in ensuring the reliability of large-scale systems. We deal with the veri?cation of a range of computing systems, from - quential programsto concurrentprotocolsand pipelined machines.

Recenzje

From the reviews:

"The book under review, based on the author's PhD thesis from 2005, is concerned with ... improving the scalability of formal verification methods at large. ... the material is presented in a fairly accessible fashion, suitable also for beginning graduate students." (Lutz Schröder, Zentralblatt MATH, Vol. 1211, 2011)

Spis treści

Preliminaries.- Overview of Formal Verification.- to ACL2.- Sequential Program Verification.- Sequential Programs.- Operational Semantics and Assertional Reasoning.- Connecting Different Proof Styles.- Verification of Reactive Systems.- Reactive Systems.- Verifying Concurrent Protocols Using Refinements.- Pipelined Machines.- Invariant Proving.- Invariant Proving.- Predicate Abstraction via Rewriting.- Formal Integration of Decision Procedures.- Integrating Deductive and Algorithmic Reasoning.- A Compositional Model Checking Procedure.- Connecting External Deduction Tools with ACL2.- Conclusion.- Summary and Conclusion.