International Business Machines Corporation

Gary Seth Sevitsky

Nick M Mitchell

Nicholas Matthew Mitchell

Ravi B Konuru

Olivier Gruber

Wim De Pauw

Edith Gail Schonberg

Harini Srinivasan

Wim DePauw

Herbert G Derby

Nedumaran Palani Kumanan

A method (and system) of modeling runtime behavior for a software application includes limiting a portion of a run to be analyzed using criteria that define an analysis scenario, structuring events of the analysis scenario as a flow of logical content through a plurality of transformations, applying labels to elements of the flow, and generating a behavior signature for the analysis scenario based on the labels.

Method and system for modeling runtime behavior

A method, information processing system, and computer readable medium for annotating graphs to allow for subsequent quick loading and analysis of very large graphs is described. The present invention encompasses a way to order and annotate nodes of a graph into a data stream that allows for optimization of subsequent processing of nodes in later analysis. For example, a very large reference graph representing heap snapshots may be annotated to facilitate post-processing and visualization of the heap for memory leak analysis. In such an example, the present invention reduces the number of objects and references to be modeled in memory, while still capturing the essence of the non-modeled portions. In this example, the present invention may process reference graphs on the scale of one hundred million live objects per snapshot using a computer with one gigabyte of memory.

Annotating graphs to allow quick loading and analysis of very large graphs

A method for identifying a set of objects in a target application program includes: receiving a plurality of samples of one or more object reference graphs, wherein each object reference graph includes live objects and their references; deriving a set of candidate data structures from the samples; collecting a plurality of properties of each of the live objects in relation to data structures over time; and using a mixture model, combining the plurality of the properties of each live object in a non-linear manner for ranking leak root candidates within each set of candidate data structures The method also includes the identification of an initial set of highly-ranked candidate objects that are possible causes of at least one object leak, wherein the higher the ranking the smaller the identified set.

Automated scalable and adaptive system for memory analysis via identification of leak root candidates

Techniques for assessing the utilization efficiency of a portion of memory are provided. One or more images of a portion of memory are obtained. The one or more memory elements found within each image are categorized into one or more application-neutral categories, wherein the one or more categories distinguish between data and structural overhead. At least one analysis is performed on the one or more categorized memory elements of the one or more images using a measure representative of the efficiency of utilization of the portion of memory. The one or more results of the analysis step are outputted.

Methods and apparatus for assessing health of memory utilization of a program

Analyzing the runtime behavior of a program given a set of one or more probes and points for inserting the probes for performing a specified inspection, includes providing a compiler with one or more of the following types of information about each probe: specifying the probe's context, its filter criteria, whether it is a fast-path probe, whether it is a timing probe, the probe's guard swing, the probe's context hardness, and the probe's temporal hardness; and compiling the program with the one or more probes and the information.

Inspecting the runtime behavior of a program while minimizing perturbation

A method and system for analyzing dynamic behavior of a computer program using user-defined classifications of an execution trace. The method comprises the step of forming a database describing the executions of the program. The database includes static information obtained from the program source, and dynamic information describing particular executions of the program. The database is structured into entities, and each of the entities is comprised of a single type of information about the program execution. Each entity is comprised of elements representing individual program elements of said single type, and each element has attributes with values describing the element. The database is augmented by classifying every element of the database as a member of zero or more user defined execution slices; and dynamic behavior of the program is analyzed using the execution slices.

Methods for analyzing dynamic program behavior using user-defined classifications of an execution trace

Methods are provided for extracting reference patterns in JAVA and depicting the same. The extracted and depicted reference patterns may be used to interactively and selectively explore data structures, and to identify and solve memory leaks. A method for extracting reference relationships among objects corresponding to a running program includes the step of designating a starting set of objects. The starting set of objects is partitioned into subsets of objects grouped by class. A recursive operation is applied to each of the starting subsets. The recursive operation includes the step of, given a subset of objects, identifying a second set of objects. The second set includes all objects that refer to at least one object in the subset when a direction of reference terminates at the starting set. Alternatively, the second set includes all objects that are referred to by at least one object in the subset when the direction of reference originates from the starting set. The recursive operation also includes the step of partitioning the second set into new subsets of objects grouped by class. The recursive operation is applied to each of the new subsets until a predefined depth is reached.

Growing community of inventors

New York, NY, United States of America

Gary Seth Sevitsky