Skip to content
Carlos Galindo edited this page Jan 15, 2020 · 2 revisions

The Control Flow Graph represents the possible control flow connections between statements. It is a graph, whose nodes are the statements of a program, plus Entry and Exit nodes. Its edges are control edges, and they connect instructions if the source and the destination can be executed consecutively (in some execution of the program).

ACFG

A variation, which incorporates false edges for unconditional jumps. False edges connect each statement with the following statement if the jump was a no-operation (a blank operation which does nothing, in Java, an EmptyStmt).

This adds coverage for all unconditional jumps (break, continue, return).

ECFG

TODO handles exceptions (try-catch-finally, throw).

Clone this wiki locally