Model checking is a method used to check if a finite-state model of a system meets a given specification. It involves formulating the problem as a task in logic, and verifying whether a formula in propositional logic is satisfied by a given structure. This technique can be used to check for liveness and safety requirements in hardware or software systems.
Stanford University
Winter 2023
This advanced course delves into the complexities of programming concurrent and reactive systems. It provides a firm theoretical foundation for understanding temporal logics like LTL and CTL, and the main verification techniques including deductive and algorithmic. The course necessitates a background in mathematical logic and familiarity with Algol-like languages.
No concepts data
+ 5 more conceptsStanford University
Autumn 2022-2023
Stanford's CS 221 course teaches foundational principles and practical implementation of AI systems. It covers machine learning, game playing, constraint satisfaction, graphical models, and logic. A rigorous course requiring solid foundational skills in programming, math, and probability.
No concepts data
+ 88 more conceptsStanford University
Fall 2019
This course emphasizes SAT and SMT technology and its applications, offering an understanding of theoretical foundations and how to implement a small theory solver. Applications of SAT/SMT technology in the context of verification are also covered. The advanced topics and lack of specified prerequisites suggest this is a high-level course.
No concepts data
+ 20 more concepts