This is an old revision of the document!
Tentative Schedule
- Week 1 (1/9)
- IntroductionSlides
- Program RepresentationSlides
- Reading: Book Chapters
- Week 2 (1/16)
- Dynamic Program Analysis Primitives - TracingSlides
- Suggested Reading:Whole Execution Trace (Section 4 only)
- Student Presentation ():
- Week 3 (1/23)
- ProfilingSlides
- Reading:Efficient Path Profiling
- Student Presentation ():
- Week 4 (1/30)
- Dynamic SlicingSlides
- Student Presentation ()
- Week 5 (2/6, instructor travels from 2/2-2/8)
- Week 6 (2/13)
- Week 7 (2/20)
- Static program analysis
- Student Presentation ()
- Week 8 (2/27)
- Propositional LogicSlides
- Reading: Chapter one of Logic in Computer Science.
- Student Presentation ()
- Week 9 (3/6, midterm on 3/9)
- Propositional Logic
- Midterm
- Week 10 (3/13, spring break, no class)
- Week 11 (3/20)
- SAT solvingSlides
- Model Checking C ProgramsSlides
- Reading:CBMC.
- Suggested Reading:SMT solver
- Student Presentation ()
- Week 12 (3/27)
- Model Checking Java ProgramsSlides
- Student Presentation ()
- Week 13 (4/3)
- JPF-Predicate AbstractionSlides
- Reading:Predicate Abstraction
- Suggested Reading:Lazy Abstraction
- JPF-Predicate Abstraction
- Student Presentation ()
- Week 14 (4/10)
-
- Reading: Concolic Testing
- Student Presentation ()
-
- Week 15 (4/17)
- Testing-II (testing concurrent programs)Slides
- Student Presentation ()
- Week 16 (4/24)
- Review
- Project Demo
