|Classes:||Tuesdays and Thursdays, 4–5:50pm ·
Note the Zoom classroom we will be using for class!
|Instructor:||Mukund Raghothaman (firstname.lastname@example.org)|
|Office hours:||Mondays, 4–5:50pm, or by appointment · https://usc.zoom.us/j/91717549857|
This course is about the theory and practice of algorithmic program verification. We will discuss how programmers can prove that their code is correct, and how this process may be automated. We will study SAT and SMT solvers, and learn how to use them and how they work. These are sophisticated reasoning engines, and their use increasingly impacting other areas of computer science. We will see how they can be used to build automatic program synthesizers, which produce code that is correct-by-construction. [Syllabus]
Prerequisites: First, the course will expect a certain amount of mathematical maturity from its students, at least at the level of CSCI 170, and preferably at the level of CSCI 270. Second, we will be reasoning about code: we expect that the student will already be proficient in writing it.
Note: The syllabus and schedule listed on this webpage are tentative, and may be updated as the course progresses. Please check back regularly!
The course will consist of four homework assignments and an open-ended project, graded equally. The homework assignments are intended to develop familiarity with the material covered in class. In the project, you will apply and extend ideas from the course to a research problem of your choice. The project may be done either alone or in pairs. Please consult the instructor for feedback while choosing project topics.
|Jan 19||Course introduction, motivation, logistics.||[Recording], [Slides]|
|Jan 21||Propositional logic, satisfiability and validity.||[Recording], [Notes]|
|Jan 26||Propositional logic, contd.||[Recording], [Notes]|
|Jan 28||Basics of SAT solvers: DPLL and unit propagation||[Recording], [Notes]|
|Feb 2||Solving Horn-SAT and 2-SAT in polynomial time.||[Recording], [Notes]|
|Feb 4||Conflict-Driven Clause Learning.||[Recording], [Notes]|
|Feb 9||CDCL (contd.), and introduction to Satisfiability Modulo Theories.||[Recording], [Notes]|
|Feb 11||SMT: Solvers for LRA and difference logic.||[Recording], [Notes]|
|Feb 16||SMT: Difference logic, DPLL(T), and theory of equality.||[Recording], [Notes]|
|Feb 18||SMT: EUF and the Nelson-Oppen procedure.||[Recording], [Notes]|
|Feb 23||Introduction to program synthesis.||[Recording], [Notes]|
|Feb 25||Specifying user intent with SyGuS.
|Mar 2||Introduction to counter-example guided inductive synthesis (CEGIS).
[max3.sl], [max3-2.sl], [hd-11-d5-prog.sl], [boolean-formulas.sl], [unsynth.sl]
|Mar 4||The Enumerative SyGuS solver.||[Recording], [Notes]|
|Mar 9||Stochastic and constraint-based SyGuS solvers.||[Recording], [Notes]|
|Mar 11||The program verification problem for a simple programming language.||[Recording], [Notes]|
|Mar 16||Hoare triples, weakest preconditions, and strongest postconditions.||[Recording], [Notes]|
|Mar 18||Verification conditions.||[Recording], [Notes]|
|Mar 23||No class. Wellness day.|
|Mar 25||Invariants and verifying programs with loops.
|Mar 30||Proving that programs terminate.||[Recording], [Notes]|
|Apr 1||Proving program termination, contd.||[Recording], [Notes]|
|Apr 6||Proving program termination, contd.||[Recording], [Notes]|
|Apr 8||Introduction to predicate abstraction.||[Recording], [Notes], [Slides]|
|Apr 13||Predicate abstraction, contd.||[Recording], [Notes]|
|Apr 15||Predicate abstraction, concl.||[Recording], [Notes]|
|Apr 20||Course recap and research outlook.||[Recording], [Notes]|
|Apr 22||No class. Wellness day.|
|Apr 27||Student project presentations.|
|Apr 29||Student project presentations (contd.).|
From Dornsife's academic conduct policy: Plagiarism—presenting someone else's ideas as your own, either verbatim or recast in your own words—is a serious academic offense with serious consequences. Please familiarize yourself with the discussion of plagiarism in SCampus in Part B, Section 11, "Behavior Violating University Standards." Other forms of academic dishonesty are equally unacceptable. See additional information in SCampus and university policies on scientific misconduct, here.
Discrimination, sexual assault, intimate partner violence, stalking, and harassment are prohibited by the university. You are encouraged to report all incidents to the Office of Equity and Diversity / Title IX Office here, and / or to the Department of Public Safety. This is important for the health and safety of the whole USC community. Faculty and staff must report any information regarding an incident to the Title IX Coordinator who will provide outreach and information to the affected party. The sexual assault resource center webpage fully describes reporting options. Relationship and Sexual Violence Services webpage provides 24/7 confidential support.
Note on collaborative work: For collaborative projects, students are expected to have equal distribution of work. If there is any perceived imbalance in the collaborative project, the student should bring this to the attention of the instructor or the teaching assistant.
Assistance with writing and disabilities: Several USC's schools provide support for students who need help with scholarly writing. Check with your advisor or program staff to find out more. Students whose primary language is not English should check with the American Language Institute which sponsors courses and workshops specifically for international graduate students. The Office of Disability Services and Programs provides certification for students with disabilities and helps arrange the relevant accommodations. If an officially declared emergency makes travel to campus infeasible, USC Emergency Information will provide safety and other updates, including ways in which instruction will be continued by means of Blackboard, teleconferencing, and other technology.
Last updated: Fri Dec 24 05:02:12 AM PST 2021