Automated Reasoning: Symbolic Model Checking
- 0.0
-
![]()
![]()
![]()
![]()
![]()
Approx. 13 hours to complete
Course Summary
This course is designed for learners who want to understand automated reasoning and symbolic model checking techniques. The course covers topics such as propositional logic, model checking, and satisfiability modulo theories (SMT).Key Learning Points
- Learn the principles of automated reasoning and symbolic model checking
- Understand propositional logic and predicate logic
- Gain practical experience in using SMT solvers
Related Topics for further study
Learning Outcomes
- Understand the principles of automated reasoning and symbolic model checking
- Apply propositional and predicate logic in problem-solving
- Gain practical experience in using SMT solvers
Prerequisites or good to have knowledge before taking this course
- Basic knowledge of discrete mathematics
- Familiarity with propositional and predicate logic
Course Difficulty Level
IntermediateCourse Format
- Online
- Self-paced
- Video lectures
Similar Courses
- Formal Methods and Functional Programming
- Introduction to Logic
Related Education Paths
Notable People in This Field
- Edmund Clarke
- Ken McMillan
Related Books
Description
This course presents how properties of acting systems and programs can be verified automatically. The basic notion is a transition system: any system that can be described by states and steps. We present how in CTL (computation tree logic) properties like reachability can be described.
Outline
- CTL model checking
- General introduction
- Model Checking
- Computation Tree Logic
- Computation Tree Logic Algorithm
- Computation Tree Logic Example
- Size of state space
- CTL equivalence
- CTL example
- BDDs part 1
- Representing Boolean Functions
- Decision Trees
- Decision Trees 2
- BDDs
- Decision tree
- Reduced ordered decision tree
- ROBDD
- BDDs part 2
- BDD Examples
- BDD Algorithm
- BDD algorithm 2
- BDD Algorithm Example
- BDD quiz 1
- BDD quiz 2
- BDD algorithm
- BDD based symbolic model checking
- BDD Algorithm CTL
- An example: foxes and rabbits
- Deadlock checking in a network
- Networks, BMC, conclusions
- NuSMV source of foxes and rabbits problem
- Introduction
- Explanation packet switching networks and file describing routing function
- Problem 1: colored marbles
- Problem 2: reaching equal values
- Problem 3: deadlocks in packet switching networks
Summary of User Reviews
Discover the power of Automated Reasoning & Symbolic Model Checking in this highly rated course on Coursera. Users praise the comprehensive coverage of the topic, making it easy for beginners to understand. One key aspect users loved was the practical application of the concepts through coding assignments and quizzes.Pros from User Reviews
- Comprehensive coverage of the topic
- Clear and easy to understand explanations
- Practical application of concepts through coding assignments and quizzes
- Great for beginners
- Engaging and interactive lectures
Cons from User Reviews
- Not enough depth in some areas
- Lack of hands-on experience with tools
- Difficult assignments that may require outside help
- Some parts of the course may be too technical for beginners
- Limited interaction with instructors
Automated Reasoning: Symbolic Model Checking
- 0.0
-
![]()
![]()
![]()
![]()
![]()
This course presents how properties of acting systems and programs can be verified automatically. We present how in CTL (computation tree logic) properties like reachability can be described....
Introduction to Automated Analysis
- 4.1
-
![]()
![]()
![]()
![]()
![]()
This course introduces state-of-the-art techniques for automated analysis. After completing this course, a learner will be able to: - Understand the foundations of automated verification: randomization and symbolic representations...
