Computer Science 613 - Adv Logic in Computer Science

Rigorous introduction to mathematical logic from an algorithmic perspective. Topics include: Propositional logic: Horn clause satisfiability and SAT solvers; First Order Logic: soundness and completeness of resolution, compactness theorem. We will use various state-of-the-art tools for applying logic to automatically verifying correctness properties of programs or finding errors, including model checkers, SAT and SMT solvers and theorem provers.

Open to Masters and PhD Computer Science students only. MEETS WITH COMPSCI 513. STUDENTS TAKING THIS COURSE SHOULD HAVE UNDERGRADUATE PREPARATION IN DISCRETE MATH AND ALGORITHMS. SEATS HELD FOR INCOMING GRAD STUDENT REGISTRATION. STUDENTS NEEDING SPECIAL PERMISSION MUST REQUEST OVERRIDES VIA THE ON-LINE FORM: https://www.cics.umass.edu/overrides.