SMT is a problem of determining whether a mathematical formula is satisfiable, generalizing the Boolean satisfiability problem. It is NP-hard and for many theories it is undecidable, but researchers study which theories lead to a decidable SMT problem. SMT solvers are tools used to solve the SMT problem for practical inputs and have been used in various applications.
Stanford 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