Model Checking / Edition 1

Hardcover (Print)
Rent
Rent from BN.com
$28.63
(Save 59%)
Est. Return Date: 11/16/2014
Buy Used
Buy Used from BN.com
$45.02
(Save 34%)
Item is in good condition but packaging may have signs of shelf wear/aging or torn packaging.
Condition: Used – Good details
Used and New from Other Sellers
Used and New from Other Sellers
from $12.46
Usually ships in 1-2 business days
(Save 81%)
Other sellers (Hardcover)
  • All (17) from $12.46   
  • New (9) from $50.00   
  • Used (8) from $12.46   

Overview

Model checking is a technique for verifying finite state concurrent systems such as sequential circuit designs and communication protocols. It has a number of advantages over traditional approaches that are based on simulation, testing, and deductive reasoning. In particular, model checking is automatic and usually quite fast. Also, if the design contains an error, model checking will produce a counterexample that can be used to pinpoint the source of the error. The method, which was awarded the 1998 ACM Paris Kanellakis Award for Theory and Practice,has been used successfully in practice to verify real industrial designs, and companies are beginning to market commercial model checkers.The main challenge in model checking is dealing with the state space explosion problem. This problem occurs in systems with many components that can interact with each other or systems with data structures that can assume many different values. In such cases the number of global states can be enormous. Researchers have made considerable progress on this problem over the last ten years.This is the first comprehensive presentation of the theory and practice of model checking. The book, which includes basic as well as state-of-the-art techniques, algorithms, and tools, can be used both as an introduction to the subject and as a reference for researchers.

Read More Show Less

What People Are Saying

From the Publisher
" Model Checking is bound to be the pre-eminent source for research, teaching, and industrial practice on this important subject. Theauthors include the foremost experts. This is the first trulycomprehensive treatment of a line of research that has gone fromconception to industrial practice in only two decades." R. P. Kurshan ,Distinguished Member Technical Staff, Bell Laboratories
Read More Show Less

Product Details

  • ISBN-13: 9780262032704
  • Publisher: MIT Press
  • Publication date: 1/7/2000
  • Edition description: New Edition
  • Edition number: 1
  • Pages: 330
  • Product dimensions: 7.20 (w) x 8.90 (h) x 0.90 (d)

Meet the Author

Edmund M. Clarke, a pioneer of the automated method called Model Checking, is FORE Systems Professor of Computer Science andProfessor of Electrical and Computer Engineering at Carnegie Mellon University, and a winner of the 2007 Turing Award given by the Association for Computing Machinery.

Doron Peled is Professor of Computer Science at the University of Warwick, Coventry, UK.

David M. Newbery is Director of the Department of Applied Economics at Cambridge University. He has been an advisor to the electricity, gas, and rail regulators in various countries.

Read More Show Less

Table of Contents

Foreword by Amir Pnueli
Preface
1 Introduction
1.1 The Need for Formal Methods
1.2 Hardware and Software Verification
1.3 The Process of Model Checking
1.4 Temporal Logic and Model Checking
1.5 Symbolic Algorithms
1.6 Partial Order Reduction
1.7 Other Approaches to the State EXplosion Problem
2 Modeling Systems
2.1 Modeling Concurrent Systems
2.2 Concurrent Systems
2.3 EXample of Program Translation
3 Temporal Logics
3.1 The Computation Tree Logic CTL*
3.2 CTL and LTL
3.3 Fairness
4 Model Checking
4.1 CTL Model Checking
4.2 LTL Model Checking by Tableau
4.3 CTL* Model Checking
5 Binary Decision Diagram
5.1 Representing Boolean Formulas
5.2 Representing Kripke Structures
6 Symbolic Model Checking
6.1 FiXpoint Representations
6.2 Symbolic Model Checking for CTL
6.3 Fairness in Symbolic Model Checking
6.4 CountereXamples and Witnesses
6.5 An ALU EXample
6.6 Relational Product Computations
6.7 Symbolic LTL Model Checking
7 Model Checking for the µCalculus
7.1 Introduction
7.2 The Propositional µCalculus
7.3 Evaluating FiXpoint Formulas
7.4 Representing µCalculus Formulas Using OBDDs
7.5 Translating CTL into the µCalculus
7.6 CompleXity Considerations
8 Model Checking in Practice
8.1 The SMV Model Checker
8.2 A Realistic EXample
9 Model Checking and Automata Theory
9.1 Automata on Finite and Infinite Words
9.2 Model Checking Using Automata
9.3 Checking Emptiness
9.4 Translating LTL into Automata
9.5 OntheFly Model Checking
9.6 Checking Language Containment Symbolically
10 Partial OrderReduction
10.1 Concurrency in Asynchronous Systems
10.2 Independence and Invisibility
10.3 Partial Order Reduction for LTLX
10.4 An EXample
10.5 Calculating Ample Sets
10.6 Correctness of the Algorithm
10.7 Partial Order Reduction in SPIN
11 Equivalences and Preorders between Structures
11.1 Equivalence and Preorder Algorithms
11.2 Tableau Construction
12 Compositional Reasoning
12.1 Composition of Structures
12.2 Justifying AssumeGuarantee Proofs
12.3 Verifying a CPU Controller
13 Abstraction
13.1 Cone of Influence Reduction
13.2 Data Abstraction
14 Symmetry
14.1 Groups and Symmetry
14.2 Quotient Models
14.3 Model Checking with Symmetry
14.4 CompleXity Issues
14.5 Empirical Results
15 Infinite Families of FiniteState Systems
15.1 Temporal Logic for Infinite Families
15.2 Invariants
15.3 Futurebus+ EXample Reconsidered
15.4 Graph and Network Grammars
15.5 Undecidability Result for a Family of Token Rings
16 Discrete RealTime and Quantitative Temporal
Analysis
16.1 RealTime Systems and RateMonotonic Scheduling
16.2 Model Checking RealTime Systems
16.3 RTCTL Model Checking
16.4 Quantitative Temporal Analysis: Minimum/MaXimum Delay
16.5 EXample: An Aircraft Controller
17 Continuous Real Time
17.1 Timed Automata
17.2 Parallel Composition
17.3 Modeling with Timed Automata
17.4 Clock Regions
17.5 Clock Zones
17.6 Difference Bound Matrices
17.7 CompleXity Considerations
18 Conclusion
References
IndeX
Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star

(0)

4 Star

(0)

3 Star

(0)

2 Star

(0)

1 Star

(0)

Your Rating:

Your Name: Create a Pen Name or

Barnes & Noble.com Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & Noble.com that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & Noble.com does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at BN.com or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation

Reminder:

  • - By submitting a review, you grant to Barnes & Noble.com and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Noble.com Terms of Use.
  • - Barnes & Noble.com reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & Noble.com also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on BN.com. It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

 
Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously

    If you find inappropriate content, please report it to Barnes & Noble
    Why is this product inappropriate?
    Comments (optional)