Download as PDF, PPTX
Uploaded byAnit Thapaliya
Model Checking History
The document discusses the evolution of model checking in computer science, emphasizing its importance in ensuring the reliability and correctness of software controllers in critical systems. It highlights historical failures due to software errors in pivotal incidents, leading to the development of model checking as a systematic and mathematical approach to software verification. Future research directions include integrating model checking with deductive verification and addressing the state explosion problem using binary decision diagrams.
More Related Content
Similar to Model Checking History
Model Checking History
- 1. History of ModelChecking By : Anit Thapaliya Department of Computer Science Kyonggi University, Suwon South Korea
- 2. Background • Critical systemhave software controllers. • Controllers monitor the system based on different parameters. Now, Questions is the reliability of controller…?
- 3. Reliable …? How •Decision must be 100% correct • All possible case must be considered.
- 4. 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
- 5. Background Before ModelChecking • In general, controller satisfy the requirements. This process was carried out by use different test case scenario’s. Next Goal: Development Effective Software
- 6. 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 |= f M is model S is any state F is the specification
- 7. Fig: Model CheckingWorking Mechanism System Model M M; s |= f Specification f
- 8. Behind Model CheckingConcept Model Checking (96 and 07 Turing Awards) Edmund Clarke Allen Emerson Joseph Sifakis
- 9. Advantages of ModelChecking • 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
- 10. IDLE Transition Systems inModel Checking
- 11. IDLE Insert_card PIN Transition Systems inModel Checking
- 12. IDLE Insert_card PIN TRANSACTION wrong correct Transition Systemsin Model Checking
- 13. IDLE Insert_card PIN TRANSACTION wrong BALANCE INQUIRYWITHDRAW correct withdrawalbal_inquiry Transition Systems in Model Checking
- 14.
- 15.
- 16.
- 17.
- 18. IDLE Insert_card PIN wrong WITHDRAW correct MORE print no yes withdrawalbal_inquiry cash no $$ amount BALANCE IDLE PIN TRANSACTION BALANCEWITHDRAW MORE $$ Transition Systems in Model Checking
- 19. IDLE Insert_card PIN wrong WITHDRAW correct MORE print no yes withdrawalbal_inquiry cash no $$ amount BALANCE IDLE PIN TRANSACTION BALANCEWITHDRAW 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
- 20. Future Research inModel 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.
- 21.