US 9,864,672 B2Grant
Module specific tracing in a shared module environment
Issue Date:2018-01-09
•30 Claims
•12 Drawing Sheets
Abstract
Visualizing execution of an application in a trace coverage graph includes receiving module trace data gathered during execution of an executable module. The module trace data includes data representing sequences of execution between individual executable components. A trace coverage graph is generated and displayed from the module trace data. The trace coverage graph includes graph nodes that each correspond to a different executable component. The trace coverage graph also includes graph edges that each visually connects two of the graph nodes. Each graph edge visually indicates an amount of trace data present for the sequence of execution between the graph nodes that are connected by the graph edge. Thicker graph edges represent the presence of a larger amount of trace data, and thinner graph edges represent the presence of a lesser amount of trace data.
Metadata
Assignee
- Microsoft Technology Licensing, LLC
Inventors
- Tetsuo Seto
- Alexander G. Gounares
- Russell S. Krajec
Application Information
Application Number:US 15/068,996
Filing Date:2016-03-14
Priority Date:2013-09-04
Art Unit:2191
Classifications
IPC:
G06F9/44G06F11/00G06F11/36G06F21/31G06F21/12G06F11/34
Field of Search:
G06F 11/34G06F 11/3409G06F 11/3466G06F 11/3636G06F 11/3664G06F 21/12G06F 21/31G06F 2201/865
Patent Drawings (12 sheets)
Description
Cross Reference to Related Applications
[0001] This application is a continuation of U.S. patent application Ser. No. 14/455,156 filed on Aug. 8, 2014, entitled “MODULE SPECIFIC TRACING IN A SHARED MODULE ENVIRONMENT,” which issued as U.S. Pat. No. 9,292,416 on Mar. 22, 2016, which claims the benefit of and priority to U.S. Provisional Patent Application Ser. No. 61/873,773 filed on Sep. 4, 2013 and entitled “MODULE SPECIFIC TRACING IN A SHARED MODULE ENVIRONMENT,” the entirety of each of which are incorporated herein by reference.
Background
[0002] Application tracing is one mechanism to understand and monitor an application. Tracing is a mechanism to collect data while the application executes. In some uses, application tracing may be used for monitoring the ongoing performance of an application. In other uses, application tracing may be used by a developer to understand an application, identify any problems, and improve the application.
[0003] In many computer languages and communities, some code may be distributed as modules, libraries, or other reusable components. These modules may be distributed as source code, intermediate code, executable code, or some other form, but may all share the characteristic that the modules may be reused by other programmers in many different applications.
Summary
[0004] A module-specific tracing mechanism may trace the usage of a module on behalf of the module developer. The module may be used by multiple application developers, and the tracing system may collect and summarize data for the module in each of the different applications. The data may include usage data as well as performance data. Usage data may include anonymized data for each time the module may be invoked and called, and performance data may include the processing time, memory consumption, and other metrics. The module-specific tracing may be enabled or disabled by an application developer.
[0005] A tracing system may trace applications and their modules, and may make module-specific data available through various interfaces. The tracing system may collect tracer data while an application executes, and may preprocess the data into application-specific and module-specific databases. An analysis engine may further analyze and process these databases to create application-specific views and module-specific views into the data. The application-specific views may be intended for a developer of the application, while the module-specific views may have a public version accessible to everybody and a module developer version that may contain additional details that may be useful to the module developer.
[0006] A database of module performance may be generated by adding tracing components to applications, as well as by adding tracing components to modules themselves. Modules may be reusable code that may be made available for reuse across multiple applications. When tracing is performed on an application level, the data collected from each module may be summarized in module-specific databases. The module-specific databases may be public databases that may assist application developers in selecting modules for various tasks. The module-specific databases may include usage and performance data, as well as stability and robustness metrics, error logs, and analyses of similar modules. The database may be accessed through links in module description pages and repositories, as well as through a website or other repository.
[0007] This Summary is provided to introduce a selection of concepts in a simplified form that are further described below in the Detailed Description. This Summary is not intended to identify key features or essential features of the claimed subject matter, nor is it intended to be used to limit the scope of the claimed subject matter.
Brief Description of the Drawings
[0008] In the drawings,
[0009] FIG. 1 is a diagram illustration of an embodiment showing a system for tracing applications and modules.
[0010] FIG. 2 is a diagram illustration of an embodiment showing a network environment with devices that may collect and view application and module trace data.
[0011] FIG. 3 is a diagram illustration of an example embodiment showing a user interface for module trace data.
[0012] FIG. 4 is a diagram illustration of an embodiment showing an example trace coverage graph.
[0013] FIG. 5 is a diagram illustration of an embodiment showing an example module topology graph.
[0014] FIG. 6 is a flowchart illustration of an embodiment showing a method for creating applications.
[0015] FIG. 7 is a flowchart illustration of an embodiment showing a method for application execution with module tracing.
[0016] FIG. 8 is a flowchart illustration of an embodiment showing a method for application execution with application tracing.
[0017] FIG. 9 is a flowchart illustration of an embodiment showing a method for preprocessing tracer data.
[0018] FIG. 10 is a flowchart illustration of an embodiment showing a method for processing module trace data.
[0019] FIG. 11 is a flowchart illustration of an embodiment showing a method for processing requests for module data.
Detailed Description
[0020] Module Specific Tracing System
[0021] A tracing system may collect data about modules that may be incorporated into multiple applications. The modules may be shared sets of code that may be distributed among developers, and the developers may select various modules to incorporate into their applications.
[0022] Some of the modules may incorporate a tracing mechanism, which may trace the operations of the module and store tracer data. The tracer data may include usage data, which may describe the number of uses, timestamps for uses, conditions under which the module was used, and other usage data. The tracer data may also include performance data, such as the amount of time taken to execute, amount of computational resources, memory resources, network resources, or other resources consumed during execution.
[0023] The module specific tracing system may consolidate the raw data for the module developer and for other users. Some embodiments may include a detailed view of the data for module developers and a less detailed view for other users. Module developers may use the tracer data to identify portions of the module that may be executing poorly or have some other issue. The other users may examine the module tracing data to determine a general notion of performance of the module and may use the tracing data as part of the criteria for comparing and selecting one module over another.
[0024] In one use scenario, a module developer may incorporate a tracing mechanism in the module. The tracing mechanism may operate within the confines of the module and only trace code within the module. In many cases, the tracing mechanism may be able to gather some metadata about the environment in which the module was executed.
[0025] The tracing mechanism may gather tracing data while the module executes in an application. The tracing mechanism may transmit the tracing data to a database for analysis. In many cases, the application developer may have an option to turn off the tracing mechanism or set various options for the tracing mechanism, even though the tracing mechanism may have been initially incorporated and configured by the module developer.
[0026] In the use scenario, the tracing mechanism may gather usage and performance data that the module developer may use to improve the module. These tracer data may help the module developer understand which portions of the module are used more frequently than others, which may help the module developer prioritize improving the most used portions. The tracer data may also help identify code that is less reliable than other code, and the data may be used to generate robustness or fragility measurements of individual functions.
[0027] In another use scenario, an application developer may access the module specific data to gauge whether or not to use the module in a particular application. The developer may have identified several modules that may serve a particular purpose, and then may use the tracer data as one metric to select between the modules. The application developer may investigate the module's reliability and robustness by viewing the performance and usage data.
[0028] Tracing System for Application and Module Tracing
[0029] A tracing system may provide tracing for applications and modules using similar techniques and mechanisms yet with some differences. The tracing system may gather tracing data while an application executes, and that data may be shared with the application developer, the module developer, and a wider audience of potential module users. In some cases, the wider audience may be public at large.
[0030] Each of the three audiences may have different uses for the tracer data and different security concerns. The application developer may view the application as a trade secret, and may not wish certain tracer information be shared outside of the team developing the application. The module developer may wish to collect data on how the module performed, but may not wish for some details of the operations be disclosed to the general public. The public at large may include developers who may be building their own applications, and these developers may wish to view the module specific data to determine whether or not the module is suited for their use.
[0031] The application developer may request tracing be performed on their application. Such tracing data may include tracing information that may be proprietary, such as the values of data elements handled by the application, the application architecture and function, source code of the application, and other information. Because the application developer may consider this as secret or proprietary, such information may be processed and stored in a database that may be separate from the data that may be shared with the module developer and the public at large.
[0032] The data collected for each module may be collected when the application is executed. As such, module-specific data collection may be a subset of the available data because the module-specific data may be shared with a module developer who may be another party other than the application development team. In some cases, the module developer may be a third party who may create and disseminate a module without knowing who may use the module in their application.
[0033] The module-specific data may be collected as part of executing an application, but only those subsets of data that the application developer may permit to be collected may actually be collected. In many cases, the application developer may have a set of configuration settings that may enable or disable certain types of data to be collected. In some cases, certain data elements may not be collected at all for module-specific tracing.
[0034] In some cases, an application developer may disable or not install application-level tracing but may permit a module developer to collect tracer data as a module executes within the application. In such situations, an application may execute without tracing, but when the module is executed, the tracing may occur only within the module. Such module-specific tracing may be processed and made available to the module developer and, in some cases, a wider audience. In such cases, the module-specific tracing may be much more limited in scope than if the application developer had enabled tracing for the entire application.
[0035] When an application developer enables tracing for an entire application and permits tracing for individual modules, the application developer may be able to view a complete set of the data relating to each module, with a subset of the data being transmitted and processed in the module-specific manner. In such a situation, the application developer may have access to a superset of data for a specific module than the module developer would be able to access.
[0036] Module Database with Tracing Options
[0037] A module database may use tracing data to decorate descriptions of modules. The module database may list various modules that may be incorporated into applications. The decorations may include performance and usage data, as well as summaries and other data that may be useful for evaluating modules and comparing modules against each other.
[0038] The module database may be constructed by analyzing tracer data gathered while an application executes a module. A tracer may gather performance and usage data for the module during execution, and these data may be aggregated, summarized, and displayed for a user to browse.
[0039] The tracer data may include actual usage of the module by third parties, as well as the manners in which the module was incorporated into various applications. The application developers may select and use a module but may only exercise a subset of the module's functionality. In many cases, a module may have many different functions, methods, objects, or other components, yet an application developer may use one a small subset of the components.
[0040] The third party usage may be gathered when the application is used by an end user. For example, an application may consist of an app that runs on a mobile device along with a backend component that executes on a server in a datacenter. The end user may exercise the application in many different manners, some of which may exercise the module and some which may not.
[0041] The usage data may reflect the popularity and usefulness of the various components of the module. When these data may be presented to the module developer or to other application developers, the data may be arranged as a popularity score or percentage.
[0042] The usage data may be tracked over time to determine which applications continue to use the module and which modules are being included and removed from various applications. In many cases, an application developer may select a module, use the module for a short period of time, then switch to another module. In such a situation, the application developer made a conscious decision to switch from one module to another, indicating the application developer's preference for the second module over the first. This preference may be valuable to another application developer who may be considering the use of the first module.
[0043] The performance data for the various functions or components within the module may be used to develop a reliability or robustness metric for each function. The reliability or robustness metric may be an indicator of how fragile a function may be, and may be useful for an application developer when selecting specific functions for incorporation in their application. The reliability or robustness metric may be based on the variance of performance metrics or other factors.
[0044] The module database may include graphical or other indicators of the architecture of the module. In many cases, a module may include several other modules, each of which may be invoked when an application executes. Such complex interactions may not be readily apparent from reading the source code or from other sources. The graphical representation of the module may give an application developer a visual indication of the complexity of the module and the various dependencies.
[0045] The module database may roll up or aggregate various metrics about the dependencies of a module to generate data for a given module. The various use and performance data of the modules may be apportioned to the various modules that actually perform the underlying functions. For example, a module may call a second module to perform certain tasks, and one of those tasks may be performed by a third module. In such a case, the first module's function may be displayed along with the second and third module's functions and the data collected from each of the dependencies.
[0046] Throughout this specification and claims, the term “module” is used to define a group of reusable code that may be incorporated into an application. A module may be known as a ‘library’, ‘subroutine’, or some other notion. For the purposes of this specification and claims, these terms are considered synonymous.
[0047] The “module” may be code that is arranged in a way that multiple applications may access the code, even though the applications may have no connection with each other. In general, a “module” may be code that is configured to be reused. In some cases, a module may be reused within the scope of a large application, while in other cases, the module may be shared to other application developers who may use the module in disparate and unconnected applications.
[0048] Many programming languages and paradigms have a notion of a “module” or library, where the module may have a defined interface through which an application may invoke and use the module. Some paradigms may allow a programmer to incorporate a module in a static manner, such that the module code does not further change after the application is written and deployed. Some paradigms may allow for dynamic libraries, which may be loaded and invoked at runtime or even after execution has begun. The dynamic libraries may be updated and changed after the application may have been distributed, yet the manner of invoking the libraries or modules may remain the same.
[0049] Modules may be distributed in source code, intermediate code, executable code, or in some other form. In some cases, modules may be services that may be invoked through an application programming interface.
[0050] Throughout this specification and claims, the terms “profiler”, “tracer”, and “instrumentation” are used interchangeably. These terms refer to any mechanism that may collect data when an application is executed. In a classic definition, “instrumentation” may refer to stubs, hooks, or other data collection mechanisms that may be inserted into executable code and thereby change the executable code, whereas “profiler” or “tracer” may classically refer to data collection mechanisms that may not change the executable code. The use of any of these terms and their derivatives may implicate or imply the other. For example, data collection using a “tracer” may be performed using non-contact data collection in the classic sense of a “tracer” as well as data collection using the classic definition of “instrumentation” where the executable code may be changed. Similarly, data collected through “instrumentation” may include data collection using non-contact data collection mechanisms.
[0051] Further, data collected through “profiling”, “tracing”, and “instrumentation” may include any type of data that may be collected, including performance related data such as processing times, throughput, performance counters, and the like. The collected data may include function names, parameters passed, memory object names and contents, messages passed, message contents, registry settings, register contents, error flags, interrupts, or any other parameter or other collectable data regarding an application being traced.
[0052] Throughout this specification and claims, the term “execution environment” may be used to refer to any type of supporting software used to execute an application. An example of an execution environment is an operating system. In some illustrations, an “execution environment” may be shown separately from an operating system. This may be to illustrate a virtual machine, such as a process virtual machine, that provides various support functions for an application. In other embodiments, a virtual machine may be a system virtual machine that may include its own internal operating system and may simulate an entire computer system. Throughout this specification and claims, the term “execution environment” includes operating systems and other systems that may or may not have readily identifiable “virtual machines” or other supporting software.
[0053] Throughout this specification and claims, the term “application” is used to refer to any combination of software and hardware products that may perform a desired function. In some cases, an application may be a single software program that operates with a hardware platform. Some applications may use multiple software components, each of which may be written in a different language or may execute within different hardware or software execution environments. In some cases, such applications may be dispersed across multiple devices and may use software and hardware components that may be connected by a network or other communications system.
[0054] Throughout this specification, like reference numbers signify the same elements throughout the description of the figures.
[0055] In the specification and claims, references to “a processor” include multiple processors. In some cases, a process that may be performed by “a processor” may be actually performed by multiple processors on the same device or on different devices. For the purposes of this specification and claims, any reference to “a processor” shall include multiple processors which may be on the same device or different devices, unless expressly specified otherwise.
[0056] When elements are referred to as being “connected” or “coupled,” the elements can be directly connected or coupled together or one or more intervening elements may also be present. In contrast, when elements are referred to as being “directly connected” or “directly coupled,” there are no intervening elements present.
[0057] The subject matter may be embodied as devices, systems, methods, and/or computer program products. Accordingly, some or all of the subject matter may be embodied in hardware and/or in software (including firmware, resident software, micro-code, state machines, gate arrays, etc.) Furthermore, the subject matter may take the form of a computer program product on a computer-usable or computer-readable storage medium having computer-usable or computer-readable program code embodied in the medium for use by or in connection with an instruction execution system. In the context of this document, a computer-usable or computer-readable medium may be any medium that can contain, store, communicate, propagate, or transport the program for use by or in connection with the instruction execution system, apparatus, or device.
[0058] The computer-usable or computer-readable medium may be, for example but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, device, or propagation medium. By way of example, and not limitation, computer readable media may comprise computer storage media and communication media.
[0059] Computer storage media includes volatile and nonvolatile, removable and non-removable media implemented in any method or technology for storage of information such as computer readable instructions, data structures, program modules or other data. Computer storage media includes, but is not limited to, RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, digital versatile disks (DVD) or other optical storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other medium which can be used to store the desired information and which can accessed by an instruction execution system. Note that the computer-usable or computer-readable medium could be paper or another suitable medium upon which the program is printed, as the program can be electronically captured, via, for instance, optical scanning of the paper or other medium, then compiled, interpreted, of otherwise processed in a suitable manner, if necessary, and then stored in a computer memory.
[0060] When the subject matter is embodied in the general context of computer-executable instructions, the embodiment may comprise program modules, executed by one or more systems, computers, or other devices. Generally, program modules include routines, programs, objects, components, data structures, etc. that perform particular tasks or implement particular abstract data types. Typically, the functionality of the program modules may be combined or distributed as desired in various embodiments.
[0061] FIG. 1 is an illustration of an example embodiment 100 showing a tracer data collection system. Embodiment 100 may be an overview of a process that collects tracer data from an application. The tracer data may fall into application-specific or module-specific classifications, and may be handled differently based on the classification.
[0062] A tracer may be incorporated into individual modules or an application as a whole. The tracer output may be used to populate a module database, which may be used by application developers to evaluate, compare, and select modules for their application. The module database may include records for each module for which the tracing system has gathered data.
[0063] In some use cases, a module developer may incorporate a tracing mechanism into a module. In such a case, each time the module is incorporated into an application and executed, the embedded tracer may collect data for that module. Unless the tracer is configured otherwise, the tracer may gather data for that module but not for the remainder of the application.
[0064] The tracer data may be accessed in multiple manners. Module developers may access tracer data for their modules and view more detailed tracer data than the general public, which may have access to a subset of the tracer data for the module. Application developers may access application-specific data, which may be more detailed than the data available to the module developers or the general public.
[0065] As described above, the three classes of audiences may have different uses of the data and different security concerns. For the application developer, the application may be a proprietary project that may include trade secrets or other information that the application developer may not wish to share. This application-specific data may include, for example, the control and sequence of the application, data types handled by the application, the raw data processed by the application, and other information that may be proprietary. As such, the application-specific data may be stored in a separate database than module-specific data and access to the application-specific data may be limited to authorized users.
[0066] In many cases, the module developer may have created and distributed a module so that application developers may reuse the module. Module developers may be commercial software companies as well as open source software developers. Such developers may desire to see their modules in use, either for commercial purposes or for the satisfaction of contributing to the community.
[0067] The tracer data that may be collected from an application but made available to the module developers may be sanitized, anonymized, or otherwise scrubbed to remove proprietary information from the data. Such operations may limit the application-specific information in the module traces, but may enable the module developer to have access to the module specific data.
[0068] A module developer may access module-specific data to monitor the deployment and use of the module, as well as to identify performance issues with the module. The module-specific data may also be made available to a wider audience, such as the general public. The general public may make use of the module-specific data to compare and select modules.
[0069] A module developer 102 may contribute modules 104, which may be used by an application developer 106 to build an application 108. A tracing module 110 may be incorporated into individual modules 104 or into the application 108. When a tracing module 110 is incorporated into one or more modules 104, those modules may be traced. When a tracing module 110 is incorporated into the application 108, all of the application 108 may be traced, including any modules included in the application 108.
[0070] The application 108 may be executed in an execution environment 112. During execution, a tracer 114 may gather data, which may be passed to a preprocessor 116. In many cases, the tracer 114 may gather data and transmit those data to the preprocessor 116 on a periodic basis.
[0071] The preprocessor 116 may perform lightweight analyses, formatting, or other processing, then store application-specific data in an application database 118 and module-specific data in various module databases 120. In many cases, the module databases 120 may be configured with a separate database for each module that may be traced.
[0072] An analysis engine 122 may perform further analysis of the stored data to produce analyzed application data 124 or analyzed module data 126, respectively. The analysis engine 122 may perform many different types of analyses, including analyzing historical data, summarizing usage and performance statistics, graphing and charting data, and other analyses. In some cases, the analysis engine 122 may perform analyses on demand, meaning that some analyses may be performed when the analyzed data may be requested. In other cases, the analysis engine 122 may perform analyses ahead of time so that the analyzed data may be readily available when requested.
[0073] A module developer 102 may have private access 130 to the analyzed module data 128. The module developer's private access of the module-specific data may include details about performance and usage. In contrast, an application developer 106 may have public access 132 to the analyzed module data 128, which may contain fewer details and only a subset of the data available through the private access 130 of the module developer 102.
[0074] The public access 132 may include summaries of the tracer data collected for the module, including performance and usage statistics. An example of such a user interface may be found later in this specification.
[0075] An application developer 106 may have private access 126 to the analyzed application data 124. This access may include extensive data regarding the performance of the application as a whole, including the performance of the various modules. In some cases, the application developer 106 may be able to access more data or a different set of data than a module developer 104. For example, an application developer 106 may be able to access parameter values passed to a module, where the parameter values may be proprietary and not available to the module developer 104.
[0076] The application developer 106 may have control over which types of data may be made available to the module databases 120. For example, the application developer 106 may fully turn off any sharing of the module-specific data, but such data may still be collected, stored, and made available through the private access 126 of the application developer 106.
[0077] The application developer 106 may place various limits on the data that may be shared in the module databases. For example, the application developer 106 may permit usage statistics to be collected, but may not permit values of variables to be collected. The application developer 106 may establish that the data may be obfuscated or anonymized prior to being included in the module databases 120.
[0078] FIG. 2 is a diagram of an embodiment 200 showing components that may collect data when an application executes and present various user interfaces showing the collected data. The example of embodiment 200 is merely one example of a multi-device system that may generate and view tracer data. Other architectures may include single device and multiple device architectures.
[0079] The architecture of embodiment 200 includes a device 202 on which the tracer data may be collected, as well as several other devices for storing and processing different elements of the collected data. A client device may present and view the collected data. In other embodiments, some or all of the functions illustrated may be combined into one or more devices.
[0080] The diagram of FIG. 2 illustrates functional components of a system. In some cases, the component may be a hardware component, a software component, or a combination of hardware and software. Some of the components may be application level software, while other components may be execution environment level components. In some cases, the connection of one component to another may be a close connection where two or more components are operating on a single hardware platform. In other cases, the connections may be made over network connections spanning long distances. Each embodiment may use different hardware, software, and interconnection architectures to achieve the functions described.
[0081] Embodiment 200 illustrates a device 202 that may have a hardware platform 204 and various software components. The device 202 as illustrated represents a conventional computing device, although other embodiments may have different configurations, architectures, or components.
[0082] In many embodiments, the device 202 may be a server computer. In some embodiments, the device 202 may still also be a desktop computer, laptop computer, netbook computer, tablet or slate computer, wireless handset, cellular telephone, game console or any other type of computing device.
[0083] The hardware platform 204 may include a processor 208, random access memory 210, and nonvolatile storage 212. The hardware platform 204 may also include a user interface 214 and network interface 216.
[0084] The random access memory 210 may be storage that contains data objects and executable code that can be quickly accessed by the processors 208. In many embodiments, the random access memory 210 may have a high-speed bus connecting the memory 210 to the processors 208.
[0085] The nonvolatile storage 212 may be storage that persists after the device 202 is shut down. The nonvolatile storage 212 may be any type of storage device, including hard disk, solid state memory devices, magnetic tape, optical storage, or other type of storage. The nonvolatile storage 212 may be read only or read/write capable. In some embodiments, the nonvolatile storage 212 may be cloud based, network storage, or other storage that may be accessed over a network connection.
[0086] The user interface 214 may be any type of hardware capable of displaying output and receiving input from a user. In many cases, the output display may be a graphical display monitor, although output devices may include lights and other visual output, audio output, kinetic actuator output, as well as other output devices. Conventional input devices may include keyboards and pointing devices such as a mouse, stylus, trackball, or other pointing device. Other input devices may include various sensors, including biometric input devices, audio and video input devices, and other sensors.
[0087] The network interface 216 may be any type of connection to another computer. In many embodiments, the network interface 216 may be a wired Ethernet connection. Other embodiments may include wired or wireless connections over various communication protocols.
[0088] The software components 206 may include an operating system 218 on which various software components and services may operate. Depending on the embodiment, the application 222 may be executed in an operating system 218 or in an execution environment 220. An execution environment 220 may have memory management, process scheduling, and other components that may manage application execution in a similar manner to an operating system 218.
[0089] A tracing gatherer 224 may work with either the operating system 218 or execution environment 220. The tracing gatherer 224 may include a tracer 226 and a communications manager 228. The tracer 226 may monitor the operations of the application 222, while the communications manager 228 may transmit the tracer data to a preprocessor system 240.
[0090] The tracer 226 and communications manager 228 may be components of a tracer that may be included in the application 222. The application 222 may have a tracer 230 which may trace the entire application 222, including all of the modules 234. When a module developer wishes to trace their module, a tracer 236 may be included in the specific module 234 to be traced.
[0091] The application 222 may include a tracer configuration 232 which may define different parameters for the tracer. In some cases, the tracer configuration 232 may define which data elements may be collected, the precision of the data being collected, which data elements may be shared with module developers, and other items. In some cases, the tracer configuration 232 may define one configuration for one module and a different configuration for another module.
[0092] The communications manager 228 may package and transmit tracer data to a preprocessor system 240, which may be accessed over a network 238. The preprocessor system 240 may have a hardware platform 242, which may be similar to the hardware platform 204, and on which a preprocessor 244 may operate.
[0093] The preprocessor 244 may receive tracer data and perform some preliminary processing prior to storing the data in the application database server 246 or the module database server 254. In many cases, the preprocessor 244 may be designed to handle a high volume of tracer data.
[0094] The application database server 246 may have a hardware platform 248, which may be similar to the hardware platform 204, on which two databases may operate. An application database 250 may contain application-specific tracer data in raw or preprocessed form. An analyzed application database 252 may contain analyzed application data that may be ready for viewing by an application developer.
[0095] The module database server 254 may have a hardware platform 256, which may be similar to the hardware platform 204, on which two databases may operate. A module database 258 may contain module-specific tracer data in raw or preprocessed form. An analyzed module database 260 may contain analyzed module data that may be ready for viewing by a module developer or a third party.
[0096] An analysis system 262 may have a hardware platform 264, which may be similar to the hardware platform 204, on which an analysis engine 266 may execute. The analysis engine 266 may perform various analyses of the application tracer data or module tracer data. The analyses may include summarizing the data, combining the tracer data with other data sources, visualizing the data, or other operations on the data.
[0097] An access portal system 268 may have a hardware platform 270, which may be similar to the hardware platform 204, on which an access portal 272 may execute. The access portal 272 may be a web service or other application that may gather data from the analyzed application database 252 or the analyzed module database 260 for display on a client system 274. The access portal 272 may include authentication systems, user account and login systems, billing and accounting systems, and other functions.
[0098] The client system 274 may have a hardware platform 276, which may be similar to the hardware platform 204, on which a browser 278 may execute. The browser 278 may be used to access the access portal 272 and generate a user interface 280. The user interface 280 may be different based on the user and the user's credentials. For example, application developers may be able to view application data for their applications, as well as the module database for third party or general consumption. Similarly, a module developer may be able to see detailed module-specific data for their modules but not for other modules or for applications. A third party may be able to view module information permitted for general consumption but not be able to access application data or detailed module-specific data.
[0099] FIG. 3 is an example embodiment 300 showing a user interface for module trace data. Embodiment 300 is a user interface 302 that may be an example of a publically available module-specific user interface for a module named CONFIG.
[0100] The user interface 302 may represent the type of data that may be publically available after being gathered from a tracer. The tracer may be a module-specific tracer or may be an application-level tracer. The type of data illustrated in the example of embodiment 300 may be merely illustrative as possible types of data and possible methods for aggregating and displaying the data. Other embodiments may have different types of data and mechanisms for communicating the data.
[0101] A name 304 may identify the module as CONFIG. A set of summarized ratings 306 may give a user a high level summary of the module's reliability, popularity, and how the module is trending. Reliability may be a metric derived from usage and performance data that may reflect the robustness or fragility of the module as a whole.
[0102] Popularity may be a metric that reflects the community's usage of the module. In some cases, the popularity may reflect the module's popularity in comparison to the community as a whole, in comparison to comparable modules, or in some other context.
[0103] A trending indicator may indicate if the module is increasing or decreasing in overall popularity and robustness. If the module is being used less and less or if the subsequent releases of the module are poorer performing than previous releases, the trend indicator may be down. Conversely, if the module is gaining users and each release of the module increases reliability, the trend may be upwards.
[0104] The reliability, popularity, and trending indicators are merely three examples of high level summary indicators that may be useful for a user interface describing a particular module.
[0105] A set of dataset information 308 may display the quantity of data that may underlie the displayed data. In the example, the number of datasets analyzed may be 252,000 and the number of applications using the module may be 15,000. These numbers may lend credibility to the overall data, giving the views confidence that the performance and usage data are based on a statistically significant population of data.
[0106] A set of function-specific data 310 may show observations for individual functions within a module. Many modules may include multiple functions, objects, or other components, each of which may be called or invoked individually. In the example, lines 314, 316, 318, and 320 may illustrate summary data for config.foo, config.bar, config.baz, and config.qux, respectively.
[0107] The type of function-specific data may include a use percentage, which may indicate which of the functions are used the most. In the case of config.qux, the use percentage may be 0, which may occur when no trace data exists for the function. In one example of an analysis routine, the source code for the config module may be read to identify each of the available functions. The list of functions may be compared with the tracer data to generate some of the function specific data 310.
[0108] An error rate may be determined for each function, as well as the CPU consumption and memory consumption. The resource consumption of CPU and memory may be given as a mean with a standard deviation. The standard deviation may be one metric of a function's stability or reliance. A reliability score for the function may also be included. The reliability score may be determined using an algorithm or heuristic that may capture the variance in resource consumption.
[0109] A graph of usage trends 320 may be one mechanism that shows usage of the function over time. In the case of the graph of usage trends 320, the top portion 322 of the graph may show new applications that add the module, while the bottom portion 324 may show applications that no longer use the module.
[0110] In some cases, a module may be added to an application during an initial phase, then removed later when an application developer elects to change out the module for another one. This usage pattern is one mechanism that may indicate that the second module may be better suited for the application that the current module. When a tracing system can capture or infer such behavior, the desirability of the second module may be strongly indicated and the undesirability of the first module may also be strongly indicated. These types of patterns may be very valuable feedback that may be passed to the module developer who may investigate and improve their module, as well as an application developer who may be searching for a module.
[0111] The graph may be interactive, and an example interactive box 326 may be placed on the user interface when a user hovers or clicks on one of the bars in the graph. The interactive box 326 may show underlying data for the selected bar.
[0112] A coverage graph 328 may visually illustrate the components of the module for which trace data exists. An example of a coverage graph may be found later in this specification.
[0113] Similarly, a module topology graph 330 may visually illustrate the links between the current module and other modules that the current module may call. An example of a module topology graph may be found later in this specification.
[0114] A competing modules area 332 may list similar or competitive modules to the current module. The modules listed may have hot links, buttons, or other mechanisms that may cause the user interface to change to that module. The competing modules may include indicators showing the relative strength of the other modules, the module's trends, or some other indicators.
[0115] FIG. 4 is an example diagram of an embodiment 400 showing a trace coverage graph. The graph 402 may show various functions or components of a module as the nodes of the graph. The edges of the graph may reflect the connections or sequences of execution of the nodes, and may be drawn to reflect amount of data that were used to generate the coverage graph.
[0116] In many embodiments, each of the nodes of graph 402 may be labeled with references to the executable code represented by each of the nodes. For the sake of simplicity in the figure, such labels have been removed.
[0117] In the example of embodiment 400, nodes 404, 406, 408, and 410 may be connected with thick, heavy lines. Such lines may indicate that a large amount of trace data may be present for that sequence of execution. In contrast, the sequence of node 404, 412, 414, and 416 may have much less supporting data. In the case of nodes 418, 420, 422, and 424, the dashed lines may indicate that no trace data may be available. In such a case, the code associated with nodes 418, 420, 422, and 424 may never have been exercised by an application.
[0118] The graph 402 may be an interactive graph. As an example of an interaction, a user may hover, click, select, or otherwise indicate node 404 and an interactive component 426 may be displayed. The interactive component 426 may display additional underlying data about the node.
[0119] FIG. 5 is an example diagram of an embodiment 500 showing a module topology graph. The graph 502 may show a module and its dependencies, which may be other modules that may be included or called from the base module. The nodes of the graph may reflect the base module and its dependencies. The edges of the graph may reflect the connections or function calls to the dependent modules.
[0120] The graph 502 may be a visual image of the call structure of a module, and may be used to give a user a graphical view of the complexity and dependencies of a module.
[0121] A module config 504 may be illustrated as a shaded or highlighted node. This node may represent the base node for the graph. The nodes 506, 508, 510, 510, 512, 514, 516, and 518 may represent modules alpha, beta, gamma, delta, epsilon, zeta, and eta, respectively. The interconnections illustrate the function calls or other dependencies between modules.
[0122] In the example of embodiment 500, the module config 504 is shown to call node 510, module gamma, which in turn calls node 514, module epsilon. Module epsilon, node 514, calls modules zeta and eta, as represented by nodes 516 and 518. This structure may communicate to a viewer how module eta on node 518 relates to module config 514.
[0123] FIG. 6 is a flowchart illustration of an embodiment 600 showing a method for creating applications. Embodiment 600 illustrates a general method that an application developer may use to create an application that includes one or more modules or libraries.
[0124] A developer may begin coding an application block 602. While coding, the developer may identify a function in block 604 that may prompt a search in block 606 for modules that may perform the function. From the list of candidate modules in block 606, the developer may evaluate each candidate in block 608.
[0125] The developer may examine the module-specific trace data in block 610 for each of the candidate modules. An example of such data may be found in the user interface of embodiment 300. From these data, the developer may be able to select an appropriate module in block 612 and incorporate the module into the application in block 614.
[0126] If the module developer has added tracing in block 616, the application developer may be able to configure various tracing parameters for the module in block 618. The tracing parameters may allow the application developer to select different options for the tracer.
[0127] The tracing parameters may be configured in many different manners to allow the application developer to control how the module may be traced. The module tracing may be requested by a module developer to address specific goals that the module developer may have, yet the application developer may have the final approval and control over how the module tracing may occur. In many cases, the application developer may be able to completely disable tracing for the module, as well as to limit or expand some of the parameters that a tracer may collect.
[0128] The tracing frequency may be part of the tracer configuration. In many embodiments, tracing may consume processing and memory resources. As such, the tracing may be performed on a sampling basis or may have other architectures that limit the amount of resources consumed by tracing.
[0129] The application developer may be incented to permit tracing for the module because the module tracing data may be fed back to the module developer to help improve the module, as well as to further populate a public database for the module. At this point, the application developer may have already accessed the public database in block 610 and may wish to give back to the community by permitting the module tracing.
[0130] If the application developer identifies another function that may be implemented in a module in block 620, the process may return to block 604, otherwise the process may continue to block 622.
[0131] In block 622, the application developer may wish to add application specific tracing. If so, a tracing module may be added in block 624 and the application specific tracing may be configured in block 626.
[0132] The application developer may compile the code in block 628 and execute the code in block 630.
[0133] FIG. 7 is a flowchart illustration of an embodiment 700 showing a method for executing applications with module tracing.
[0134] Other embodiments may use different sequencing, additional or fewer steps, and different nomenclature or terminology to accomplish similar functions. In some embodiments, various operations or set of operations may be performed in parallel with other operations, either in a synchronous or asynchronous manner. The steps selected here were chosen to illustrate some principles of operations in a simplified form.
[0135] Embodiment 700 illustrates how an application may be executed with module-specific tracing. The module-specific tracing may occur only when the module executes and may not operate when other portions of the application execute.
[0136] An application may be received in block 702 and begin execution in block 704. During execution, a module may be encountered in block 706. The module may be loaded in block 708 and begin execution in block 710.
[0137] If the module includes tracing in block 712, tracing may be turned on in block 714. The tracing may be performed by a separate thread or process, or may be incorporated into a single thread with the module itself. If the tracing is not included in the module, the tracing may not be turned on.
[0138] While the module executes in block 716, the module tracer operations in block 718 may be performed. The module tracer may collect tracing data in block 720 and send the tracer data to a preprocessor in block 722. In many embodiments, the tracer data may be sent to the preprocessor on a periodic basis, such as every second, every several seconds, every minute, or some other frequency.
[0139] The module processing may continue in block 724 by looping back to block 716. When the module is complete in block 724, processing may continue to block 726. When another module is encountered in block 726, the process may loop back to block 706. When processing is complete, the application may end in block 728.
[0140] FIG. 8 is a flowchart illustration of an embodiment 800 showing a method for executing applications with both application and module tracing.
[0141] Other embodiments may use different sequencing, additional or fewer steps, and different nomenclature or terminology to accomplish similar functions. In some embodiments, various operations or set of operations may be performed in parallel with other operations, either in a synchronous or asynchronous manner. The steps selected here were chosen to illustrate some principles of operations in a simplified form.
[0142] Embodiment 800 illustrates how an application may be executed with application-specific and module-specific tracing. Application-specific tracing may occur while the application executes, and module-specific tracing may occur while various modules execute. Embodiment 800 may be compared to embodiment 700 where module-specific tracing may occur without application-specific tracing.
[0143] An application may be received in block 802 and begin execution in block 804. When the application includes tracing in block 806, application tracing may begin in block 808. The operations of the tracer may be illustrated in block 810.
[0144] The application may be executed in block 814. While the application executes in block 814, the tracer may collect application-specific tracer data in block 812.
[0145] When the application encounters a module in block 816, the module may be executed in block 818. While the module executes in block 818, the tracer may collect tracer data in block 820.
[0146] During the tracer operations of block 810, the tracer may send tracer data to a preprocessor in block 822. The tracer data may be transmitted on a periodic basis, for example.
[0147] As more code is to be executed in block 824, the process may loop back to block 814, otherwise the application may end in block 826.
[0148] FIG. 9 is a flowchart illustration of an embodiment 900 showing a method for preprocessing tracer data. Embodiment 900 may be performed to gather tracer data and dispatch the data to the appropriate databases. The data may be further processed and analyzed by an analysis engine once the data are in the databases.
[0149] Other embodiments may use different sequencing, additional or fewer steps, and different nomenclature or terminology to accomplish similar functions. In some embodiments, various operations or set of operations may be performed in parallel with other operations, either in a synchronous or asynchronous manner. The steps selected here were chosen to illustrate some principles of operations in a simplified form.
[0150] Embodiment 900 is one example of a preprocessor. In many embodiments, the preprocessor may handle large volumes of data. Consequently, the preprocessor may perform a limited amount of analysis and may operate in a lightweight fashion. The operations of embodiment 900 may be performed on each packet or message sent from a tracer.
[0151] The trace data may be received in block 902. In many cases, the trace data may come in a packet, message, or other form that may contain a group of observations, metadata, and other information gathered by a tracer.
[0152] If the trace data is application trace data in block 904, the module-specific data may be extracted in block 906, anonymized in block 908, and sent to a module preprocessor in block 910. If the trace data is module trace data in block 904, the trace data is sent to the module preprocessor.
[0153] The extraction and anonymizing of module-specific data in blocks 906 and 908 may remove data that may identify the application, data handled by the application, or other information that may relate to the application. These data may, in some cases, be considered proprietary and therefore are removed prior to being added to the module database.
[0154] The operations of a module preprocessor are illustrated in block 912. An initial analysis of the module-specific data may be performed in block 914. The new data may be aggregated into existing module data in block 916, and the module database may be updated in block 918. The data in the module database may be further processed by an analysis engine to generate data viewable by the module developer as well as a wider audience, which may include the general public.
[0155] The application-specific data may be processed an application preprocessor as illustrated in block 920. An application preprocessor may perform initial analysis on the application data in block 922, aggregate the new data into existing application data in block 924, and update the application database in block 926.
[0156] FIG. 10 is a flowchart illustration of an embodiment 1000 showing a method for analyzing tracer data. Embodiment 1000 may be performed by an analysis engine to incorporate module trace data into an analyzed module database. From the analyzed module database, the data may be presented to a user with a user interface such as the user interface of embodiment 300.
[0157] Other embodiments may use different sequencing, additional or fewer steps, and different nomenclature or terminology to accomplish similar functions. In some embodiments, various operations or set of operations may be performed in parallel with other operations, either in a synchronous or asynchronous manner. The steps selected here were chosen to illustrate some principles of operations in a simplified form.
[0158] Preprocessed trace data may be received in block 1002. The module metadata may be extracted from the data in block 1004.
[0159] If the module is not in the analyzed module database in block 1006, a process may be executed to add the module to the database beginning in block 1008.
[0160] In block 1008, an entry in the analyzed module database may be created. The source code for the module may be retrieved in block 1010 and parsed in block 1012 to locate the exported functions and other objects.
[0161] For each of the exported functions or other available objects in block 1014, the function or object may be added to the analyzed trace database in block 1016. The process may continue at block 1018.
[0162] If the module is in the database in block 1006, module level data elements may be extracted from the data in block 1018 and the analyzed module database may be updated in block 1020.
[0163] The functions or other objects in the data may be identified in block 1022. For each function in block 1024, the statistics relating to the function may be updated in block 1026 and the statistics used to update the analyzed module database in block 1028.
[0164] Any statistics for the module as a whole may be updated in block 1030 and the updates may be published in the analyzed module database in block 1032.
[0165] FIG. 11 is a flowchart illustration of an embodiment 1100 showing a method for servicing requests for data from analyzed trace data. Embodiment 1100 may be performed by a portal server in response to a request from a client device.
[0166] Other embodiments may use different sequencing, additional or fewer steps, and different nomenclature or terminology to accomplish similar functions. In some embodiments, various operations or set of operations may be performed in parallel with other operations, either in a synchronous or asynchronous manner. The steps selected here were chosen to illustrate some principles of operations in a simplified form.
[0167] A request may be received in block 1102 for summary data for a particular module. If the user is not an authenticated user in block 1104, the general data for the module may be retrieved in block 1106 and transmitted to the user in block 1108. If the user is an authenticated user in block 1104, the module developer data may be retrieved in block 1110 and transmitted in block 1108.
[0168] In the example of embodiment 1100, the notion of the data being delivered as a ‘page’ may refer to an example the delivery of the data in the form of a web page. Some embodiments may transmit the data in other manners to be rendered or presented to a user in a user interface.
[0169] The foregoing description of the subject matter has been presented for purposes of illustration and description. It is not intended to be exhaustive or to limit the subject matter to the precise form disclosed, and other modifications and variations may be possible in light of the above teachings. The embodiment was chosen and described in order to best explain the principles of the invention and its practical application to thereby enable others skilled in the art to best utilize the invention in various embodiments and various modifications as are suited to the particular use contemplated. It is intended that the appended claims be construed to include other alternative embodiments except insofar as limited by the prior art.
Claims
What is claimed is:
1. A computer system, comprising:
one or more processors;
a display device; and
one or more hardware storage devices having stored thereon computer-executable instructions that are executable by the one or more processors to cause the computer system to visualize execution of an application in a trace coverage graph, the computer-executable instructions including instructions that are executable to cause the computer system to perform at least the following:
receiving module trace data gathered during execution of an executable module that includes a plurality of executable components, wherein the module trace data includes data representing sequences of execution between individual executable components of the plurality of executable components during execution of the executable module;
based on, at least in part, receiving the module trace data, generating a trace coverage graph for display at the display device, wherein the generated trace coverage graph includes:
a plurality of different graph nodes, wherein each graph node of the plurality of different graph nodes corresponds to a different individual executable component selected from among the plurality of executable components; and
a plurality of different graph edges, wherein each graph edge of the plurality of different graph edges visually connects two graph nodes of the plurality of different graph nodes of the generated trace coverage graph representing individual executable components of the plurality of executable components that were executed in sequence during execution of the executable module, wherein the thickness of each graph edge of the plurality of different graph edges visually indicates an amount of trace data present for a sequence of execution between the plurality of different graph nodes that are connected by the graph edge, wherein thicker graph edges represent the presence of a larger amount of trace data and thinner graph edges represent the presence of a lesser amount of trace data, wherein the thicker graph edges are heavier graph edges than the thinner graph edges, and wherein dashed graph edges represent the presence of no trace data, indicating that at least one graph node of the plurality of different graph nodes corresponds to an executable component of the plurality of executable components that was not executed during execution of the executable module; and
displaying the generated trace coverage graph at the display device.
2. The computer system of claim 1, wherein each graph node of the plurality of different graph nodes is labeled with a reference to executable code represented by the graph node.
3. The computer system of claim 1, the computer-executable instructions also including instructions that are executable to cause the computer system to receive a user input selecting a graph node and to display additional underlying data about the selected graph node.
4. The computer system of claim 1, wherein the generated trace coverage graph is displayed as part of a module-specific user interface for the executable module.
5. The computer system of claim 4, wherein the module-specific user interface includes one or more module metrics, including one or more of:
a reliability metric that reflects robustness or fragility of the executable module;
a popularity metric that reflects usage of the executable module by a community; or
a trending metric indicating if the executable module is increasing or decreasing in popularity.
6. The computer system of claim 4, wherein the module-specific user interface indicates a quantity of the module trace data.
7. The computer system of claim 4, wherein the module-specific user interface reflects observations for individual functions within the executable module.
8. The computer system of claim 7, wherein the observations for the individual functions within the executable module include one or more of an error rate, processor consumption, or memory consumption for an individual function within the executable module.
9. The computer system of claim 4, wherein the module-specific user interface graphs usage trends of the executable module over time.
10. The computer system of claim 4, wherein the module-specific user interface includes a module topology graph that visually illustrates links between the executable module and one or more other modules that are called by the executable module.
11. A method, implemented at a computer system that includes one or me processors, for visualizing execution of an application in a trace coverage graph, the method comprising:
analyzing module trace data gathered during execution of an executable module that includes a plurality of executable components, wherein the module trace data includes data representing sequences of execution between individual executable components of the plurality of executable components during execution of the executable module;
based on, at least in part, analyzing the module trace data, generating a trace coverage graph for display at a display device, wherein the generated trace coverage graph includes:
a plurality of different graph nodes, wherein each graph node of the plurality of different graph nodes corresponds to a different individual executable component selected from among the plurality of executable components; and
a plurality of different graph edges, wherein each graph edge of the plurality of different graph edges visually connects two graph nodes of the plurality of different graph nodes of the generated trace coverage graph representing individual executable components of the plurality of executable components that were executed in sequence during execution of the executable module, wherein the thickness of each graph edge of the plurality of different graph edges visually indicates an amount of trace data present for a sequence of execution between the plurality of different graph nodes that are connected by the graph edge, wherein thicker graph edges represent the presence of a larger amount of trace data and thinner graph edges represent the presence of a lesser amount of trace data, wherein the thicker graph edges are heavier graph edges than the thinner graph edges, and wherein dashed graph edges represent the presence of no trace data, indicating that at least one graph node of the plurality of different graph nodes corresponds to an executable component of the plurality of executable components that was not executed during execution of the executable module; and
displaying the generated trace coverage graph at the display device.
12. The method of claim 11, wherein each graph node of the plurality of different graph nodes is labeled with a reference to executable code represented by the graph node.
13. The method of claim 11, further comprising receiving a user input selecting a graph node and displaying additional underlying data about the selected graph node.
14. The method of claim 11, wherein the generated trace coverage graph is displayed as part of a module-specific user interface for the executable module.
15. The method of claim 14, wherein the module-specific user interface includes one or more module metrics, including one or more of:
a reliability metric that reflects robustness or fragility of the executable module;
a popularity metric that reflects usage of the executable module by a community; or
a trending metric indicating if the executable module is increasing or decreasing in popularity.
16. The method of claim 14, wherein the module-specific user interface indicates a quantity of the module trace data.
17. The method of claim 14, wherein the module-specific user interface reflects observations for individual functions within the executable module.
18. The method of claim 17, wherein the observations for the individual functions within the executable module include one or more of an error rate, processor consumption, or memory consumption for an individual function within the executable module.
19. The method of claim 14, wherein the module-specific user interface graphs usage trends of the executable module over time.
20. The method of claim 14, wherein the module-specific user interface includes a module topology graph that visually illustrates links between the executable module and one or more other modules that are called by the executable module.
21. A computer program product comprising one or more hardware storage devices having stored thereon computer-executable instructions that are executable by one or more processors of a computer system to cause the computer system to visualize execution of an application in a trace coverage graph, the computer-executable instructions including instructions that are executable to cause the computer system to perform at least the following:
obtaining module trace data gathered during execution of an executable module that includes a plurality of executable components, wherein the module trace data includes data representing sequences of execution between individual executable components of the plurality of executable components during execution of the executable module;
based on, at least in part, obtaining the module trace data, rendering a trace coverage graph for display at a display device, wherein the rendered trace coverage graph includes:
a plurality of different graph nodes, wherein each graph node of the plurality of different graph nodes corresponds to a different individual executable component selected from among the plurality of executable components; and
a plurality of different graph edges, wherein each graph edge of the plurality of different graph edges visually connects two graph nodes of the plurality of different graph nodes of the generated trace coverage graph representing individual executable components of the plurality of executable components that were executed in sequence during execution of the executable module, wherein the thickness of each graph edge of the plurality of different graph edges visually indicates an amount of trace data present for a sequence of execution between the plurality of different graph nodes that are connected by the graph edge, wherein thicker graph edges represent the presence of a larger amount of trace data and thinner graph edges represent the presence of a lesser amount of trace data, wherein the thicker graph edges are heavier graph edges than the thinner graph edges, and wherein dashed graph edges represent the presence of no trace data, indicating that at least one graph node of the plurality of different graph nodes corresponds to an executable component of the plurality of executable components that was not executed during execution of the executable module; and
displaying the generated trace coverage graph at the display device.
22. A computer system, comprising:
one or more processors;
a display device; and
one or more hardware storage devices having stored thereon computer-executable instructions that are executable by the one or more processors to cause the computer system to visualize execution of an application in a trace coverage graph, the computer-executable instructions including instructions that are executable to cause the computer system to perform at least the following:
executing an executable module at the one or more processors, including executing a plurality of executable components of the executable module at the one or more processors;
while executing the executable module, gathering module trace data, including gathering data representing sequences of execution between individual executable components of the plurality of executable components; and
based on, at least in part, gathering the module trace data, generating a trace coverage graph for display at the display device, wherein the generated trace coverage graph includes:
a plurality of different graph nodes, wherein each graph node of the plurality of different graph nodes corresponds to a different individual executable component selected from among the plurality of executable components; and
a plurality of different graph edges, wherein each graph edge of the plurality of different graph edges visually connects two graph nodes of the plurality of different graph nodes of the generated trace coverage graph representing individual executable components of the plurality of executable components that were executed in sequence during execution of the executable module, wherein the thickness of each graph edge of the plurality of different graph edges visually indicates an amount of trace data present for a sequence of execution between the plurality of different graph nodes that are connected by the graph edge, wherein thicker graph edges represent the presence of a larger amount of trace data and thinner graph edges represent the presence of a lesser amount of trace data, wherein the thicker graph edges are heavier graph edges than the thinner graph edges, and wherein dashed graph edges represent the presence of no trace data, indicating that at least one graph node of the plurality of different graph nodes corresponds to an executable component of the plurality of executable components that was not executed during execution of the executable module; and
displaying the generated trace coverage graph at the display device.
23. The computer system of claim 22, wherein each graph node of the plurality of different graph nodes is labeled with a reference to executable code represented by the graph node.
24. The computer system of claim 22, the computer-executable instructions also including instructions that are executable to cause the computer system to receive a user input selecting a graph node and to display additional underlying data about the selected graph node.
25. The computer system of claim 22, wherein the generated trace coverage graph is displayed as part of a module-specific user interface for the executable module.
26. The computer system of claim 25, wherein the module-specific user interface includes one or more module metrics, including one or more of:
a reliability metric that reflects robustness or fragility of the executable module;
a popularity metric that reflects usage of the executable module by a community; or
a trending metric indicating if the executable module is increasing or decreasing in popularity.
27. The computer system of claim 25, wherein the module-specific user interface indicates a quantity of the module trace data.
28. The computer system of claim 25, wherein the module-specific user interface reflects observations for individual functions within the executable module.
29. The computer system of claim 25, wherein the module-specific user interface graphs usage trends of the executable module over time.
30. The computer system of claim 25, wherein the module-specific user interface includes a module topology graph that visually illustrates links between the executable module and one or more other modules that are called by the executable module.
Patent Citations (679)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US4907151(A) | 1990-03-01 | Bartlett | Applicant |
| US5293620(A) | 1994-03-01 | Barabash et al. | Applicant |
| US5327568(A) | 1994-07-01 | Maejima et al. | Applicant |
| US5369570(A) | 1994-11-01 | Parad | Applicant |
| US5535393(A) | 1996-07-01 | Reeve et al. | Applicant |
| US5606688(A) | 1997-02-01 | McNutt et al. | Applicant |
| US5642511(A) | 1997-06-01 | Chow et al. | Applicant |
| US5689363(A) | 1997-11-01 | Kleber et al. | Applicant |
| US5732277(A) | 1998-03-01 | Kodosky et al. | Applicant |
| US5740440(A) | 1998-04-01 | West | Applicant |
| US5758183(A) | 1998-05-01 | Scales | Applicant |
| US5778004(A) | 1998-07-01 | Jennion et al. | Applicant |
| US5835085(A) | 1998-11-01 | Eick et al. | Applicant |
| US5852449(A) | 1998-12-01 | Esslinger et al. | Applicant |
| US5870606(A) | 1999-02-01 | Lindsey | Applicant |
| US5937194(A) | 1999-08-01 | Sundaresan | Applicant |
| US5946488(A) | 1999-08-01 | Tanguay et al. | Applicant |
| US5953736(A) | 1999-09-01 | O'Connor et al. | Applicant |
| US5978830(A) | 1999-11-01 | Nakaya et al. | Applicant |
| US5999192(A) | 1999-12-01 | Selfridge et al. | Applicant |
| US6003143(A) | 1999-12-01 | Kim et al. | Applicant |
| US6026362(A) | 2000-02-01 | Kim et al. | Applicant |
| US6032201(A) | 2000-02-01 | Tillery et al. | Applicant |
| US6038395(A) | 2000-03-01 | Chow et al. | Applicant |
| US6059842(A) | 2000-05-01 | Dumarot et al. | Applicant |
| US6083281(A) | 2000-07-01 | Diec | Applicant |
| US6108340(A) | 2000-08-01 | Rolfe | Applicant |
| US6158049(A) | 2000-12-01 | Goodwin | Applicant |
| US6195676(B1) | 2001-02-01 | Spix et al. | Applicant |
| US6202199(B1) | 2001-03-01 | Wygodny et al. | Applicant |
| US6219826(B1) | 2001-04-01 | De Pauw et al. | Applicant |
| US6226787(B1) | 2001-05-01 | Serra et al. | Applicant |
| US6230313(B1) | 2001-05-01 | Callahan | Applicant |
| US6243857(B1) | 2001-06-01 | Logan et al. | Applicant |
| US6266804(B1) | 2001-07-01 | Isman | Applicant |
| US6282701(B1) | 2001-08-01 | Wygodny et al. | Applicant |
| US6286130(B1) | 2001-09-01 | Poulsen | Applicant |
| US6321204(B1) | 2001-11-01 | Kazami et al. | Applicant |
| US6321240(B1) | 2001-11-01 | Chilimbi et al. | Applicant |
| US6374271(B1) | 2002-04-01 | Shimizu | Applicant |
| US6381735(B1) | 2002-04-01 | Hunt | Applicant |
| US6584487(B1) | 2003-06-01 | Saboff | Applicant |
| US6598141(B1) | 2003-07-01 | Dussud et al. | Applicant |
| US6629128(B1) | 2003-09-01 | Glass | Applicant |
| US6661431(B1) | 2003-12-01 | Stuart | Applicant |
| US6662358(B1) | 2003-12-01 | Berry et al. | Applicant |
| US6681384(B1) | 2004-01-01 | Bates et al. | Applicant |
| US6735687(B1) | 2004-05-01 | Kok | Applicant |
| US6742003(B2) | 2004-05-01 | Heckerman et al. | Applicant |
| US6748420(B1) | 2004-06-01 | Quatrano et al. | Applicant |
| US6748585(B2) | 2004-06-01 | Proebsting | Applicant |
| US6754890(B1) | 2004-06-01 | Berry et al. | Applicant |
| US6775423(B2) | 2004-08-01 | Kulkarni | Applicant |
| US6792460(B2) | 2004-09-01 | Oulu | Applicant |
| US6792595(B1) | 2004-09-01 | Storistenau et al. | Applicant |
| US6826752(B1) | 2004-11-01 | Thornley et al. | Applicant |
| US6856950(B1) | 2005-02-01 | Abts et al. | Applicant |
| US6862727(B2) | 2005-03-01 | Stevens | Applicant |
| US6892226(B1) | 2005-05-01 | Tso et al. | Applicant |
| US6928488(B1) | 2005-08-01 | De Jong et al. | Applicant |
| US6938186(B2) | 2005-08-01 | Das et al. | Applicant |
| US6970805(B1) | 2005-11-01 | Bierma et al. | Applicant |
| US6981265(B1) | 2005-12-01 | Rees et al. | Applicant |
| US7058928(B2) | 2006-06-01 | Wygodny et al. | Applicant |
| US7065763(B1) | 2006-06-01 | Martin et al. | Applicant |
| US7093234(B2) | 2006-08-01 | Hibbeler et al. | Applicant |
| US7117504(B2) | 2006-10-01 | Smith et al. | Applicant |
| US7120901(B2) | 2006-10-01 | Ferri et al. | Applicant |
| US7143412(B2) | 2006-11-01 | Koenen | Applicant |
| US7168068(B2) | 2007-01-01 | Dawson | Applicant |
| US7174536(B1) | 2007-02-01 | Kothari et al. | Applicant |
| US7185367(B2) | 2007-02-01 | Munson | Applicant |
| US7194664(B1) | 2007-03-01 | Fung et al. | Applicant |
| US7203925(B1) | 2007-04-01 | Michael et al. | Applicant |
| US7219300(B2) | 2007-05-01 | Arquie | Applicant |
| US7386839(B1) | 2008-06-01 | Golender et al. | Applicant |
| US7389494(B1) | 2008-06-01 | Cantrill | Applicant |
| US7430733(B1) | 2008-09-01 | Yaari | Applicant |
| US7468727(B2) | 2008-12-01 | Wong | Applicant |
| US7472378(B2) | 2008-12-01 | Bennett | Applicant |
| US7478371(B1) | 2009-01-01 | Gove | Applicant |
| US7493400(B2) | 2009-02-01 | Loaiza | Applicant |
| US7500216(B1) | 2009-03-01 | Blunno et al. | Applicant |
| US7509343(B1) | 2009-03-01 | Washburn | Applicant |
| US7543281(B2) | 2009-06-01 | King et al. | Applicant |
| US7574675(B1) | 2009-08-01 | Linker | Applicant |
| US7580905(B2) | 2009-08-01 | Lopez-Estrada | Applicant |
| US7607169(B1) | 2009-10-01 | Njemanze et al. | Applicant |
| US7620947(B2) | 2009-11-01 | Krishnaswamy | Applicant |
| US7624380(B2) | 2009-11-01 | Okada | Applicant |
| US7639256(B1) | 2009-12-01 | Yablonski | Applicant |
| US7650574(B2) | 2010-01-01 | Nattinger | Applicant |
| US7657873(B2) | 2010-02-01 | Horton et al. | Applicant |
| US7681182(B1) | 2010-03-01 | Mistry et al. | Applicant |
| US7681188(B1) | 2010-03-01 | Tirumalai et al. | Applicant |
| US7685561(B2) | 2010-03-01 | Deem et al. | Applicant |
| US7739667(B2) | 2010-06-01 | Callahan et al. | Applicant |
| US7743380(B2) | 2010-06-01 | Seidman et al. | Applicant |
| US7788640(B2) | 2010-08-01 | Grimaldi | Applicant |
| US7797585(B1) | 2010-09-01 | Sahin et al. | Applicant |
| US7814453(B2) | 2010-10-01 | Stevens et al. | Applicant |
| US7827539(B1) | 2010-11-01 | Wygodny et al. | Applicant |
| US7853930(B2) | 2010-12-01 | Mitchell et al. | Applicant |
| US7865872(B2) | 2011-01-01 | Chamieh et al. | Applicant |
| US7870244(B2) | 2011-01-01 | Chong et al. | Applicant |
| US7890771(B2) | 2011-02-01 | England et al. | Applicant |
| US7954094(B2) | 2011-05-01 | Cascaval et al. | Applicant |
| US7954095(B2) | 2011-05-01 | Archer et al. | Applicant |
| US7971010(B2) | 2011-06-01 | Schmelter et al. | Applicant |
| US8024708(B2) | 2011-09-01 | Demetriou | Applicant |
| US8032866(B1) | 2011-10-01 | Golender et al. | Applicant |
| US8037465(B2) | 2011-10-01 | Tian | Applicant |
| US8056059(B2) | 2011-11-01 | Chockler | Applicant |
| US8069145(B2) | 2011-11-01 | Surtani | Applicant |
| US8108689(B2) | 2012-01-01 | Nicolson et al. | Applicant |
| US8132162(B2) | 2012-03-01 | Peterson | Applicant |
| US8214806(B2) | 2012-07-01 | Cong et al. | Applicant |
| US8234105(B1) | 2012-07-01 | Aldrich et al. | Applicant |
| US8286142(B2) | 2012-10-01 | Fjeldstad et al. | Applicant |
| US8312056(B1) | 2012-11-01 | Peng et al. | Applicant |
| US8312435(B2) | 2012-11-01 | Wygodny et al. | Applicant |
| US8316354(B2) | 2012-11-01 | Vanrenen | Applicant |
| US8336056(B1) | 2012-12-01 | Gadir | Applicant |
| US8359584(B2) | 2013-01-01 | Rao et al. | Applicant |
| US8381178(B2) | 2013-02-01 | Martino et al. | Applicant |
| US8406565(B1) | 2013-03-01 | Schildan | Applicant |
| US8473925(B2) | 2013-06-01 | Gagliardi et al. | Applicant |
| US8490055(B2) | 2013-07-01 | Basak | Applicant |
| US8490087(B2) | 2013-07-01 | Beaty et al. | Applicant |
| US8495598(B2) | 2013-07-01 | Gounares et al. | Applicant |
| US8516443(B2) | 2013-08-01 | Li | Applicant |
| US8543907(B1) | 2013-09-01 | Roskind | Applicant |
| US8543983(B2) | 2013-09-01 | Murthy | Applicant |
| US8566800(B2) | 2013-10-01 | Gagliardi | Applicant |
| US8566804(B1) | 2013-10-01 | Carrick et al. | Applicant |
| US8572575(B2) | 2013-10-01 | Berlyant et al. | Applicant |
| US8595327(B2) | 2013-11-01 | Lee et al. | Applicant |
| US8595743(B2) | 2013-11-01 | Gounares et al. | Applicant |
| US8607018(B2) | 2013-12-01 | Gounares et al. | Applicant |
| US8615766(B2) | 2013-12-01 | Gounares et al. | Applicant |
| US8640100(B2) | 2014-01-01 | Neumann et al. | Applicant |
| US8640104(B2) | 2014-01-01 | McEntee | Applicant |
| US8645930(B2) | 2014-02-01 | Lattner et al. | Applicant |
| US8650538(B2) | 2014-02-01 | Gounares et al. | Applicant |
| US8656134(B2) | 2014-02-01 | Gounares et al. | Applicant |
| US8656135(B2) | 2014-02-01 | Gounares et al. | Applicant |
| US8656359(B2) | 2014-02-01 | Savov | Applicant |
| US8656378(B2) | 2014-02-01 | Gounares et al. | Applicant |
| US8681155(B2) | 2014-03-01 | Basak | Applicant |
| US8694574(B2) | 2014-04-01 | Gounares et al. | Applicant |
| US8700838(B2) | 2014-04-01 | Gounares et al. | Applicant |
| US8707326(B2) | 2014-04-01 | Garrett | Applicant |
| US8713064(B1) | 2014-04-01 | Khafizov | Applicant |
| US8726255(B2) | 2014-05-01 | Gounares et al. | Applicant |
| US8745591(B2) | 2014-06-01 | De Smet et al. | Applicant |
| US8745594(B1) | 2014-06-01 | Iossiphidis | Applicant |
| US8752021(B2) | 2014-06-01 | Li et al. | Applicant |
| US8752034(B2) | 2014-06-01 | Gounares et al. | Applicant |
| US8756581(B2) | 2014-06-01 | Castanos et al. | Applicant |
| US8789030(B2) | 2014-07-01 | Gounares et al. | Applicant |
| US8789032(B1) | 2014-07-01 | Li et al. | Applicant |
| US8793656(B2) | 2014-07-01 | Huang | Applicant |
| US8793669(B2) | 2014-07-01 | Garrett | Applicant |
| US8924941(B2) | 2014-12-01 | Krajec et al. | Applicant |
| US8943441(B1) | 2015-01-01 | Patrick | Applicant |
| US8997056(B2) | 2015-03-01 | Li et al. | Applicant |
| US9015668(B1) | 2015-04-01 | Michelsen | Applicant |
| US9203894(B1) | 2015-12-01 | Ginzburg | Applicant |
| US9497136(B1) | 2016-11-01 | Ramarao | Applicant |
| US2001/0003822(A1) | 2001-06-01 | Hibi et al. | Applicant |
| US2001/0034859(A1) | 2001-10-01 | Swoboda | Applicant |
| US2001/0056456(A1) | 2001-12-01 | Cota-Robles | Applicant |
| US2002/0007297(A1) | 2002-01-01 | Clarke | Applicant |
| US2002/0019887(A1) | 2002-02-01 | Moore | Applicant |
| US2002/0072830(A1) | 2002-06-01 | Hunt | Applicant |
| US2002/0073063(A1) | 2002-06-01 | Faraj | Applicant |
| US2002/0085041(A1) | 2002-07-01 | Ishikawa | Applicant |
| US2002/0087949(A1) | 2002-07-01 | Golender et al. | Applicant |
| US2002/0112033(A1) | 2002-08-01 | Doemling et al. | Applicant |
| US2002/0120815(A1) | 2002-08-01 | Zahavi | Applicant |
| US2002/0138788(A1) | 2002-09-01 | Yenne et al. | Applicant |
| US2002/0156724(A1) | 2002-10-01 | Levchin | Examiner |
| US2002/0157086(A1) | 2002-10-01 | Lewis et al. | Applicant |
| US2002/0163498(A1) | 2002-11-01 | Chang et al. | Applicant |
| US2002/0165901(A1) | 2002-11-01 | Rajan | Applicant |
| US2002/0178185(A1) | 2002-11-01 | Kuchinsky et al. | Applicant |
| US2002/0184615(A1) | 2002-12-01 | Sumner | Applicant |
| US2002/0196184(A1) | 2002-12-01 | Johnson et al. | Applicant |
| US2002/0196229(A1) | 2002-12-01 | Chen et al. | Applicant |
| US2002/0199172(A1) | 2002-12-01 | Bunnell | Applicant |
| US2002/0199179(A1) | 2002-12-01 | Lavery et al. | Applicant |
| US2003/0023576(A1) | 2003-01-01 | Gilson | Applicant |
| US2003/0037248(A1) | 2003-02-01 | Launchbury et al. | Applicant |
| US2003/0041069(A1) | 2003-02-01 | Yorke | Applicant |
| US2003/0056201(A1) | 2003-03-01 | Degenaro et al. | Applicant |
| US2003/0058277(A1) | 2003-03-01 | Bowman-Amuah | Applicant |
| US2003/0061574(A1) | 2003-03-01 | Saluja et al. | Applicant |
| US2003/0067481(A1) | 2003-04-01 | Chedgey et al. | Applicant |
| US2003/0070161(A1) | 2003-04-01 | Wong et al. | Applicant |
| US2003/0088606(A1) | 2003-05-01 | Miller et al. | Applicant |
| US2003/0088854(A1) | 2003-05-01 | Wygodny et al. | Applicant |
| US2003/0093408(A1) | 2003-05-01 | Brown et al. | Applicant |
| US2003/0106046(A1) | 2003-06-01 | Arnold | Applicant |
| US2003/0140280(A1) | 2003-07-01 | Kaler et al. | Applicant |
| US2003/0145314(A1) | 2003-07-01 | Nguyen et al. | Applicant |
| US2003/0149765(A1) | 2003-08-01 | Hubbard | Applicant |
| US2003/0217155(A1) | 2003-11-01 | Greck et al. | Applicant |
| US2003/0231207(A1) | 2003-12-01 | Huang | Applicant |
| US2004/0012638(A1) | 2004-01-01 | Donnelli et al. | Applicant |
| US2004/0015600(A1) | 2004-01-01 | Tiwary et al. | Applicant |
| US2004/0015929(A1) | 2004-01-01 | Lewis et al. | Applicant |
| US2004/0034853(A1) | 2004-02-01 | Gibbons et al. | Applicant |
| US2004/0054992(A1) | 2004-03-01 | Nair et al. | Applicant |
| US2004/0073529(A1) | 2004-04-01 | Stanfill | Applicant |
| US2004/0075690(A1) | 2004-04-01 | Cirne | Applicant |
| US2004/0083425(A1) | 2004-04-01 | Dorwart | Applicant |
| US2004/0088699(A1) | 2004-05-01 | Suresh | Applicant |
| US2004/0103400(A1) | 2004-05-01 | Johnsen | Applicant |
| US2004/0103410(A1) | 2004-05-01 | Sakai | Applicant |
| US2004/0117172(A1) | 2004-06-01 | Shibata | Applicant |
| US2004/0117768(A1) | 2004-06-01 | Chang et al. | Applicant |
| US2004/0123274(A1) | 2004-06-01 | Inagaki et al. | Applicant |
| US2004/0128093(A1) | 2004-07-01 | Cragun et al. | Applicant |
| US2004/0139480(A1) | 2004-07-01 | Delpuch et al. | Applicant |
| US2004/0154016(A1) | 2004-08-01 | Randall | Applicant |
| US2004/0154019(A1) | 2004-08-01 | Aamodt et al. | Applicant |
| US2004/0181554(A1) | 2004-09-01 | Heckerman et al. | Applicant |
| US2004/0194098(A1) | 2004-09-01 | Chung et al. | Applicant |
| US2004/0205302(A1) | 2004-10-01 | Cantrill | Applicant |
| US2004/0205718(A1) | 2004-10-01 | Reynders | Applicant |
| US2004/0225443(A1) | 2004-11-01 | Kamps | Applicant |
| US2004/0239681(A1) | 2004-12-01 | Robotham et al. | Applicant |
| US2005/0015368(A1) | 2005-01-01 | Payton et al. | Applicant |
| US2005/0021318(A1) | 2005-01-01 | Inoue et al. | Applicant |
| US2005/0041692(A1) | 2005-02-01 | Kallstenius | Applicant |
| US2005/0066149(A1) | 2005-03-01 | Kanade | Applicant |
| US2005/0091645(A1) | 2005-04-01 | Chilimbi et al. | Applicant |
| US2005/0091646(A1) | 2005-04-01 | Chilimbi et al. | Applicant |
| US2005/0102636(A1) | 2005-05-01 | McKeon | Applicant |
| US2005/0108259(A1) | 2005-05-01 | Watanabe et al. | Applicant |
| US2005/0108517(A1) | 2005-05-01 | Dillon et al. | Applicant |
| US2005/0120333(A1) | 2005-06-01 | Inoue et al. | Applicant |
| US2005/0131995(A1) | 2005-06-01 | Chase et al. | Applicant |
| US2005/0138111(A1) | 2005-06-01 | Aton et al. | Applicant |
| US2005/0149697(A1) | 2005-07-01 | Enright et al. | Applicant |
| US2005/0149912(A1) | 2005-07-01 | Farcy et al. | Applicant |
| US2005/0155019(A1) | 2005-07-01 | Levine et al. | Applicant |
| US2005/0177820(A1) | 2005-08-01 | Mei et al. | Applicant |
| US2005/0177836(A1) | 2005-08-01 | Lari et al. | Applicant |
| US2005/0180330(A1) | 2005-08-01 | Shapiro | Applicant |
| US2005/0188272(A1) | 2005-08-01 | Bodorin et al. | Applicant |
| US2005/0198332(A1) | 2005-09-01 | Laertz et al. | Applicant |
| US2005/0204344(A1) | 2005-09-01 | Shinomi | Applicant |
| US2005/0234974(A1) | 2005-10-01 | Bailey et al. | Applicant |
| US2005/0240567(A1) | 2005-10-01 | Klosterhalfen | Applicant |
| US2005/0262181(A1) | 2005-11-01 | Schmidt et al. | Applicant |
| US2005/0262470(A1) | 2005-11-01 | Gavrilov | Applicant |
| US2005/0262493(A1) | 2005-11-01 | Schmidt et al. | Applicant |
| US2005/0262512(A1) | 2005-11-01 | Schmidt et al. | Applicant |
| US2005/0278208(A1) | 2005-12-01 | Schultz | Applicant |
| US2006/0005179(A1) | 2006-01-01 | Kawahara | Applicant |
| US2006/0005194(A1) | 2006-01-01 | Kawahara | Applicant |
| US2006/0013134(A1) | 2006-01-01 | Neuse | Applicant |
| US2006/0015612(A1) | 2006-01-01 | Shimazaki et al. | Applicant |
| US2006/0015850(A1) | 2006-01-01 | Poole | Applicant |
| US2006/0037022(A1) | 2006-02-01 | Byrd et al. | Applicant |
| US2006/0047752(A1) | 2006-03-01 | Hornby | Applicant |
| US2006/0074970(A1) | 2006-04-01 | Narayanan | Applicant |
| US2006/0075390(A1) | 2006-04-01 | McAllister | Applicant |
| US2006/0101033(A1) | 2006-05-01 | Hu et al. | Applicant |
| US2006/0101416(A1) | 2006-05-01 | Callahan et al. | Applicant |
| US2006/0101467(A1) | 2006-05-01 | Buco et al. | Applicant |
| US2006/0106843(A1) | 2006-05-01 | Middelfart et al. | Applicant |
| US2006/0106926(A1) | 2006-05-01 | Kato et al. | Applicant |
| US2006/0130016(A1) | 2006-06-01 | Wagner | Applicant |
| US2006/0156017(A1) | 2006-07-01 | McIsaac et al. | Applicant |
| US2006/0167939(A1) | 2006-07-01 | Seidman et al. | Applicant |
| US2006/0168583(A1) | 2006-07-01 | Basso et al. | Applicant |
| US2006/0174165(A1) | 2006-08-01 | Shaffer et al. | Applicant |
| US2006/0179429(A1) | 2006-08-01 | Eggers et al. | Applicant |
| US2006/0182133(A1) | 2006-08-01 | Choumaru | Applicant |
| US2006/0190596(A1) | 2006-08-01 | Horikawa | Applicant |
| US2006/0195747(A1) | 2006-08-01 | Pramanick et al. | Applicant |
| US2006/0200738(A1) | 2006-09-01 | Tarle et al. | Applicant |
| US2006/0212852(A1) | 2006-09-01 | Hwang | Applicant |
| US2006/0224375(A1) | 2006-10-01 | Barnett et al. | Applicant |
| US2006/0230319(A1) | 2006-10-01 | Ryali et al. | Applicant |
| US2006/0242627(A1) | 2006-10-01 | Wygodny et al. | Applicant |
| US2006/0248177(A1) | 2006-11-01 | Dostert et al. | Applicant |
| US2006/0256805(A1) | 2006-11-01 | Cho et al. | Applicant |
| US2006/0265397(A1) | 2006-11-01 | Bryan et al. | Applicant |
| US2006/0277477(A1) | 2006-12-01 | Christenson | Applicant |
| US2007/0006159(A1) | 2007-01-01 | Hecht et al. | Applicant |
| US2007/0016949(A1) | 2007-01-01 | Dunagan et al. | Applicant |
| US2007/0022000(A1) | 2007-01-01 | Bodart et al. | Applicant |
| US2007/0028189(A1) | 2007-02-01 | Robbins | Applicant |
| US2007/0050174(A1) | 2007-03-01 | Dewitt et al. | Applicant |
| US2007/0060205(A1) | 2007-03-01 | Kim | Applicant |
| US2007/0061241(A1) | 2007-03-01 | Jovanovic et al. | Applicant |
| US2007/0079298(A1) | 2007-04-01 | Tian et al. | Applicant |
| US2007/0089094(A1) | 2007-04-01 | Levine et al. | Applicant |
| US2007/0100967(A1) | 2007-05-01 | Smith et al. | Applicant |
| US2007/0118538(A1) | 2007-05-01 | Ahem et al. | Applicant |
| US2007/0118909(A1) | 2007-05-01 | Hertzog | Applicant |
| US2007/0136201(A1) | 2007-06-01 | Sah et al. | Applicant |
| US2007/0136320(A1) | 2007-06-01 | Sah et al. | Applicant |
| US2007/0136337(A1) | 2007-06-01 | Sah et al. | Applicant |
| US2007/0136443(A1) | 2007-06-01 | Sah et al. | Applicant |
| US2007/0140131(A1) | 2007-06-01 | Malloy et al. | Applicant |
| US2007/0143795(A1) | 2007-06-01 | Tran | Applicant |
| US2007/0150895(A1) | 2007-06-01 | Kurland | Applicant |
| US2007/0157177(A1) | 2007-07-01 | Bouguet et al. | Applicant |
| US2007/0168992(A1) | 2007-07-01 | Cary | Applicant |
| US2007/0169002(A1) | 2007-07-01 | Kronlund et al. | Applicant |
| US2007/0169042(A1) | 2007-07-01 | Janczewski | Applicant |
| US2007/0180147(A1) | 2007-08-01 | Leigh | Applicant |
| US2007/0192468(A1) | 2007-08-01 | Keeler | Applicant |
| US2007/0198524(A1) | 2007-08-01 | Branda et al. | Applicant |
| US2007/0198952(A1) | 2007-08-01 | Pittenger | Applicant |
| US2007/0204010(A1) | 2007-08-01 | Sah et al. | Applicant |
| US2007/0204223(A1) | 2007-08-01 | Bartels et al. | Applicant |
| US2007/0214333(A1) | 2007-09-01 | Nijhawan et al. | Applicant |
| US2007/0220513(A1) | 2007-09-01 | Hwang | Applicant |
| US2007/0226696(A1) | 2007-09-01 | Radhakrishnan et al. | Applicant |
| US2007/0226700(A1) | 2007-09-01 | Gal | Applicant |
| US2007/0226758(A1) | 2007-09-01 | Waldo et al. | Applicant |
| US2007/0234002(A1) | 2007-10-01 | Litke | Applicant |
| US2007/0239528(A1) | 2007-10-01 | Xie et al. | Applicant |
| US2007/0245310(A1) | 2007-10-01 | Rosenstein et al. | Applicant |
| US2007/0260849(A1) | 2007-11-01 | Chen et al. | Applicant |
| US2007/0271283(A1) | 2007-11-01 | Maryka et al. | Applicant |
| US2007/0277056(A1) | 2007-11-01 | Varadarajan et al. | Applicant |
| US2007/0294581(A1) | 2007-12-01 | Dean et al. | Applicant |
| US2008/0005281(A1) | 2008-01-01 | Hsueh et al. | Applicant |
| US2008/0022285(A1) | 2008-01-01 | Cherkasova et al. | Applicant |
| US2008/0022286(A1) | 2008-01-01 | Chung et al. | Applicant |
| US2008/0049022(A1) | 2008-02-01 | Sherb et al. | Applicant |
| US2008/0065668(A1) | 2008-03-01 | Spence et al. | Applicant |
| US2008/0092121(A1) | 2008-04-01 | DeRose et al. | Applicant |
| US2008/0092128(A1) | 2008-04-01 | Corry et al. | Applicant |
| US2008/0098180(A1) | 2008-04-01 | Larson et al. | Applicant |
| US2008/0104225(A1) | 2008-05-01 | Zhang | Applicant |
| US2008/0104362(A1) | 2008-05-01 | Buros et al. | Applicant |
| US2008/0104451(A1) | 2008-05-01 | Blanchard et al. | Applicant |
| US2008/0104570(A1) | 2008-05-01 | Chedgey et al. | Applicant |
| US2008/0109792(A1) | 2008-05-01 | O'Dowd | Applicant |
| US2008/0117216(A1) | 2008-05-01 | Dorie | Applicant |
| US2008/0120400(A1) | 2008-05-01 | Keller et al. | Applicant |
| US2008/0126003(A1) | 2008-05-01 | Goldstein et al. | Applicant |
| US2008/0126828(A1) | 2008-05-01 | Girouard et al. | Applicant |
| US2008/0127108(A1) | 2008-05-01 | Ivanov et al. | Applicant |
| US2008/0127109(A1) | 2008-05-01 | Simeon | Applicant |
| US2008/0127112(A1) | 2008-05-01 | Kettley et al. | Applicant |
| US2008/0127116(A1) | 2008-05-01 | Kosche et al. | Applicant |
| US2008/0127149(A1) | 2008-05-01 | Kosche et al. | Applicant |
| US2008/0140985(A1) | 2008-06-01 | Kitamorn et al. | Applicant |
| US2008/0155348(A1) | 2008-06-01 | Ivanov et al. | Applicant |
| US2008/0155349(A1) | 2008-06-01 | Ivanov et al. | Applicant |
| US2008/0163124(A1) | 2008-07-01 | Bonev et al. | Applicant |
| US2008/0163183(A1) | 2008-07-01 | Li et al. | Applicant |
| US2008/0168472(A1) | 2008-07-01 | Wilson | Applicant |
| US2008/0243970(A1) | 2008-10-01 | Schmelter et al. | Applicant |
| US2008/0256233(A1) | 2008-10-01 | Hall | Applicant |
| US2008/0256466(A1) | 2008-10-01 | Salvador et al. | Applicant |
| US2008/0256518(A1) | 2008-10-01 | Aoshima et al. | Applicant |
| US2008/0271038(A1) | 2008-10-01 | Rolia et al. | Applicant |
| US2008/0276129(A1) | 2008-11-01 | Cocker et al. | Applicant |
| US2008/0282232(A1) | 2008-11-01 | Cong et al. | Applicant |
| US2008/0288212(A1) | 2008-11-01 | Greifeneder | Applicant |
| US2008/0288741(A1) | 2008-11-01 | Lee et al. | Applicant |
| US2008/0312980(A1) | 2008-12-01 | Boulineau et al. | Applicant |
| US2008/0313502(A1) | 2008-12-01 | Mcfadden et al. | Applicant |
| US2009/0019449(A1) | 2009-01-01 | Choi et al. | Applicant |
| US2009/0037407(A1) | 2009-02-01 | Yang et al. | Applicant |
| US2009/0037873(A1) | 2009-02-01 | Ahadian et al. | Applicant |
| US2009/0049428(A1) | 2009-02-01 | Cozmei | Applicant |
| US2009/0055802(A1) | 2009-02-01 | Crosby | Applicant |
| US2009/0089765(A1) | 2009-04-01 | Guo et al. | Applicant |
| US2009/0106746(A1) | 2009-04-01 | Chaudhuri et al. | Applicant |
| US2009/0113399(A1) | 2009-04-01 | Tzoref et al. | Applicant |
| US2009/0125519(A1) | 2009-05-01 | Robison et al. | Applicant |
| US2009/0138858(A1) | 2009-05-01 | Livshits et al. | Applicant |
| US2009/0150874(A1) | 2009-06-01 | Chung et al. | Applicant |
| US2009/0157723(A1) | 2009-06-01 | De et al. | Applicant |
| US2009/0165016(A1) | 2009-06-01 | Bell | Applicant |
| US2009/0177642(A1) | 2009-07-01 | Chung et al. | Applicant |
| US2009/0193402(A1) | 2009-07-01 | Bashkansky et al. | Applicant |
| US2009/0199047(A1) | 2009-08-01 | Vaitheeswaran et al. | Applicant |
| US2009/0271729(A1) | 2009-10-01 | Killoren | Applicant |
| US2009/0276288(A1) | 2009-11-01 | Hlavac et al. | Applicant |
| US2009/0307630(A1) | 2009-12-01 | Kawai et al. | Applicant |
| US2009/0313525(A1) | 2009-12-01 | Savin et al. | Applicant |
| US2009/0313600(A1) | 2009-12-01 | Ayers et al. | Applicant |
| US2009/0319996(A1) | 2009-12-01 | Shafi et al. | Applicant |
| US2010/0005249(A1) | 2010-01-01 | Bates et al. | Applicant |
| US2010/0011341(A1) | 2010-01-01 | Baierl et al. | Applicant |
| US2010/0042944(A1) | 2010-02-01 | Robinson et al. | Applicant |
| US2010/0049941(A1) | 2010-02-01 | Howard | Applicant |
| US2010/0064279(A1) | 2010-03-01 | Stewart | Applicant |
| US2010/0070505(A1) | 2010-03-01 | Kao et al. | Applicant |
| US2010/0077388(A1) | 2010-03-01 | Kimura | Applicant |
| US2010/0083178(A1) | 2010-04-01 | Zui et al. | Applicant |
| US2010/0083185(A1) | 2010-04-01 | Sakai et al. | Applicant |
| US2010/0088665(A1) | 2010-04-01 | Langworthy et al. | Applicant |
| US2010/0106920(A1) | 2010-04-01 | Anckaert et al. | Applicant |
| US2010/0115172(A1) | 2010-05-01 | Gillingham et al. | Applicant |
| US2010/0123717(A1) | 2010-05-01 | Jiao | Applicant |
| US2010/0125565(A1) | 2010-05-01 | Burger et al. | Applicant |
| US2010/0125838(A1) | 2010-05-01 | Kuusilinna et al. | Applicant |
| US2010/0131945(A1) | 2010-05-01 | Zeort | Applicant |
| US2010/0134501(A1) | 2010-06-01 | Lowe | Applicant |
| US2010/0138431(A1) | 2010-06-01 | Bator et al. | Applicant |
| US2010/0146489(A1) | 2010-06-01 | Ortiz | Applicant |
| US2010/0153786(A1) | 2010-06-01 | Matsukawa | Applicant |
| US2010/0167256(A1) | 2010-07-01 | Blash | Applicant |
| US2010/0180245(A1) | 2010-07-01 | Rutten | Applicant |
| US2010/0180346(A1) | 2010-07-01 | Nicolson et al. | Applicant |
| US2010/0205583(A1) | 2010-08-01 | Gebhardt et al. | Applicant |
| US2010/0223581(A1) | 2010-09-01 | Manolescu et al. | Applicant |
| US2010/0235771(A1) | 2010-09-01 | Gregg, III | Applicant |
| US2010/0251220(A1) | 2010-09-01 | Jeong | Applicant |
| US2010/0257019(A1) | 2010-10-01 | Chickering et al. | Applicant |
| US2010/0262832(A1) | 2010-10-01 | Tie et al. | Applicant |
| US2010/0268816(A1) | 2010-10-01 | Tarui et al. | Applicant |
| US2010/0281458(A1) | 2010-11-01 | Paladino et al. | Applicant |
| US2010/0281468(A1) | 2010-11-01 | Pavlyushchik | Applicant |
| US2010/0281488(A1) | 2010-11-01 | Krishnamurthy et al. | Applicant |
| US2010/0287541(A1) | 2010-11-01 | Saunders et al. | Applicant |
| US2010/0295856(A1) | 2010-11-01 | Ferreira et al. | Applicant |
| US2010/0299671(A1) | 2010-11-01 | Kinsey | Applicant |
| US2010/0306854(A1) | 2010-12-01 | Neergaard | Applicant |
| US2010/0318994(A1) | 2010-12-01 | Holmberg | Applicant |
| US2010/0333039(A1) | 2010-12-01 | Denkel | Applicant |
| US2011/0004443(A1) | 2011-01-01 | Horikawa | Applicant |
| US2011/0004598(A1) | 2011-01-01 | Kikuchi | Applicant |
| US2011/0055815(A1) | 2011-03-01 | Squillace | Applicant |
| US2011/0066973(A1) | 2011-03-01 | Plom et al. | Applicant |
| US2011/0067008(A1) | 2011-03-01 | Srivastava et al. | Applicant |
| US2011/0072309(A1) | 2011-03-01 | Sakai et al. | Applicant |
| US2011/0072420(A1) | 2011-03-01 | Cha et al. | Applicant |
| US2011/0078487(A1) | 2011-03-01 | Nielsen et al. | Applicant |
| US2011/0088021(A1) | 2011-04-01 | Kruglick | Applicant |
| US2011/0088038(A1) | 2011-04-01 | Kruglick | Applicant |
| US2011/0098973(A1) | 2011-04-01 | Seidman | Applicant |
| US2011/0126286(A1) | 2011-05-01 | Nazarov | Applicant |
| US2011/0138363(A1) | 2011-06-01 | Schmelter et al. | Applicant |
| US2011/0138365(A1) | 2011-06-01 | Schmelter et al. | Applicant |
| US2011/0153603(A1) | 2011-06-01 | Adiba et al. | Applicant |
| US2011/0153817(A1) | 2011-06-01 | Wright et al. | Applicant |
| US2011/0154289(A1) | 2011-06-01 | Mannarswamy et al. | Applicant |
| US2011/0154296(A1) | 2011-06-01 | Marenco | Applicant |
| US2011/0154300(A1) | 2011-06-01 | Rao et al. | Applicant |
| US2011/0167414(A1) | 2011-07-01 | Lattner et al. | Applicant |
| US2011/0191343(A1) | 2011-08-01 | Heaton | Applicant |
| US2011/0202907(A1) | 2011-08-01 | Dice et al. | Applicant |
| US2011/0209153(A1) | 2011-08-01 | Suzuki et al. | Applicant |
| US2011/0225458(A1) | 2011-09-01 | Zuo | Applicant |
| US2011/0249002(A1) | 2011-10-01 | Duplessis et al. | Applicant |
| US2011/0258608(A1) | 2011-10-01 | Li et al. | Applicant |
| US2011/0258611(A1) | 2011-10-01 | Dutta et al. | Applicant |
| US2011/0258612(A1) | 2011-10-01 | Matthiesen et al. | Applicant |
| US2011/0276951(A1) | 2011-11-01 | Jain | Applicant |
| US2011/0283263(A1) | 2011-11-01 | Gagliardi et al. | Applicant |
| US2011/0289485(A1) | 2011-11-01 | Mejdrich et al. | Applicant |
| US2011/0314343(A1) | 2011-12-01 | Hoke et al. | Applicant |
| US2011/0314448(A1) | 2011-12-01 | Biggerstaff et al. | Applicant |
| US2011/0314543(A1) | 2011-12-01 | Treit et al. | Applicant |
| US2012/0011519(A1) | 2012-01-01 | Ganesh | Applicant |
| US2012/0017123(A1) | 2012-01-01 | Masser et al. | Applicant |
| US2012/0023475(A1) | 2012-01-01 | Surazski et al. | Applicant |
| US2012/0042212(A1) | 2012-02-01 | Laurenti | Applicant |
| US2012/0042269(A1) | 2012-02-01 | Holman | Applicant |
| US2012/0047421(A1) | 2012-02-01 | Holman | Applicant |
| US2012/0060142(A1) | 2012-03-01 | Fliess et al. | Applicant |
| US2012/0072579(A1) | 2012-03-01 | Teather | Applicant |
| US2012/0079108(A1) | 2012-03-01 | Findeisen | Applicant |
| US2012/0079456(A1) | 2012-03-01 | Kannan et al. | Applicant |
| US2012/0079460(A1) | 2012-03-01 | Cho et al. | Applicant |
| US2012/0102029(A1) | 2012-04-01 | Larson et al. | Applicant |
| US2012/0110555(A1) | 2012-05-01 | Bates | Applicant |
| US2012/0117438(A1) | 2012-05-01 | Shaffer et al. | Applicant |
| US2012/0137240(A1) | 2012-05-01 | Krueger | Applicant |
| US2012/0137273(A1) | 2012-05-01 | Meijler et al. | Applicant |
| US2012/0144374(A1) | 2012-06-01 | Gallagher | Applicant |
| US2012/0151396(A1) | 2012-06-01 | S. et al. | Applicant |
| US2012/0159091(A1) | 2012-06-01 | Li et al. | Applicant |
| US2012/0159116(A1) | 2012-06-01 | Lim et al. | Applicant |
| US2012/0159391(A1) | 2012-06-01 | Berry et al. | Applicant |
| US2012/0159454(A1) | 2012-06-01 | Barham et al. | Applicant |
| US2012/0167081(A1) | 2012-06-01 | Sedayao et al. | Applicant |
| US2012/0173703(A1) | 2012-07-01 | Lingen | Applicant |
| US2012/0197868(A1) | 2012-08-01 | Fauser et al. | Applicant |
| US2012/0198423(A1) | 2012-08-01 | Bestgen et al. | Applicant |
| US2012/0204156(A1) | 2012-08-01 | Kettley et al. | Applicant |
| US2012/0221314(A1) | 2012-08-01 | Bourlatchkov et al. | Applicant |
| US2012/0222019(A1) | 2012-08-01 | Gounares et al. | Applicant |
| US2012/0222043(A1) | 2012-08-01 | Gounares et al. | Applicant |
| US2012/0227040(A1) | 2012-09-01 | Gounares | Applicant |
| US2012/0233310(A1) | 2012-09-01 | Agarwala et al. | Applicant |
| US2012/0233592(A1) | 2012-09-01 | Gounares | Applicant |
| US2012/0233601(A1) | 2012-09-01 | Gounares | Applicant |
| US2012/0246303(A1) | 2012-09-01 | Petersen | Applicant |
| US2012/0254266(A1) | 2012-10-01 | Printezis et al. | Applicant |
| US2012/0254900(A1) | 2012-10-01 | Kumar | Applicant |
| US2012/0259962(A1) | 2012-10-01 | Bose et al. | Applicant |
| US2012/0260135(A1) | 2012-10-01 | Beck et al. | Applicant |
| US2012/0266014(A1) | 2012-10-01 | Bhoovaraghavan et al. | Applicant |
| US2012/0266143(A1) | 2012-10-01 | Bhoovaraghavan et al. | Applicant |
| US2012/0278504(A1) | 2012-11-01 | Ang et al. | Applicant |
| US2012/0278594(A1) | 2012-11-01 | Kumar | Applicant |
| US2012/0278793(A1) | 2012-11-01 | Jalan | Applicant |
| US2012/0290672(A1) | 2012-11-01 | Robinson et al. | Applicant |
| US2012/0296991(A1) | 2012-11-01 | Spivack et al. | Applicant |
| US2012/0317276(A1) | 2012-12-01 | Muniraju | Applicant |
| US2012/0317371(A1) | 2012-12-01 | Gounares et al. | Applicant |
| US2012/0317389(A1) | 2012-12-01 | Gounares | Applicant |
| US2012/0317421(A1) | 2012-12-01 | Gounares | Applicant |
| US2012/0317551(A1) | 2012-12-01 | Hecht et al. | Applicant |
| US2012/0317556(A1) | 2012-12-01 | Zhu et al. | Applicant |
| US2012/0317557(A1) | 2012-12-01 | Garrett et al. | Applicant |
| US2012/0317577(A1) | 2012-12-01 | Garrett et al. | Applicant |
| US2012/0317587(A1) | 2012-12-01 | Garrett et al. | Applicant |
| US2012/0323827(A1) | 2012-12-01 | Lakshmanan et al. | Applicant |
| US2012/0324454(A1) | 2012-12-01 | Gounares et al. | Applicant |
| US2012/0324527(A1) | 2012-12-01 | Brown et al. | Applicant |
| US2012/0330700(A1) | 2012-12-01 | Garg et al. | Applicant |
| US2013/0007116(A1) | 2013-01-01 | Strack et al. | Applicant |
| US2013/0018925(A1) | 2013-01-01 | Pegg | Applicant |
| US2013/0042156(A1) | 2013-02-01 | Srinivasan et al. | Applicant |
| US2013/0060372(A1) | 2013-03-01 | Lokowandt et al. | Applicant |
| US2013/0061212(A1) | 2013-03-01 | Krause et al. | Applicant |
| US2013/0067445(A1) | 2013-03-01 | Gounares | Applicant |
| US2013/0073523(A1) | 2013-03-01 | Gounares | Applicant |
| US2013/0073604(A1) | 2013-03-01 | Gounares | Applicant |
| US2013/0073829(A1) | 2013-03-01 | Gounares et al. | Applicant |
| US2013/0073837(A1) | 2013-03-01 | Li et al. | Applicant |
| US2013/0074049(A1) | 2013-03-01 | Gounares et al. | Applicant |
| US2013/0074050(A1) | 2013-03-01 | Masser et al. | Applicant |
| US2013/0074055(A1) | 2013-03-01 | Gounares | Applicant |
| US2013/0074056(A1) | 2013-03-01 | Gounares | Applicant |
| US2013/0074057(A1) | 2013-03-01 | Gounares | Applicant |
| US2013/0074058(A1) | 2013-03-01 | Gounares et al. | Applicant |
| US2013/0074092(A1) | 2013-03-01 | Gounares | Applicant |
| US2013/0074093(A1) | 2013-03-01 | Gounares | Applicant |
| US2013/0080642(A1) | 2013-03-01 | Adam et al. | Applicant |
| US2013/0080760(A1) | 2013-03-01 | Li et al. | Applicant |
| US2013/0080761(A1) | 2013-03-01 | Garrett et al. | Applicant |
| US2013/0081005(A1) | 2013-03-01 | Gounares et al. | Applicant |
| US2013/0085882(A1) | 2013-04-01 | Gounares et al. | Applicant |
| US2013/0086348(A1) | 2013-04-01 | Marathe et al. | Applicant |
| US2013/0086564(A1) | 2013-04-01 | Felch | Applicant |
| US2013/0091387(A1) | 2013-04-01 | Bohnet | Applicant |
| US2013/0091508(A1) | 2013-04-01 | Srinivasan | Applicant |
| US2013/0104107(A1) | 2013-04-01 | De et al. | Applicant |
| US2013/0117280(A1) | 2013-05-01 | Donaldson | Applicant |
| US2013/0117753(A1) | 2013-05-01 | Gounares et al. | Applicant |
| US2013/0117759(A1) | 2013-05-01 | Gounares et al. | Applicant |
| US2013/0145015(A1) | 2013-06-01 | Malloy et al. | Applicant |
| US2013/0145350(A1) | 2013-06-01 | Marinescu | Applicant |
| US2013/0159198(A1) | 2013-06-01 | Cartan | Applicant |
| US2013/0166886(A1) | 2013-06-01 | Sasanka et al. | Applicant |
| US2013/0185433(A1) | 2013-07-01 | Zhu et al. | Applicant |
| US2013/0185729(A1) | 2013-07-01 | Vasic et al. | Applicant |
| US2013/0187941(A1) | 2013-07-01 | Noon | Applicant |
| US2013/0198729(A1) | 2013-08-01 | Turner et al. | Applicant |
| US2013/0205009(A1) | 2013-08-01 | Malloy et al. | Applicant |
| US2013/0212479(A1) | 2013-08-01 | Willis | Applicant |
| US2013/0212594(A1) | 2013-08-01 | Choi et al. | Applicant |
| US2013/0219057(A1) | 2013-08-01 | Li et al. | Applicant |
| US2013/0219363(A1) | 2013-08-01 | Wu | Applicant |
| US2013/0219372(A1) | 2013-08-01 | Li et al. | Applicant |
| US2013/0227529(A1) | 2013-08-01 | Li et al. | Applicant |
| US2013/0227536(A1) | 2013-08-01 | Li et al. | Applicant |
| US2013/0227560(A1) | 2013-08-01 | McGrath | Applicant |
| US2013/0227573(A1) | 2013-08-01 | Morsi et al. | Applicant |
| US2013/0229416(A1) | 2013-09-01 | Krajec | Applicant |
| US2013/0232174(A1) | 2013-09-01 | Krajec | Applicant |
| US2013/0232433(A1) | 2013-09-01 | Krajec | Applicant |
| US2013/0232452(A1) | 2013-09-01 | Krajec | Applicant |
| US2013/0232463(A1) | 2013-09-01 | Nagaraja | Applicant |
| US2013/0235040(A1) | 2013-09-01 | Jackson, Jr. | Applicant |
| US2013/0254746(A1) | 2013-09-01 | Balakrishnan et al. | Applicant |
| US2013/0271480(A1) | 2013-10-01 | Daynes | Applicant |
| US2013/0282545(A1) | 2013-10-01 | Gounares | Applicant |
| US2013/0283102(A1) | 2013-10-01 | Krajec et al. | Applicant |
| US2013/0283240(A1) | 2013-10-01 | Krajec et al. | Applicant |
| US2013/0283241(A1) | 2013-10-01 | Krajec et al. | Applicant |
| US2013/0283242(A1) | 2013-10-01 | Gounares et al. | Applicant |
| US2013/0283246(A1) | 2013-10-01 | Krajec et al. | Applicant |
| US2013/0283247(A1) | 2013-10-01 | Krajec et al. | Applicant |
| US2013/0283281(A1) | 2013-10-01 | Krajec et al. | Applicant |
| US2013/0291113(A1) | 2013-10-01 | Dewey | Applicant |
| US2013/0298112(A1) | 2013-11-01 | Gounares | Applicant |
| US2013/0318506(A1) | 2013-11-01 | Sohm et al. | Applicant |
| US2013/0332913(A1) | 2013-12-01 | Dickenson | Applicant |
| US2013/0340077(A1) | 2013-12-01 | Salsamendi | Applicant |
| US2013/0346479(A1) | 2013-12-01 | Vilke | Applicant |
| US2014/0013306(A1) | 2014-01-01 | Gounares et al. | Applicant |
| US2014/0013308(A1) | 2014-01-01 | Gounares | Applicant |
| US2014/0013309(A1) | 2014-01-01 | Gounares | Applicant |
| US2014/0013311(A1) | 2014-01-01 | Garrett et al. | Applicant |
| US2014/0019598(A1) | 2014-01-01 | Krajec et al. | Applicant |
| US2014/0019756(A1) | 2014-01-01 | Krajec et al. | Applicant |
| US2014/0019879(A1) | 2014-01-01 | Krajec et al. | Applicant |
| US2014/0019985(A1) | 2014-01-01 | Krajec et al. | Applicant |
| US2014/0025572(A1) | 2014-01-01 | Krajec et al. | Applicant |
| US2014/0026142(A1) | 2014-01-01 | Gounares | Applicant |
| US2014/0040591(A1) | 2014-02-01 | Gounares | Applicant |
| US2014/0047084(A1) | 2014-02-01 | Breternitz | Applicant |
| US2014/0047272(A1) | 2014-02-01 | Breternitz | Applicant |
| US2014/0053143(A1) | 2014-02-01 | Conrod et al. | Applicant |
| US2014/0068629(A1) | 2014-03-01 | Boller | Applicant |
| US2014/0109101(A1) | 2014-04-01 | Radhakrishnan et al. | Applicant |
| US2014/0109188(A1) | 2014-04-01 | Pavlov | Applicant |
| US2014/0136233(A1) | 2014-05-01 | Atkinson et al. | Applicant |
| US2014/0189650(A1) | 2014-07-01 | Gounares | Applicant |
| US2014/0189651(A1) | 2014-07-01 | Gounares | Applicant |
| US2014/0189652(A1) | 2014-07-01 | Gounares | Applicant |
| US2014/0215443(A1) | 2014-07-01 | Voccio et al. | Applicant |
| US2014/0215444(A1) | 2014-07-01 | Voccio et al. | Applicant |
| US2014/0278539(A1) | 2014-09-01 | Edwards | Applicant |
| US2014/0281726(A1) | 2014-09-01 | Garrett et al. | Applicant |
| US2014/0282597(A1) | 2014-09-01 | Garrett et al. | Applicant |
| US2014/0317454(A1) | 2014-10-01 | Gataullin et al. | Applicant |
| US2014/0317603(A1) | 2014-10-01 | Gataullin et al. | Applicant |
| US2014/0317604(A1) | 2014-10-01 | Gataullin et al. | Applicant |
| US2014/0317605(A1) | 2014-10-01 | Gataullin et al. | Applicant |
| US2014/0317606(A1) | 2014-10-01 | Gataullin et al. | Applicant |
| US2014/0359126(A1) | 2014-12-01 | Breternitz | Applicant |
| US2014/0365544(A1) | 2014-12-01 | Moffitt | Applicant |
| US2014/0365545(A1) | 2014-12-01 | Moffitt | Applicant |
| US2015/0029193(A1) | 2015-01-01 | Krajec | Applicant |
| US2015/0032971(A1) | 2015-01-01 | Tian et al. | Applicant |
| US2015/0033172(A1) | 2015-01-01 | Krajec | Applicant |
| US2015/0066869(A1) | 2015-03-01 | Seto et al. | Applicant |
| US2015/0067652(A1) | 2015-03-01 | Seto et al. | Applicant |
| US2015/0067654(A1) | 2015-03-01 | Seto et al. | Applicant |
| US2015/0074278(A1) | 2015-03-01 | Maes | Applicant |
| US2015/0082285(A1) | 2015-03-01 | Li et al. | Applicant |
| US2015/0163288(A1) | 2015-06-01 | Maes | Applicant |
| US2015/0195372(A1) | 2015-07-01 | Zheng | Applicant |
| US2015/0205588(A1) | 2015-07-01 | Bates et al. | Applicant |
| US2015/0212928(A1) | 2015-07-01 | Gounares | Applicant |
| US2015/0222548(A1) | 2015-08-01 | Krajec et al. | Applicant |
| US2015/0242303(A1) | 2015-08-01 | Gautallin et al. | Applicant |
| US2015/0301920(A1) | 2015-10-01 | Krajec et al. | Applicant |
| US2015/0304409(A1) | 2015-10-01 | Steuer | Applicant |
| US2015/0331720(A1) | 2015-11-01 | Huetter et al. | Applicant |
| US2015/0347268(A1) | 2015-12-01 | Garrett et al. | Applicant |
| US2015/0347273(A1) | 2015-12-01 | Krajec et al. | Applicant |
| US2015/0347277(A1) | 2015-12-01 | Gataullin et al. | Applicant |
| US2015/0347283(A1) | 2015-12-01 | Gataullin et al. | Applicant |
| US2015/0347628(A1) | 2015-12-01 | Krajec | Applicant |
| US2016/0035115(A1) | 2016-02-01 | Krajec | Applicant |
| US2016/0077951(A1) | 2016-03-01 | Krajec et al. | Applicant |
| US2016/0133035(A1) | 2016-05-01 | Krajec | Applicant |
| US2016/0266998(A1) | 2016-09-01 | Gautallin et al. | Applicant |
| US2016/0283345(A1) | 2016-09-01 | Gounares et al. | Applicant |
| US2016/0283362(A1) | 2016-09-01 | Seto et al. | Applicant |
| CN1527968 | 2004-09-01 | Applicant | |
| CN101595457 | 2009-12-01 | Applicant | |
| CN101627388 | 2010-01-01 | Applicant | |
| CN101933001 | 2010-12-01 | Applicant | |
| CN102460408 | 2012-05-01 | Applicant | |
| CN102567115 | 2012-07-01 | Applicant | |
| CN102592079 | 2012-07-01 | Applicant | |
| CN102789409 | 2012-11-01 | Applicant | |
| EP610581 | 1994-08-01 | Applicant | |
| EP2390790 | 2011-11-01 | Applicant | |
| EP2553583 | 2013-02-01 | Applicant | |
| JP2012208830 | 2012-10-01 | Applicant | |
| KR2012138586 | 2012-12-01 | Applicant | |
| WO7100 | 2000-02-01 | Applicant | |
| WO2010039893 | 2010-04-01 | Applicant | |
| WO2011116988 | 2011-09-01 | Applicant | |
| WO2011142720 | 2011-11-01 | Applicant | |
| WO2011146750 | 2011-11-01 | Applicant | |
| WO2012106571 | 2012-08-01 | Applicant | |
| WO2014120263 | 2014-08-01 | Applicant |
Non-Patent Literature (174)
- Ohinese Office Action issued in Cn Application No. 201380072863.3 dated Apr. 6, 2017.Applicant
- Supplementary European Search Report issued in EPO Application No. 14801342.8 dated Apr. 10, 2017.Applicant
- Bita Mazloom et al: “Dataflow Tomography”, ACM Transactions on Architecture and Code Optimization, vol. 9, No. 1, Mar. 2012, pp. 1-26.Applicant
- Lienhard A. et al: “Taking an object-centric view on dynamic information with object flow analysis”, Computer Languages Systems & Structures, Pergamon, Amsterdam, NL, vol. 25, No. 1, Apr. 2009, pp. 63-79.Applicant
- Extended European Search Report issued in EPO Patent Application No. 14829908.4 dated Apr. 11, 2017.Applicant
- Office Action dated Apr. 3, 2017 cited in U.S. Appl. No. 14/671,449.Applicant
- Notice of Allowance dated May 5, 2017 cited inU.S. Appl. No. 14/883,554.Applicant
- Chinese Office Action issued in CN Application No. 201380072856.3 dated May 15, 2017.Applicant
- “Extended Search Report Issued in European Patent Application No. 14843127.3”, dated Apr. 13, 2017, 9 Pages.Applicant
- Extended European Search Report issued in European Patent Application No. 14862130.3 dated May 24, 2017.Applicant
- First Office Action and Search Report Issued in Chinese Patent Application No. 201380075253.9, dated Apr. 5, 2017, 27 Pages.Applicant
- U.S. Appl. No. 14/820,957, dated May 19, 2017, Notice of Allowance.Applicant
- U.S. Appl. No. 15/036,325, dated May 24, 2017, Notice of Allowance.Applicant
- U.S. Appl. No. 13/949,994, dated May 19, 2017, Office Action.Applicant
- U.S. Appl. No. 13/757,570, dated May 19, 2017, Office Action.Applicant
- Chinese Office Action issued in CN Patent Application No. 201480035488.X dated May 26, 2017.Applicant
- U.S. Appl. No. 14/671,449, dated Jun. 23, 2017, Notice of Allowance.Applicant
- Chinese Office Action issued in China Patent Application No. 201380075071.1. dated Mar. 3, 2017.Applicant
- “Non-Final Office Action Issued in U.S Appl. No. 14/883,554”, dated Feb. 22, 2017, 14 pages.Applicant
- Office Action issued in Chinese Patent Application No. 201380075229.5 dated Mar. 1, 2017.Applicant
- Office Action issued in Chinese Patent Application No. 201480029533.0 dated Mar. 20, 2017.Applicant
- Chinese Office Action issued in China Patent Application No. 201380072861.4. dated Mar. 9, 2017.Applicant
- Extended European Search Report issued in EPO application No. 14785777.5 dated Mar. 16, 2017.Applicant
- Notice of Allowance dated Apr. 5, 2017 cited in U.S Appl. No. 13/899,504.Applicant
- European Search Report for EP 14801342 dated Dec. 6, 2016.Applicant
- Vetter et al. “Real-Time Performance Monitoring, Adaptive Control, and Interactive Steering of Computational Grids”, International Journal of High Performance Computing Applications, vol. 14, No. 4, 2000, pp. 357-366.Applicant
- “Supplementary Search Report Issued in European Patent Application No. 13875046.8”, dated Sep. 5, 2016, 13 pages.Applicant
- “Supplementary Search Report Issued in European Patent Application No. 13874921”, dated Sep. 8, 2016.Applicant
- Office Action dated Nov. 17, 2016 cited in U.S Appl. No. 13/757,570.Applicant
- “Supplementary Search Report Issued in European Patent Application No. 14785777”, dated Nov. 3, 2016.Applicant
- Ravindranath, et al. “Appinsight: Mobile App Performance Monitoring in the Wild”, Usenix, Apr. 11, 2013 pp. 1-14.Applicant
- Graham et al. “Gprot: A Call Graph Execution Profiler”, PLDI 09: Proceedings of the 2009 ACM Sigplan Conference on Programming Language Design and Implementation, Jun. 15-20, 2009.Applicant
- “Notice of Allowance Issued in U.S. Appl. No. 14/455,156”, dated Jun. 3, 2015, 22 Pages.Applicant
- “Notice of Allowance Issued in U.S. Appl. No. 14/455,170”, dated Jul. 2, 2015, 13 Pages.Applicant
- “Notice of Allowability Issued in U.S. Appl. No. 14/455,170”, dated Feb. 10, 2016, 2 Pages.Applicant
- “Notice of Allowance Issued in U.S. Appl. No. 14/455,202”, dated Jul. 30, 2015, 16 Pages.Applicant
- “Notice of Allowability Issued in U.S. Appl. No. 14/455,202”, dated Feb. 4, 2016, 2 Pages.Applicant
- “Notice of Allowance Issued in U.S. Appl. No. 14/455,156”, dated Nov. 9, 2015, 21 Pages.Applicant
- “Notice of Allowance Issued in U.S. Appl. No. 14/455,170”, dated Nov. 24, 2015, 11 Pages.Applicant
- “Notice of Allowance Issued in U.S. Appl. No. 14/455,202”, dated Dec. 9, 2015, 17 Pages.Applicant
- “International Search Report Issued in PCT Application No. PCT/IB2014/060233”, dated Nov. 11, 2014, 4 Pages.Applicant
- Office Action dated Dec. 1, 2016 issued in U.S Appl. No. 14/820,957.Applicant
- Office Action dated Dec. 14, 2016 issued in U.S Appl. No. 13/867,057.Applicant
- “Supplementary Search Report Issued in European Patent Application No. 13875228.2”, dated Dec. 16, 2016.Applicant
- International Search Report and Written Opinion for PCT/US2013/043492 dated Nov. 6, 2013.Applicant
- Grossbart “JavaScript Profiling with the Chrome Developer Tools” Smashing Magazine website Jun. 12, 2012.Applicant
- “Method and System for Automatically Tracking User Interactions and Providing Tags to the User Interactions” Dec. 4, 2010.Applicant
- Whitehead “Java Run-Time Monitoring, Part 2:Postcompilation Instrumentation and Performance Monitoring Interception, Class Wrapping, and Bytecode Instrumentation” IBM.com Aug. 5, 2008.Applicant
- Kinsey “Under the Hood: The JavaScript SDK—Error Handling” Nov. 1, 2012.Applicant
- Cantrill “Instrumenting the Real-Time Web: Node.js in Production” Node Summit 2012 Presentation; Jan. 24-25, 2012.Applicant
- “Remote Debugging in Visual Studio 2012 on Windows 8” On Error Resume Next: Coding Through Life, One Day at the Time. Retrieved Jun. 14, 2016.Applicant
- Narayanasamy et al. “BugNet Continuously Recording Program Execution for Deterministic Replay Debugging” Jun. 2005, 12 pages.Applicant
- Dong et al. “Hybrid Checkpointing Using Emerging Nonvolatile Memories for Future Exascale Systems” Oct. 2004.Applicant
- Erik-Svensson et al. “Mpreplay Architecture Support for Deterministic Replay of Message passing Programs on MessagePassing Many-core Processors” Sep. 2009.Applicant
- Gerofi et al. “Workload Adaptive Checkpoint Scheduling of Virtual Machine Replication” 2011.Applicant
- Wu et al. “Error Recovery in Shared Memory Multiprocessors Using Private Caches” Apr. 1990.Applicant
- “International Search Report Issued in PCT Application No. PCT/US2014/011798”, dated Jun. 20, 2014, 3 pages.Applicant
- “International Search Report and Written Opinion”, Korea Intellectual Property Office, PCT/U52014/011733, May 8, 2014, 10062-02.Applicant
- Aguilera, et al., “Performance Debugging for Distributed Systems of Black Boxes”, ACM, 2003, pp. 74-89.Applicant
- Hsu, et al., “Visibility Enhancement for Silicon Debug”, ACM, 2006, pp. 13-18.Applicant
- Kaya, et al., “Error Pattern Analysis of Augmented Array Codes Using a Visual Debugging Tool”, IEEE, 2006, pp. 1-6.Applicant
- LabVIEW, “Debugging Techniques”, Jun. 2011, 7 pages. Available at http://zone.ni.com/reference/en-XX/help/371361H-01/1vconcepts/debug—techniques/.Applicant
- Kumar, et al., “Visualization of Clustered Directed Acyclic Graphs with Node Interleaving”, ACM, pp. 1800-1805, Mar. 2009.Applicant
- Natour, “On the Control Dependence in the Program Dependence Graph”, ACM, pp. 510-519, 1988. (The month of Publication is irrelevant since the year of Publication is clearly prior to the filing of the Application).Applicant
- Ioannidis et al., “Transitive Closure Algorithms Based on Graph Traversal”, ACM Transactions on Database sSystems, vol. 18, No. 3, pp. 512-579, Sep. 1993.Applicant
- Fu, et al., “De-anonymizing Social Graphs via Node Similarity”, ACM, pp. 263-264, Apr. 2014.Applicant
- Supplementary Search Report Issued in European Patent Application No. 13873476.9, dated Aug. 2, 2016, 10 pages.Applicant
- Barbosa et al. “Interactive SNMP Traffic Analysis Through Information Visualization” In Proceedings of the IEEE Network Operations and Management Symposium (NOMS), Apr. 19, 2010, pp. 73-79.Applicant
- Dobrev et al. “Visualization of Node Interaction Dynamics in Network Traces” In Proceedings of the 3rd International Conference on Autonomous Infrastructure, Management and Security, AIMS 2009, Enschede, Jun. 30, 2009, pp. 147-160.Applicant
- Joyce et al. “Monitoring Distributed Systems” In Journal of ACM Transactions on Computer Systems (Tocs), vol. 5, Issue 2, May 1, 1987, pp. 121-150.Applicant
- Heer et al. “Prefuse” CHI 2005, Conference Proceedings, Conference on Human Factors in Computing Systems; Apr. 2 2005, pp. 421-430.Applicant
- Ungar, et al., “Self”, ACM, 2007, pp. 1-50.Applicant
- Anonymous “Time Series Analysis” Mar. 7, 2008.Applicant
- Gephi Tutorial Layouts, Gephi, Jun. 13, 2011.Applicant
- International Search Report and Written Opinion for PCT/US2013/047211 dated Nov. 27, 2013.Applicant
- International Search Report and Written Opinion for PCT/US2013/043811 dated Nov. 28, 2013.Applicant
- International Search Report and Written Opinion for PCT/US2013/046925 dated Nov. 25, 2013.Applicant
- International Search Report and Written Opinion for PCT/US2013/046918 dated Nov. 25, 2013.Applicant
- International Search Report and Written Opinion for PCT/US2013/044193 dated Oct. 29, 2013.Applicant
- International Search Report and Written Opinion for PCT/US2013/046050 dated Nov. 8, 2013.Applicant
- International Search Report and Written Opinion for PCT/US2013/046922 dated Dec. 17, 2013.Applicant
- International Search Report and Written Opinion for PCT/US2013/043522 dated Nov. 6, 2013.Applicant
- International Search Report and Written Opinion for PCT/US2013/046664 dated Nov. 20, 2013.Applicant
- International Search Report and Written Opinion for PCT/US2013/042789 dated Sep. 30, 2013.Applicant
- International Search Report and Written Opinion for PCT/US2013/042030 dated Oct. 24, 2013.Applicant
- International Search Report and Written Opinion for PCT/US2013/042081 dated Oct. 24, 2013.Applicant
- International Search Report and Written Opinion for PCT/US2013/042788 dated Sep. 5, 2013.Applicant
- International Search Report and Written Opinion for PCT/US2013/073894 dated Apr. 1, 2014.Applicant
- International Search Report and Written Opinion for PCT/US2013/075876 dated Apr. 7, 2014.Applicant
- International Search Report and Written Opinion for PCT/US2013/073935 dated Mar. 31, 2014.Applicant
- International Search Report and Written Opinion for PCT/US2014/011727 dated May 16, 2014.Applicant
- European Search Report for EP 13873299 dated Sep. 21, 2016.Applicant
- TLR “Automagically Wrapping JavaScript Callback Functions” Oct. 22, 2008.Applicant
- U.S Appl. No. 13/751,012, dated Jan. 29, 2014, Office Action.Applicant
- U.S Appl. No. 13/751,012, dated Mar. 11, 2014, Office Action.Applicant
- U.S Appl. No. 13/751,026, dated Apr. 16, 2014, Office Action.Applicant
- U.S Appl. No. 13/853,769, dated May 9, 2014, Office Action.Applicant
- U.S Appl. No. 13/765,654, dated Jun. 26, 2014, Office Action.Applicant
- U.S Appl. No. 13/853,769, dated Jul. 8, 2014, Office Action.Applicant
- U.S Appl. No. 13/765,663, dated Jul. 11, 2014, Office Action.Applicant
- U.S Appl. No. 13/757,598, dated Jul. 17, 2014, Office Action.Applicant
- U.S Appl. No. 13/899,500, dated Jul. 21, 2014, Office Action.Applicant
- U.S Appl. No. 13/899,504, dated Jul. 21, 2014, Office Action.Applicant
- U.S Appl. No. 13/765,648, dated Jul. 28, 2014, Office Action.Applicant
- U.S Appl. No. 13/765,642, dated Jul. 31, 2014, Office Action.Applicant
- U.S Appl. No. 13/765,657, dated Aug. 1, 2014, Office Action.Applicant
- U.S Appl. No. 13/757,625, dated Aug. 13, 2014, Office Action.Applicant
- U.S Appl. No. 13/867,057, dated Aug. 14, 2014, Office Action.Applicant
- U.S Appl. No. 13/765,651, dated Aug. 14, 2014, Office Action.Applicant
- U.S Appl. No. 13/765,642, dated Aug. 15, 2014, Office Action.Applicant
- U.S Appl. No. 13/765,648, dated Aug. 19, 2014, Notice of Allowance.Applicant
- U.S Appl. No. 13/751,026, dated Aug. 20, 2014, Office Action.Applicant
- U.S Appl. No. 13/765,654, dated Aug. 21, 2014, Office Action.Applicant
- U.S Appl. No. 13/765,657, dated Aug. 27, 2014, Notice of Allowance.Applicant
- U.S Appl. No. 13/899,507, dated Sep. 11, 2014, Office Action.Applicant
- U.S Appl. No. 13/899,503, dated Sep. 12, 2014, Office Action.Applicant
- U.S Appl. No. 13/751,012, dated Sep. 30, 2014, Notice of Allowance.Applicant
- U.S Appl. No. 13/916,561, dated Oct. 2, 2014, Office Action.Applicant
- U.S Appl. No. 13/757,570, Nov. 14, 2014, Office Action.Applicant
- U.S Appl. No. 13/757,625, dated Jan. 2, 2015, Office Action.Applicant
- U.S. Appl. No. 13/899,507, dated Jan. 7, 2015, Office Action.Applicant
- U.S. Appl. No. 13/916,568, dated Jan. 14, 2015, Notice of Allowance.Applicant
- U.S. Appl. No. 13/916,571, dated Jan. 15, 2015, Notice of Allowance.Applicant
- U.S. Appl. No. 13/765,642, dated Jan. 26, 2015, Notice of Allowance.Applicant
- U.S. Appl. No. 13/765,654, dated Jan. 26, 2015, Notice of Allowance.Applicant
- U.S. Appl. No. 13/899,500, dated Feb. 4, 2015,4 Notice of Allowance.Applicant
- U.S. Appl. No. 13/916,563, dated Feb. 12, 2015, Office Action.Applicant
- U.S. Appl. No. 13/765,651, dated Feb. 13, 2015, Office Action.Applicant
- U.S. Appl. No. 13/916,566, dated Feb. 13, 2015, Office Action.Applicant
- U.S. Appl. No. 13/757,598, dated Feb. 13, 2015, Office Action.Applicant
- U.S. Appl. No. 13/853,816, dated Feb. 25, 2015, Office Action.Applicant
- U.S. Appl. No. 13/916,561, dated Mar. 4, 2015, Notice of Allowance.Applicant
- U.S. Appl. No. 13/899,503, dated Mar. 11, 2015, Office Action.Applicant
- U.S. Appl. No. 13/899,504, dated Mar. 11, 2015, Office Action.Applicant
- U.S. Appl. No. 13/757,631, dated Mar. 17, 2015, Office Action.Applicant
- U.S. Appl. No. 13/867,057, dated Mar. 19, 2015, Office Action.Applicant
- U.S. Appl. No. 14/455,156, dated Jun. 3, 2015, Notice of Allowance.Applicant
- U.S. Appl. No. 13/853,769, dated Jun. 22, 2015, Office Action.Applicant
- U.S. Appl. No. 14/455,170, dated Jul. 2, 2015, Notice of Allowance.Applicant
- U.S. Appl. No. 13/949,978, dated Jul. 10, 2015, Notice of Allowance.Applicant
- U.S. Appl. No. 13/757,570, dated Jul. 29, 2015, Office Action.Applicant
- U.S. Appl. No. 13/757,582, dated Aug. 7, 2015, Office Action.Applicant
- U.S. Appl. No. 14/629,322, dated Aug. 26, 2015, Office Action.Applicant
- U.S. Appl. No. 13/853,816, dated Sep. 9, 2015, Office Action.Applicant
- U.S. Appl. No. 14/820,798, dated Sep. 24, 2015, Office Action.Applicant
- U.S. Appl. No. 13/757,631, dated Sep. 25, 2015, Notice of Allowance.Applicant
- U.S. Appl. No. 13/899,503, dated Nov. 3, 2015, Office Action.Applicant
- U.S. Appl. No. 13/899,504, dated Nov. 6, 2015, Office Action.Applicant
- U.S. Appl. No. 13/949,978, dated Nov. 13, 2015, Notice of Allowance.Applicant
- U.S. Appl. No. 14/629,322, dated Nov. 20, 2015, Notice of Allowance.Applicant
- U.S. Appl. No. 13/757,582, dated Dec. 21, 2015, Notice of Allowance.Applicant
- U.S. Appl. No. 13/757,625, dated Jan. 2, 2016, Office Action.Applicant
- U.S. Appl. No. 13/853,769, dated Feb. 19, 2016, Office Action.Applicant
- U.S. Appl. No. 14/995,872, dated Feb. 26, 2016, Office Action.Applicant
- U.S. Appl. No. 14/820,798, dated Apr. 6, 2016, Notice of Allowance.Applicant
- U.S. Appl. No. 14/820,834, dated Apr. 20, 2016, Notice of Allowance.Applicant
- U.S. Appl. No. 14/642,192, dated May 23, 2016, Notice of Allowance.Applicant
- U.S. Appl. No. 14/666,120, dated May 24, 2016, Office Action.Applicant
- U.S. Appl. No. 13/899,504, dated May 26, 2016, Office Action.Applicant
- U.S. Appl. No. 13/853,769, dated Jun. 2, 2016, Notice of Allowance.Applicant
- U.S. Appl. No. 13/899,503, dated Jun. 2, 2016, Office Action.Applicant
- U.S. Appl. No. 13/867,057, dated Jun. 3, 2016, Office Action.Applicant
- U.S. Appl. No. 14/995,872, dated Jun. 9, 2016, Notice of Allowance.Applicant
- U.S. Appl. No. 14/617,509, dated Jul. 20, 2016, Office Action.Applicant
- U.S. Appl. No. 14/582,973, dated Aug. 11, 2016, Notice of Allowance.Applicant
- U.S. Appl. No. 13/949,994, dated Aug. 26, 2016, Office Aciton.Applicant
- U.S. Appl. No. 13/853,816, dated Sep. 12, 2016, Notice of Allowance.Applicant
- U.S. Appl. No. 13/899,503, dated Oct. 5, 2016, Office Action.Applicant
- Office Action dated Dec. 30, 2016 cited in U.S. Appl. No. 13/899,504.Applicant
- Notice of Allowance dated Jan. 20, 2017 cited in U.S. Appl. No. 14/666,120.Applicant
- Huang et al. “Force-Transfer: A New Approach to Removing Overlapping Nodes in Graph Layout”, ACM, pp. 1-10, 2003.Applicant
- Nusayr et al. “Using AOP for Detailed Runtime Monitoring Instrumentation”, ACM, pp. 8-14, 2009.Applicant
- Reiss, “Visualization Program Execution Using User Abstractions”, ACM, pp. 125-134, 2006.Applicant
- Office Action dated Dec. 23, 2016 cited in U.S. Appl. No. 14/617,509.Applicant