21
History of Model Checking By : Anit Thapaliya Department of Computer Science Kyonggi University, Suwon South Korea

Model Checking History

Embed Size (px)

Citation preview

Page 1: Model Checking History

History of Model Checking By : Anit Thapaliya

Department of Computer Science

Kyonggi University, Suwon

South Korea

Page 2: Model Checking History

Background

• Critical system have software controllers.

• Controllers monitor the system based on different

parameters.

Now, Questions is the reliability of controller…?

Page 3: Model Checking History

Reliable …? How

• Decision must be 100% correct

• All possible case must be considered.

Page 4: Model Checking History

Bugs are expensive

• Radiation Therapy Machine

– Error in control software (1985-1987)

– Death of 6 patients due to radiation overdose

• Ariane 5 Rocket

– Error in control software (1996)

– Crashed 36 seconds after lunch

• Intel’s Pentium II Processor:

– Error in source code (1994)

– Loss of 475 million US dollars

Page 5: Model Checking History

Background Before Model Checking

• In general, controller satisfy the requirements.

This process was carried out by use different

test case scenario’s.

Next Goal: Development Effective Software

Page 6: Model Checking History

Background Model Checking

• Now, this process is carried out by creating a

mathematics model that satisfy the

requirement in terms of formal notation.

Model Checking (1996 and 2007 Turing Awards)

M; s |= fM is model

S is any state

F is the specification

Page 7: Model Checking History

Fig: Model Checking Working Mechanism

System Model M

M; s |= f

Specification f

Page 8: Model Checking History

Behind Model Checking Concept

Model Checking (96 and 07 Turing Awards)

Edmund Clarke Allen Emerson Joseph Sifakis

Page 9: Model Checking History

Advantages of Model Checking

• No proofs:

– Algorithmic rather than deductive

• Fast:

– As compare to other rigorous methods like theorem

proving

• Diagnostic counterexamples:

• No problems with partial specification:

• Temporal logics can easily express many concurrency

properties

Page 10: Model Checking History

IDLE

Transition Systems in Model Checking

Page 11: Model Checking History

IDLEInsert_card

PIN

Transition Systems in Model Checking

Page 12: Model Checking History

IDLEInsert_card

PIN TRANSACTIONwrong

correct

Transition Systems in Model Checking

Page 13: Model Checking History

IDLEInsert_card

PIN TRANSACTIONwrong

BALANCE INQUIRY WITHDRAW

correct

withdrawalbal_inquiry

Transition Systems in Model Checking

Page 14: Model Checking History

IDLEInsert_card

PIN TRANSACTIONwrong

BALANCE WITHDRAW

correct

print

MORE

withdrawalbal_inquiry

Transition Systems in Model Checking

Page 15: Model Checking History

IDLEInsert_card

PIN TRANSACTIONwrong

BALANCE WITHDRAW

correct

MORE

printno

yes

withdrawalbal_inquiry

Transition Systems in Model Checking

Page 16: Model Checking History

IDLEInsert_card

PIN TRANSACTIONwrong

BALANCE WITHDRAW

correct

MORE

printno

yes

withdrawalbal_inquiry

$$

amount

Transition Systems in Model Checking

Page 17: Model Checking History

IDLEInsert_card

PIN TRANSACTIONwrong

WITHDRAW

correct

MORE

printno

yes

withdrawalbal_inquiry

cash

no

$$

amount

BALANCE

Transition Systems in Model Checking

Page 18: Model Checking History

IDLEInsert_card

PINwrong

WITHDRAW

correct

MORE

printno

yes

withdrawalbal_inquiry

cash

no

$$

amount

BALANCE

IDLE PIN TRANSACTION

BALANCE WITHDRAW

MORE $$

Transition Systems in Model Checking

Page 19: Model Checking History

IDLEInsert_card

PINwrong

WITHDRAW

correct

MORE

printno

yes

withdrawalbal_inquiry

cash

no

$$

amount

BALANCE

IDLE PIN TRANSACTION

BALANCE WITHDRAW

MORE $$

Initial state Action

Transition

This types of diagram with state, transition and action is represented as State Transition Diagram or

Transition System or Finite-state machines.

Transition Systems in Model Checking

Page 20: Model Checking History

Future Research in Model Checking

• Combination with Deductive Verification:

– It consists of generating the system and its specification a collection of

mathematical proof obligations. The truth of which conformance of system with

specification using interactive theorem proves, automatic theorem proves.

• It requires user to understand in details why the system works correctly, and

to convey this information to the verification system.

• State Explosion Problem Reduction:

– System having many components making the transition in parallel.

• Breakthrough BDD (Binary Decision Diagram): where transition are

represent implicitly in binary decision diagram.

Page 21: Model Checking History

Thank You !