Bug Catching: Automated Program Verification and Testing
CS 15414

Fall 2006
15451
HW 4
1
15414 Bug Catching Fall 2006
Instructor: Edmund Clarke
Teaching assistant: Himanshu Jain
Assignment 2
Due date: Thursday, December 7, 2006
1
CTL and LTL
In the following argue whether t
Bug Catching: Automated Program Verification and Testing
CS 15414

Fall 2006
15451
HW 3
1
15414 Bug Catching Fall 2006
Instructor: Edmund Clarke
Teaching assistant: Himanshu Jain
Assignment 2
Due date: Tuesday, November 14, 2006
1
CTL
This is a problem given in Huth and Ryan
Bug Catching: Automated Program Verification and Testing
CS 15414

Fall 2006
15451
HW 2
1
15414 Bug Catching Fall 2006
Instructor: Edmund Clarke
Teaching assistant: Himanshu Jain
Assignment 2
Due date: Tuesday, October 10, 2006
Problem 2 can be done in groups of two.
1
Impli
Bug Catching: Automated Program Verification and Testing
CS 15414

Fall 2006
15451
HW 1
1
15414 Bug Catching Fall 2006
Instructor: Edmund Clarke
Teaching assistant: Himanshu Jain
Assignment 1
Due date: Tuesday, September 26, 2006
We will discuss homework related doubts on Tu
Bug Catching: Automated Program Verification and Testing
CS 15414

Fall 2006
1
15414 Bug Catching Fall 2006
Handout Sep 12, 2006
1
Principle of Structural Induction
Denition 1: A (propositional) atomic formula is a propositional letter,
(true), (false).
Denition 2: The set of
Bug Catching: Automated Program Verification and Testing
CS 15414

Fall 2006
15451
HW 1
1
15414 Bug Catching Fall 2006
Instructor: Edmund Clarke
Teaching assistant: Himanshu Jain
Assignment 1 Solutions
1
Tautologies
For each of the following formula report if it is a tautolo
Bug Catching: Automated Program Verification and Testing
CS 15414

Fall 2006
GraphBased Algorithms
for Boolean Function Manipulation12
Randal E. Bryant3
Abstract
In this paper we present a new data structure for representing Boolean functions and an associated set of
manipula
Bug Catching: Automated Program Verification and Testing
CS 15414

Fall 2006
Lecture 2: CTL Model Checking
What is model checking?
State transition systems
Computation Tree Logics
The logic CTL
Typical CTL formulas
Structure of the SMV model checker
SMV examples
1
Temporal Log
Bug Catching: Automated Program Verification and Testing
CS 15414

Fall 2006
Satisability Checking of Nonclausal Formulas using
General Matings
Himanshu Jain, Constantinos Bartzis, and Edmund Clarke
School of Computer Science, Carnegie Mellon University, Pittsburgh, PA
Abstra
Bug Catching: Automated Program Verification and Testing
CS 15414

Fall 2007
15414
HW 5
1
Instructor: Edmund M. Clarke
Teaching Assistant: Michael Carl Tschantz
Assignment 5
1
Solving Sudoku using SAT
In Sudoku puzzles, one lls numbers 1 to 9 in the empty squares of a 99 grid
Bug Catching: Automated Program Verification and Testing
CS 15414

Fall 2007
15414
HW 6
1
Instructor: Edmund M. Clarke
Teaching Assistant: Michael Carl Tschantz
Assignment 6
1
Modeling an Automaton
This problem asks you to create two SMV models. Please email your models to th
Bug Catching: Automated Program Verification and Testing
CS 15414

Fall 2007
15414
HW 1
1
Assignment 1
1
Truth Tables
For each of the below pairs of formulae, construct a truth table that shows if the two formulae are
equivalent or not.
(a)
(x y) y and x (y y)
(b)
(x y) z and
Bug Catching: Automated Program Verification and Testing
CS 15414

Fall 2007
15414
HW 2
1
Instructor: Edmund M. Clarke
Teaching Assistant: Michael Carl Tschantz
Assignment 2
1
DNF
Put (x y) (z x) into disjunctive normal form.
2
CNF
Let f be the DNF formula (u v) (w x).
(a) Fi
Bug Catching: Automated Program Verification and Testing
CS 15414

Fall 2007
15414
HW 7
1
Instructor: Edmund M. Clarke
Teaching Assistant: Michael Carl Tschantz
Homework Author: Arie Gurnkel
Assignment 7
1
Using CBMC
For this problem we will use the CBMC program analysis tool
Bug Catching: Automated Program Verification and Testing
CS 15414

Fall 2007
JavaPathFinder Exercises
27th Nov 2007
Preamble
In each exercise, you will be required to write Java programs based on some starter files, and run them
through JPF. You will have to report your final
Bug Catching: Automated Program Verification and Testing
CS 15414

Fall 2007
Model Checking Overview
Edmund M. Clarke, Jr.
School of Computer Science
Carnegie Mellon University
Pittsburgh, PA 15213
What is Model Checking?
Cnd C
i y rawf
ord
Unfortunately, not that kind of mode
Bug Catching: Automated Program Verification and Testing
CS 15414

Fall 2007
15414
HW 3
1
Instructor: Edmund M. Clarke
Teaching Assistant: Michael Carl Tschantz
Assignment 3
Let W be the clause list [w1 , w2 , w3 , w4 , w5 , w6 , w7 ] where
w1 = x1 x2 x3 x4
w5 = x5 x6
w2 = x1