CS 521 - Formal Methods3 Credits Elements of formal logic; various approaches to automation including resolution; restrictions and search methods; inductive theorem proving; Knuth-Bendix completion; Boyer-Moore theorem-prover; applications.
Prerequisites C or better in CS 202 and 303, or A- or better in CS 500.
When Offered Every Spring
Click here for the Fall 2025 Class Schedule
Click here for the Spring 2026 Class Schedule
Click here for the Summer 2026 Class Schedule
Add to Portfolio (opens a new window)
|