Computer Science
>
>

CS 357 Advanced Topics in Formal Methods

Fall 2019

Stanford University

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.

Course Page

Overview

The course will focus on SAT and SMT technology and their applications. The students will learn the theoretical foundations of SAT/SMT, how to use SAT/SMT technology to solve problems, and finally how to implement a small theory solver of their own. The course will build up towards various applications of SAT/SMT technology in the context of verification.

Prerequisites

No data.

Learning objectives

No data.

Textbooks and other notes

Textbook:None; research papers will be assigned as weekly reading.

Other courses in Theoretical Computer Science

15-453 - Formal Languages, Automata, and Computability

Spring 2015

Carnegie Mellon University

CS 263 Counting and Sampling

Autumn 2022

Stanford University

CS 251 Great Ideas in Theoretical Computer Science

Fall 2022

Carnegie Mellon University

CSE 311 Foundations of Computing I

Autumn 2021

University of Washington

Courseware availability

Lecture slides and readings available at Lectures

No videos available

Assignments available at Assignements

Resources available at Additional resources

Covered concepts