CS453 Automated Software Testing, Fall 16

Announcement

  • Previous announcements are on Noah BBS and KLMS course page.
  • No class on Nov 23 due to interview of undergraduate applicants
  • HW#4 was revised, and now you are allowed to generate more than 1,000 test cases per each strategy.
  • Explanation slide for regex_compile() was uploaded. (The slide is written in Korean. The English version will be uploaded by this afternoon(Nov 24).
  • If you like the material of CS453 or automated testing, please apply for URP or independence study with me :-)

Administrative Information

  • Instructor: Moonzoo Kim

    Office: 2434 (located at the east wing)
    Phone: 042-350-3543
    E-mail: moonzoo @ cs.kaist.ac.kr
    Office hour: TBD
    (reservation e-mail would be preferred)

  • Teaching assistants: Hyunwoo Kim (hyunooudy@gmail.com, x7743), Woong-Gyu Yang (diddndrb12@kaist.ac.kr, x7747)
  • TA office hour: Mon 2:30-4:00 PM / Wed 6:30-8:00 PM (Room #403, N-1)
  • Lecture hours: Mon/Wed 1-2:15 PM
  • Lecture room: 422 (N-1)
  • Prerequisite: experience in C/C++/Java programming and linux/unix command-line utilities
  • Grading: attendance/class participation/quiz: 20%, HW: 50%, midterm exam: 15%, final exam:15%
    • Late HW will be accepted with 10% penalty of the max score in 1 day, 30% penalty of the max score in 3 days. HW will not be accepted after then.
    • HW should be submitted both in hardcopy and softcopy (through email to TA). 10% penalty of the max score for missing hardcopy or softcopy unless explicitly written in HW.
    • Hint: many questions of exams are from the homework.
    • All programming HWs you submit must be able replayed by executing a single script file on a TA's verifier account (i.e., submitted HW should not have dependency on your home directory, environment, etc.). Also, the replayed execution must demonstrate the same output to the submitted hardcopy. You will get 10% penalty of the max score otherwise.
    • For your programming HWs, you should not use external libraries which are not available on the verifier machines. If you really need an external library, you have to ask TAs to install it on the verifier machines.
    • More than 7 absences of class will get F grade
      • Late attendance shall be considered as 1/3 absence.
      • Grad students who are occupied by his/her lab activities (e.g., attending conf, etc.) should submit 1 week prior notice.
      • No excuse for the absence of class including family issues, illness, etc.
  • The official language in the class is English. All students should submit all written documents such as homeworks, project reports, exams, etc. in English; 20% penalty of the max score otherwise.
  • Questions and answers can be done through KLMS
  • Excerpts from 강의평가
    • "실질적으로 써먹을 수 있는 내용을 많이 배워서 보람찼습니다"
    • "과제가 많이 어려운것 같았다. 과제에 대한 도움을 수업에서 좀 더 주었으면 좋겠다."

Syllabus

This class covers automated software verification/testing techniques to fight the high complexity of software. The goal of the class is to learn practical applications of advanced verification/testing techniques, not sophisticated theories. These automated techniques can provide high reliability for complex embedded software compared to traditional testing methods in a more productive way. This class guides students to utilize various software verification/testing tools and learn the underlying mechanisms to produce verification results for the target software effectively and efficiently.

Course Material

Course Schedule

Part I: Program coverage criteria and program analysis

Part II: Concolic testing (a.k.a., dynamic symbolic execution)

Part III: Model checking

Homework Assignments