การวิเคราะห์กราฟลำดับการทำงาน

Welcome! In this lesson, we'll dive into Control Flow Graphs (CFGs). A CFG is like a roadmap for your program, visually showing all possible execution paths.

It's a crucial tool in reverse engineering because it helps you understand a program's logic without actually running it.

At the heart of a CFG are basic blocks. Think of a basic block as a straight line of instructions.

• It's a sequence of code with only one entry point (the first instruction).
• It has only one exit point (the last instruction).
• There are no jumps or jump targets anywhere in between.

For example, A = 10; B = A + 5; C = B * 2; could be a single basic block.

Edges in a CFG connect basic blocks, showing how execution can flow from one block to another. These represent jumps, calls, or fall-throughs.

• Unconditional Edges: Always taken, like a direct jump to the next block.
• Conditional Edges: Taken only if a certain condition is met, leading to different paths (e.g., an IF statement).

Let's look at a very simple C program. Its CFG would mostly consist of sequential basic blocks, one after another.

Try running this example:

Conditional statements like if/else create branches in a CFG. A basic block containing a conditional jump will have two outgoing edges.

One edge represents the 'true' path, and the other represents the 'false' path. These paths usually merge back together later.

Loops, such as for or while, are easily identifiable in a CFG by a special type of edge called a back-edge.

A back-edge points from a block inside the loop back to an earlier block, creating a cycle. This cycle represents the repeated execution of the loop body.

When your program calls a function, the CFG represents this too. An edge will typically lead from the caller's basic block to the entry point of the called function's own CFG.

Once the function finishes, execution returns to the caller, usually to the next instruction after the call.

CFGs are incredibly powerful for reverse engineering:

• Understand Logic: Quickly grasp complex decision-making and overall program flow.
• Identify Functions: See distinct subgraphs representing different functions.
• Find Vulnerabilities: Spot unusual paths, unreachable code, or logic flaws.
• Trace Execution: Predict potential execution paths without needing to run the program.

Industry-standard tools like Ghidra and IDA Pro automatically generate and display CFGs for you. They allow you to:

• Visually inspect basic blocks and their connecting edges.
• Click on blocks to view the assembly instructions they contain.
• Follow edges to trace the program's execution flow logically.

This visual aid simplifies understanding complex binaries significantly.

Consider a simple program that includes both an if/else statement and a for loop. Think about how these structures are represented in a Control Flow Graph.

Great job! You've learned the fundamentals of Control Flow Graphs:

• CFGs are visual maps of program execution paths.
• They consist of basic blocks (sequential instruction groups) and edges (showing flow).
• CFGs clearly show conditional logic (if/else) and loops (with back-edges).
• These graphs are indispensable for understanding program logic during reverse engineering, especially when using tools like Ghidra or IDA Pro.