CS 5387 Spring 2012

Software verification and validation

 

Syllabus

Lecture 01 Notes

Lecture 1 Definitions

Lecture 01 Programming Assignment

Lecture 01 Paper

Lecture 02 Notes

Lecture 03 Notes (posted 02/07/12)

Homework 1 Submissions

 

Lecture 04 Notes (posted 02/14/12)

Homework due 2/19/12 (posted 02/14/12)

Lecture 05 Notes (posted 02/20/12)

Homework due 2/26/12 (posted 02/20/12)

Lecture 06 Notes (posted 02/28/12)

Exam Review (posted 02/28/12)

Homework 3/19 (posted 03/19/12)

Dataflow Testing Notes (posted 03/19/12)

Java Threads (posted 03/19/12)

Propositional ND Rules (posted 03/19/12)

Multi-threaded example (posted 03/27/12)

Model Checking (posted 03/27/12)

Promela (posted 03/27/12)

Homework due 4/1/12 (posted 03/27/12)

-----------------------------------

Model Checking (posted 04/03/12)

LTL (posted 04/03/12)

Homework due 04/08/12 (posted 04/03/12)
For this homework, use SPIN to model the algorithms and show that each algorithm either does or does not satisfy mutual exclusion, race prevention, deadlock prevention, and starvation prevention.

-----------------------------------

Inspections (posted 04/11/12)

Walkthrough Template (posted 04/11/12)

Homework due 04/16/12 (posted 04/11/12)
Read and provide me a 150 word abstract of the linked article.

-----------------------------------

Pairwise Testing (posted 04/18/12)

Mutation Testing (posted 04/18/12)

Midterm Answers (posted 04/29/12)