CS 521 - Formal Methods

3 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