|
Abstract
|
AControl Flow Graph (CFG) is a directed graph that represents all paths that might be traversed through a program during its execution. This graph is used to generate test cases for a program. In this paper, we define a hyper-operation on the vertex set of a CFG. Consequently, it is proved that (1) the generated hyperstructure is a quasi-ordering hypergroup, (2) the connectivity in a CFG is equivalent to the inner irreducibility in the hypergroup, and (3) each sub-graph in a CFG is a sub-hypergroup.
|