EECS 219C. Formal Methods: Specification, Verification, and Synthesis

Catalog Description: Introduction to the theory and practice of formal methods for the design and analysis of systems, with a focus on algorithmic techniques. Covers selected topics in computational logic and automata theory including modeling and specification formalisms, temporal logics, satisfiability solving, model checking, synthesis, learning, and theorem proving. Applications to software and hardware design, cyber-physical systems, robotics, computer security, and other areas will be explored as time permits.

Units: 3.0

Prerequisites: Graduate standing or Consent of instructor; Computer Science 170 or equivalent is recommended.

Formats:
Fall: 3.0 hours of lecture per week
Spring: 3.0 hours of lecture per week

Grading basis: letter

Final exam status: No final exam


Class Schedule (Spring 2019):
MoWe 1:00PM - 2:29PM, Cory 293 – Sanjit A. Seshia

Class homepage on inst.eecs

General Catalog listing

Related Areas: