1
Model Checking. Instructor: Prof. B. Srivathsan, Department of Computer Science, Chennai Mathematical Institute.
1527 years, 7 months
55
Embedded software controls many of the safety-critical systems that we deal with in everyday life: for instance, modern cars are equipped with software to automatically change gears; pacemakers come with a software controller to regulate heart beat; aircrafts have flight control software, and so on. Typically, these (software) controllers have to make decisions based on inputs coming from multiple interacting components. As the size and the number of interacting components increase, the design and verification of controllers becomes increasingly complex. Model checking is a field of research that addresses this challenge by making use of mathematical models in the design and verification of controllers. The main idea is to look at the system as a mathematical model - commonly used models are extensions of finite-state machines. Design requirements on the controller then get translated to suitable questions on these mathematical models. The goal of this course is to understand some of the techniques and tools used in the process of model-checking. (from nptel.ac.in)
Course Currilcum
-
- Lecture 01 – Course Overview Unlimited
- Lecture 02 – Modeling Code Behaviour Unlimited
- Lecture 03 – Modeling Hardware Circuits Unlimited
- Lecture 04 – Modeling Data-dependent Programs Unlimited
- Lecture 05 – Modeling Concurrent Systems Unlimited
- Lecture 06 – Summary Unlimited
-
- Lecture 07 – Model Checking Tools Unlimited
- Lecture 08 – Simple Models in NuSMV Unlimited
- Lecture 09 – Hardware Verification using NuSMV Unlimited
- Lecture 10 – Modeling Concurrent Systems in NuSMV Unlimited
- Lecture 11 – Summary Unlimited
- Lecture 12 – A Problem in Concurrency Unlimited
- Lecture 13 – What is a Property? Unlimited
- Lecture 14 – Invariants Unlimited
- Lecture 15 – Safety Properties Unlimited
- Lecture 16 – Liveness Properties Unlimited
- Lecture 17 – Summary Unlimited
- Lecture 23 – Specifying Properties Unlimited
- Lecture 24 – Omega-Regular Expressions Unlimited
- Lecture 25 – Bchi Automata Unlimited
- Lecture 26 – Simple Properties of Bchi Automata Unlimited
- Lecture 27 – Summary Unlimited
- Lecture 33 – Introduction to LTL Unlimited
- Lecture 34 – Semantics of LTL Unlimited
- Lecture 35 – A Puzzle Unlimited
- Lecture 36 – Summary Unlimited
- Lecture 41 – Tree View of a Transition System Unlimited
- Lecture 42 – CTL* Unlimited
- Lecture 43 – CTL Unlimited
- Lecture 44 – Summary Unlimited
- Lecture 50 – Introduction to BDDs Unlimited
- Lecture 51 – Ordered BDDs Unlimited
- Lecture 52 – Representing Transition Systems as OBDDs Unlimited
- Lecture 53 – Summary Unlimited