Coursera Spring Sale
40% Off Coursera Plus Annual!
Grab it
Explore the fundamentals and elegant principles of SMT (Satisfiability Modulo Theories) solving in this keynote lecture from the Conference on Computer-Aided Verification. Gain deep insights into the mechanisms of SAT and SMT solving, discovering how these automated logical formula solution technologies serve as powerful off-the-shelf tools across diverse applications. Learn how real-world problems can be encoded into logical formulas and decoded into practical solutions through practical examples. Delivered by Professor Erika Abraham from RWTH Aachen University, whose expertise spans concurrent program verification, arithmetic problem automation, and formal methods for probabilistic and hybrid systems, understand both the theoretical foundations and recent developments in this critical field of computer science.
