Princeton University
Computer Science Dept.

Computer Science 496
Automated Theorem Proving

Andrew W. Appel

Spring 2001


Directory
General Information | Schedule and Readings | Assignments | Announcements

Logic, semiautomatic theorem proving, and automatic proof checking have applications in program verification, network and cryptographic protocols, computer security, mathematics, and computer architecture. This course covers principles, methods, and applications, with an emphasis on hands-on learning how to use the tools of the trade.

General Information

Lectures: Mon, Weds, Fri 10:00 - 10:50 in room 301 CS Building
Professor: Andrew W. Appel, appel@cs
TA: Neophytos Michael, nmichael@cs

Current Announcements click here