Abstract: A system, method and computer program product to refine an original complex CFG into a simpler CFG showing interesting paths and reducing interfering paths with dynamic input for the state of program. The method receives/encodes dynamic user input in the form of annotations which encodes user's special interests or knowledge of the program at run time, e.g., some assumptions of any variables appeared, which can be equations of variable and value or relationships between variables. The method then simplifies all the branching points in a generated AST (Abstract Syntax Tree) whenever possible by querying a SMT (Satisfiability Modulo Theories) solver with branching condition and the user annotations and by evaluating immediate values of expressions or eliminate unreachable parts in the CFG. Finally, the method generates a simplified CFG by simplified AST. This can assist a programmer to understand the code and facilitates correlating different basic blocks under a same scenario.

Abstract: A system, method and computer program product to refine an original complex CFG into a simpler CFG showing interesting paths and reducing interfering paths with dynamic input for the state of program. The method receives/encodes dynamic user input in the form of annotations which encodes user's special interests or knowledge of the program at run time, e.g., some assumptions of any variables appeared, which can be equations of variable and value or relationships between variables. The method then simplifies all the branching points in a generated AST (Abstract Syntax Tree) whenever possible by querying a SMT (Satisfiability Modulo Theories) solver with branching condition and the user annotations and by evaluating immediate values of expressions or eliminate unreachable parts in the CFG. Finally, the method generates a simplified CFG by simplified AST. This can assist a programmer to understand the code and facilitates correlating different basic blocks under a same scenario.

Abstract: Generating a scalable code division and workflow chart. Based on definition-and-use cases of variables in a code snippet to be represented by a graph, crossing references to the variables in the code are determined, where a crossing reference associated with a statement involves a definition of the variable before the statement and a use of the variable at or after the statement. The code snippet is divided, based on the crossing references.

Abstract: Generating a scalable code division and workflow chart. Based on definition-and-use cases of variables in a code snippet to be represented by a graph, crossing references to the variables in the code are determined, where a crossing reference associated with a statement involves a definition of the variable before the statement and a use of the variable at or after the statement. The code snippet is divided, based on the crossing references.

Abstract: A computer-implemented method includes performing, by each of a plurality of crawlers, a random walk of a plurality of objects in a heap, where the plurality of objects are memory objects allocated for execution of an application. A timestamp of each object of the plurality of objects is updated, when the object is visited by a crawler of the plurality of crawlers. Garbage is identified, by a computer processor, based at least in part on the timestamp of each object of the plurality of objects. The garbage is reclaimed.

Abstract: Generating a scalable code division and workflow chart. Based on definition-and-use cases of variables in a code snippet to be represented by a graph, crossing references to the variables in the code are determined, where a crossing reference associated with a statement involves a definition of the variable before the statement and a use of the variable at or after the statement. The code snippet is divided, based on the crossing references.

Abstract: Generating a scalable code division and workflow chart. Based on definition-and-use cases of variables in a code snippet to be represented by a graph, crossing references to the variables in the code are determined, where a crossing reference associated with a statement involves a definition of the variable before the statement and a use of the variable at or after the statement. The code snippet is divided, based on the crossing references.