CS447 Lecture 7: L19.pdf
Document Summary
The icc criteria (not seen this year) are often infeasible, and it"s easy to make racc infeasible as well. Workaround ii. instance, if you can"t satisfy racc, settle for cacc. If you can"t satisfy a particular coverage criterion, use a looser criterion. Workaround ii is analogous to best-e ort touring in the graph coverage case. In response to a question in class, i described possible causes of infeasi- bility. Clearly, no array c can have negative length, so the predicate can"t be false. Without inactive clause criteria, we can simplify the subsumption chart in the book to: We"ve seen how to make c determine p; let"s look at an example where we nd values for variables to meet the criteria. We"ll use the following predicate, modi ed from the textbook example testpat: ispat == false && isub + pl - 1 < sl || subject[isub] == pattern[0] We can assign names to these clauses, giving the symbolic predicate:
