# CS447 Lecture Notes - Lecture 1: Coverity, For Loop, Natural-Language Processing

## Document Summary

Example write-up of an error state: x = [2,7,0] i =1 count =0. Propagation error propagates and causes false output. Test set = {3 chocolate cones, 1 vanilla cone} ! Node coverage (nc) every node in a cfg is visited at least once. Edge coverage (ec) every edge in a cfg is visited at least once. Path - a sequence of adjacent nodes who are interconnected by edges. Subsequence a sequence that can be derived by deleting some nodes from another sequence. Subpath a subsequence of a path, that is too a path. Test path a path that starts at the initial node and ends at the end node. Syntactically reachable there exists a path from the initial node to node i. Semantically reachable there exists an input for which a path reaches node i from the initial node. Sese graph start at a single initial node, end at a single end node.