Control flow graph refining via execution data

A system comprising:

• a memory having computer readable instructions;
• and
• one or more processors for executing the computer readable instructions, the computer readable instructions controlling the one or more processors to perform operations comprising:
• generating a preliminary control flow graph from memory dump data and compiler listing data in response to an exception event at a computing program;
• translating code segments associated with each block of the control flow graph to Boolean statements;
• determining whether each Boolean statement is satisfied based on input values retrieved from the memory dump data;
• calculating an edge property value of a first edge and an edge property value of a second edge of a plurality of edges of the preliminary control flow graph based on a satisfaction of the Boolean statements;
• comparing the edge property value of the first edge and the edge property value of the second edge, wherein the first edge and the second edge are both connected to a common block;
• determining that the edge property value of the first edge is less than the edge property value of the second edge based at least in part on the comparison;
• and
• refining the preliminary control flow graph by deleting the first edge of the plurality of edges based at least in part on the determination that the edge property value of the first edge is less than the edge property value of the second edge.

A computer program product comprising a computer readable storage medium having program instructions embodied therewith, the program instructions executable by a processor to cause the processor to perform operations comprising:

• generating a preliminary control flow graph from memory dump data and compiler listing data in response to an exception event at a computing program;
• translating code segments associated with each block of the control flow graph to Boolean statements;
• determining whether each Boolean statement is satisfied based on input values retrieved from the memory dump data;
• calculating an edge property value of a first edge and an edge property value of a second edge of a plurality of edges of the preliminary control flow graph based on a satisfaction of the Boolean statements;
• comparing the edge property value of the first edge and the edge property value of the second edge, wherein the first edge and the second edge are both connected to a common block;
• determining that the edge property value of the first edge is less than the edge property value of the second edge based at least on the comparison;
• and
• refining the preliminary control flow graph by deleting the first edge of the plurality of edges based at least in part on the determination that the edge property value of the first edge is less than the edge property value of the second edge.