Abstract: Described is a tool for allowing developers to analyze objects in to process virtual address space. The system includes a technique for identifying references between objects within memory and refining these references with runtime metadata and analysis heuristics. These objects may then be displayed in the form of a graph that employs a progressive disclosure to more effectively allow a developer debug memory. For example, the graph may organize objects within a coordinate grid system that allows a developer to concentrate or expand reference paths as necessary when analyzing objects or detecting potentially leaked or abandoned sources of memory.

Abstract: Described is a tool for allowing developers to analyze objects in to process virtual address space. The system includes a technique for identifying references between objects within memory and refining these references with runtime metadata and analysis heuristics. These objects may then be displayed in the form of a graph that employs a progressive disclosure to more effectively allow a developer debug memory. For example, the graph may organize objects within a coordinate grid system that allows a developer to concentrate or expand reference paths as necessary when analyzing objects or detecting potentially leaked or abandoned sources of memory.

Abstract: A tool for analyzing software is enhanced to provide multiple views of a stack trace, with each view having a different level of detail. Different views may be lightly simplified, moderately simplified, or heavily simplified. The display of a complete stack trace includes entries for all stack frames in the stack trace. The display of a simplified stack trace includes entries for fewer than all stack frames in the stack trace, thereby “hiding” or “collapsing” entries for some of the stack frames, relative to the complete stack trace display. After a user specifies a level of complexity with which to show a stack trace, the enhanced analysis tool GUI updates the stack trace display according to the specified level. A complexity level is associated with a set of heuristics that is used to create a view of a stack trace at that complexity level.

Abstract: A system, method, and computer program for analyzing code execution and software performance characteristics are disclosed. Samples of code during run-time or from crash logs can be displayed as both a top-down tree of calls from a particular function and a bottom-up tree of calls to the particular function. Data mining techniques, including filtering and focusing, remove code that is not of interest and display code that is more relevant to performance analysis. In particular, functions contained in libraries such as system libraries can be stripped from view. The cost associated with an excluded function can be propagated to a calling function, in either the top-down or bottom-up tree.

Abstract: A tool for analyzing software is enhanced to provide multiple views of a stack trace, with each view having a different level of detail. Different views may be lightly simplified, moderately simplified, or heavily simplified. The display of a complete stack trace includes entries for all stack frames in the stack trace. The display of a simplified stack trace includes entries for fewer than all stack frames in the stack trace, thereby “hiding” or “collapsing” entries for some of the stack frames, relative to the complete stack trace display. After a user specifies a level of complexity with which to show a stack trace, the enhanced analysis tool GUI updates the stack trace display according to the specified level. A complexity level is associated with a set of heuristics that is used to create a view of a stack trace at that complexity level.

Abstract: A system, method, and computer program for analyzing code execution and software performance characteristics are disclosed. Samples of code during run-time or from crash logs can be displayed as both a top-down tree of calls from a particular function and a bottom-up tree of calls to the particular function. Data mining techniques, including filtering and focusing, remove code that is not of interest and display code that is more relevant to performance analysis. In particular, functions contained in libraries such as system libraries can be stripped from view. The cost associated with an excluded function can be propagated to a calling function, in either the top-down or bottom-up tree.

Abstract: A system, method, and computer program for analyzing code execution and software performance characteristics are disclosed. Samples of code during run-time or from crash logs can be displayed as both a top-down tree of calls from a particular function and a bottom-up tree of calls to the particular function. Data mining techniques, including filtering and focusing, remove code that is not of interest and display code that is more relevant to performance analysis. In particular, functions contained in libraries such as system libraries can be stripped from view. The cost associated with an excluded function can be propagated to a calling function, in either the top-down or bottom-up tree.