Automated Reasoning: Symbolic Model Checking
By External Provider
About this course
The Automated Reasoning: Symbolic Model Checking course presents how the 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 reach-ability can be described. Typically, a state space may be very large. One way to deal with this is symbolic model checking: a way in which sets of states are represented symbolically. A fruitful way to do so is by representing sets of states by BDDs (binary decision diagrams). Definitions and basic properties of BDDs are presented in this course, and the algorithms to compute them, as needed for doing CTL model checking.
What you will learn
- Understand the foundations of symbolic model checking and automated system verification.
- Represent and verify systems using transition systems and Computation Tree Logic
- Apply CTL model checking algorithms to automatically check correctness properties
- Learn how Binary Decision Diagrams (BDDs) efficiently represent Boolean functions and large state spaces.