• summary and review

Next:

• reversing programs

• managing the number of test cases
• risk assessment calculations
• a little bit of whitebox testing

• specification evolution in the aid of efficiency improvements
• nondeterminism reduction
• strength reduction

• Building the test suite

• review of the STL example
• the LinBox example
• creating test cases with outlines and tables

• semantics of procedure call:
• first with value/result parameters
• Then with reference parameters

• finish discussion of 8 points
• discuss outline
• example system needs test design

• programs using trees

• links on verification tools
• Discussion of testing's 8 point plan.

• invariant from combination of pre and post conditions.
• Saddleback search example

• problem 14.1d revisited
• bounds t which are tighter for iteration counts.

• more on evolving a suitable invariant
• 3 versions of integer square root function
• increment, divide and conquer, newton's method
• Tue, Mar 30 Reading: Gries chapter 16.
  • ballooning - delete a conjunct
  • ballooning - replace constant by variable
  • ballooning - enlarge range of a variable

• Thu, Mar 18 Homework set 2 model solutions.
  • developing loop for 2 dim search
  • developing loop for gcd
  • on Homework set 3 there will be no problem 5.

• Tue, Mar 16 Reading: Gries chapter 15. Homework set 3 Due Thu, Apr 1.
  • More on:
  • Concurrent proof and program development
  • developing loops

• Thu, Mar 11 Reading: Gries chapter 13, 14, 15.
  • Principles of program validation
  • Concurrent proof and program development
  • On developing IFs and DOs

• Tue, Mar 9 Reading: Gries chapter 13, 14.
  • The loop "invariant and bound" checklist
  • proofs and proof summaries of iterations.

• Thu, Mar 4 Reading: Gries chapter 11.
  • Iteration command semantics
  • The "invariant and bound" theorem
  • min of array example

• Tue, Mar 2, Reading: Gries chapter 10, 11. Homework set 1 model solutions.
  • a bit more on Alternation command: if B_1 -> S_1 [] .. [] B_n -> S_n fi
  • Iterative command: do B_1 -> S_1 [] .. [] B_n -> S_n od
  • Invariants: role in proofs about iterations.

• Thu, Feb 26, Reading: Gries chapter 9, 10.
  • review of provability, deduction
  • review of multiple assignment command.
  • Alternation command: if B_1 -> S_1 [] .. [] B_n -> S_n fi

• Tue, Feb 24 Reading: Gries chapter 7,8,9. Homework set 2 Due Tue, Mar 9.
  • wp: determinism: two way Distributivity of Disjunction
  • verification of axioms for skip, abort, sequence
  • Definition of assignment, multiple simultaneous assignment, properties

• Thu, Feb 19 Reading: Gries chapter 7,8.
  • wp: Excluded Miracle, Distributivity of Conjunction
  • wp: Monotonicity, one way Distributivity of Disjunction
  • semantics of skip, abort, sequence

• Tue, Feb 17, Reading: Gries chapter 4,5,6. Homework set 1, Due Tue, Feb 24.
  • Quantifiers and the predicate calculus
  • involving arrays in predicates.
  • weakest preconditions

• Thu Feb 12, Reading: Gries chapter 2, (for 603: also chapter 3).
  • axioms and inference rules.
  • examples of deductive proofs
  • predicates and the cand, cor operators
• Tue Feb 10, 11:00-12:15, in Smith 219, Reading: Security, Gries forward, preface, chapter 1.
  • course organization
  • correctness, what's the issue? proofs and tests.
  • propositional calculus notations, truth table proofs
  • laws of equivalence

saunders@cis.udel.edu