Abstract interpretation is a theory of approximating the semantics of computer programs using monotonic functions and ordered sets. It is used to partially execute a program to gain information about its semantics without performing all calculations. It was formalized by Patrick and Radhia Cousot in the late 1970s.
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