This exception is thrown when an abstract basic block is accessed as if it is a regular block.

Basic block type for a call graph (CallCFG).

Call graph, where each node represents a function. This is essentially a wrapper class of `IDiGraph`, which provides a uniform interface for both imperative and persistent graphs.

CFG edge types. We distinguish CFG edges by classifying them into several different kinds.

Basic block type for a disassembly-based CFG (DisasmCFG).

Disassembly-based CFG, where each node contains disassembly code. This is the most user-friendly CFG, although we do not use this for internal analyses. Therefore, this class does not provide ways to modify the CFG.

An abstract information about a function to be used in an intra-procedural CFG. This exists per function call, not per function definition. Therefore, one function can have multiple `FunctionAbstraction` instances.

Interface for an abstractable basic block.

Interface for an addressable basic block.

Interface for a basic block containing disassembled instructions.

Interface for a basic block containing a sequence of instructions.

Interface for a basic block, which contains a sequence of lifted IR statements.

Interface for a basic block containing a sequence of lifted LowUIR statements.

Interface for a basic block containing a sequence of SSA statements.

Interafce for a basic block containing a sequence of SSA statements.

Interface for a visualizable basic block.

A lifted instruction.

Basic block type for IR-level CFGs.

CFG where each node is an IR-level basic block. This is the main data structure that we use to represent the control flow graph of a function. This is essentially a wrapper class of `IDiGraph`, which provides a uniform interface for both imperative and persistent graphs.

The result of non-returning function analysis.

A rundown of a function is really just an array of statements, summarizing the function.

Basic block type for an SSA-based CFG (SSACFG). It holds an array of (ProgramPoint * Stmt).

SSA-based CFG, where each node contains SSA-based basic blocks. This is a wrapper class of `IDiGraph`, which provides a uniform interface for both imperative and persistent graphs.