The course material has applications to several areas in EECS and beyond includingĬomputer security, software engineering, embedded/cyber-physical systems, artificial intelligence,Ĭontrol systems, robotics, networking and distributed systems, education, (human-CPS) systems, formal methods for education, etc. Methods for safe and high assurance artificial intelligence (AI) and robotics,įormal methods for building secure systems, formal methods for human-robot Such as combining machine learning and formal methods, formal (ii) the interplay between inductive inference (learning from examples)Īnd deductive reasoning (logical inference and constraint solving).īased on time and interests, we will also cover other current research topics

(i) the close connections between verification and synthesis, and

These techniques have become essential tools for the designĪnd analysis of hardware, software, and cyber-physical systems.Ĭentral themes of the course this year will include In particular, the course will cover topics such as modelĬhecking, Boolean satisfiability (SAT) solving and satisfiability modulo That the systems indeed meet their specifications. Obligations, designing systems to meet those obligations,Īnd verifying, via algorithmic proof search, Proof: formulating specifications that form proof Specification, design, and verification of This course is an introduction to the theory and applications of formal methods, a field ofĬomputer science and engineering concerned with the rigorous mathematical Please email the instructor if you have any feedback on these notes or find typos. Will soon be replaced by an updated set of notes. Scribed course notes from a previous year are available here (PDF).

Check the bCourses site for this course regularly.

Monday and Wednesday 2:30-3 pm and by appointment (online and 566 Cory) Monday and Wednesday, 1-2:30 pm, online and 299 Cory. EECS 219C Spring 2022 Homepage EECS 219C: Formal Methods: Specification, Verification, and Synthesis Spring 2022

Lee seshia solution manual