Catalog Description: Introduction to the theory and practice of formal methods for the design and analysis of systems, with a focus on automated algorithmic techniques. Covers selected topics in computational logic and automata theory including formal models of reactive systems, temporal logic, model checking, and automated theorem proving. Applications in hardware and software verification, analysis of embedded, real-time, and hybrid systems, computer security, synthesis, planning, constraint solving, and other areas will be explored as time permits.
Units: 3.0
Prerequisites: Consent of instructor; Computer Science 170 is recommended.
Formats:
Fall: 3 hours of lecture per week
Spring: 3 hours of lecture per week
Grading basis: letter
Final exam status: No final exam
Also listed as: EL ENG 219C
Related Areas: