65 results about "Call tree" patented technology

A method for automatically maintaining a database that stores coverage data for testing software code under development is provided. The method includes providing modified instrumented software and using test cases of a test suite to execute the modified instrumented software. Modified coverage data that includes a call tree defining a path of each test case is created. The method also includes replacing the coverage data with the modified coverage data at scheduled intervals.

Headset cellular phones which may be worn continually and use voice recognition / speech activation for dialing telephone numbers and controlling other aspects of operation. Cell phones according to the present invention can include a microphone and preferably include both internal and external speakers to allow the user to communicate unobtrusively, check voice mail and conduct other activities while at the same time being able to hear ambient noise in the environment. Voice recognition / speech command functionally may also be used to generate and send touch tone or DTMF tones such as in response to call trees or voice recognition / speech activation functionality used by airlines, credit card companies, voice mail systems, and other applications.

A method for analyzing test coverage of a software application is provided. The method includes profiling an executable of the software application to generate application call trees. The method also includes profiling test cases used to test a production Java VM so as to generate test case call trees. Also included is comparing the application call trees with the test case call trees so as to identify gaps in the application call tree not covered by the test case call trees.

A method and apparatus for identifying differences in runs of a computer program that are due to changes in the code of the computer program. With the apparatus and method, call trees are generated for two or more builds of a computer program. The apparatus and method perform a “tree-subtract” operation in which the two or more call trees generated during runs of two or more different builds of a computer program are subtracted from one another to identify build to build differences in the execution of the computer program. From the resulting tree, portions of the runs of the different builds of the computer program where the resource utilization of the computer program has not changed are easily identifiable. Moreover, portions of the runs of the different builds of the computer program where there are improvements or regressions in resource utilization of the computer program may be easily identifiable.

A software tool is provided to analyze static source code. Source Code files are selected to define the project work space. A class and a method in the class are selected from said selected source code files. The tool generates a Call Tree as an ordered recursive sequence of all method calls in different classes or their instances that are invoked by said selected method in said selected class. A Sequence Diagram is generated from said Call Tree. The tool remembers all updates to the Call Tree used to generate the Sequence Diagram. This information is used when a generated Sequence Diagram is impacted due to changes made to any source code file included in the project.

VoIP phones according to the present invention include a microphone, which may be internal or external, and allow the user to communicate unobtrusively, check voice mail and conduct other activities in an environment which can be noisy in general and extremely noisy sometimes. Speech recognition functionally may also be used to generate and send touch tone or DTMF tones such as in response to call trees or voice recognition functionality used by airlines, credit card companies, voice mail systems, and other applications. A system and method of audio processing which provides enhanced speech recognition is provided. Audio input is received at the microphone which is processed by adaptive noise cancellation to generate an enhanced audio signal. The operation of the speech recognition engine and the adaptive noise canceller may be advantageously controlled based on Voice Activity Detection (VAD).

A method and apparatus for averaging out variations from run to run of a computer program are provided. With the apparatus and method, call trees are generated for two or more executions of a build of a computer program. The apparatus and method perform a “tree-addition” operation in which the two or more call trees generated during runs of the computer program are added to one another to thereby accumulate statistics for each call in the call trees. These statistics may then be divided by the number of runs whose tree data structures are being accumulated. In this way, an average of the tree data structures is generated. In addition, any portions of the tree data structure that are due to asynchronous events are averaged out so that their relative affect in the resulting tree data structure is minimized.

A method and apparatus for automatically performing regression processing on trace data are provided. With the apparatus and method, call tree data structures are generated for two or more executions of two or more builds of a computer program. The apparatus and method perform a “tree-minimization” operation on each set of call tree data structures for each of the builds to generate minimized call tree data structures for each build of the computer program. The minimized call tree data structures are then subtracted from one another to generate a subtracted minimized call tree data structure. From this subtracted minimized call tree data structure, the portions of the computer program that are different from build to build and which appreciably and consistently affect the difference in execution of the computer program from build to build may be identified. Thus, the analyst's attention is directed to these areas of the computer program code which may be optimized in order to obtain better execution of the computer program.

A method, system and computer instructions for visually representing telephone call tree interfaces for interaction by users of data network phones, such as, for example, wire-line telephones, data network telephones, or IP telephones. A caller can connect to an automated telephone answering service, and view a display of an interactive, visual interface for a call tree. The display can depict actions that can be taken with respect to nodes of the call tree. The visual interface can show details about one or more nodes of the call tree, and the caller can select a node for interaction and enter a wait queue associated with the selected node. For example, the caller can use a wire-line telephone, wireless telephone, data network telephone, or IP telephone to interact with, navigate and / or modify the displayed call tree.

An automated method, system and computer instructions for users to visually navigate telephone call trees are disclosed. A caller can connect to an automated telephone answering service, and download the service's call tree. The caller can view a display with the call tree, and modify or rearrange the order in which the menu options of the call tree are displayed. The user can then store the modified call tree for use in the future. Responsive to the selection of a specified node in the displayed call tree, an automated process can create a macro or similar set of software instructions, which can be invoked by the calling device during a subsequent connection to the automated telephone answering system associated with the subject call tree, in order to enter a queue associated with the selected node that enables the user to interact with the selected node.

A system and method for determining execution path differences in a computer-implemented software application is provided herein. A software application under analysis is executed at least twice, thereby generating first and second call tree data and associated first and second sets of execution data describing the at least two executions of the software application. This data is then compared to determine a set of differences between the first and second executions of the program, the set of differences comprising one or more nodes that are either called differently in the first and second execution paths or executed differently in the first and second sets of execution data. For each node identified in the set of differences, the first and second call trees are then analyzed to identify at least one parent node that is the root cause of the difference in the execution data.

A system and method of detecting redundant subroutine calls in a software system is provided. Call path data is obtained for the software system and stored into a call tree comprising a plurality of nodes, each node representing a software routine of the software system, the call tree describing the calling paths between the plurality of software routines. At least one focal node is identified among the plurality of nodes in the call tree for redundancy analysis. The calling redundancy to the focal node is analyzed by determining a common ancestor node list for the focal node and by generating call path data for each of the common ancestor nodes on the list. The common ancestor list data may be sorted and call trees generated for the common ancestors in relation to the focal node. This data may then be displayed on a graphical user interface for redundancy analysis of the focal node.

A specification of a routine name of a root of a call tree and a specification of a desired depth of call tree tracing are obtained. Upon entering a given routine in a program, a determination is made whether the given routine is the root. Responsive to determining that the given one of the routines is the root, trace information for the routine forming the root is output. Furthermore, upon entering a given one of the routines called, directly or indirectly, by the routine forming the root, a determination is made whether the given one of the routines called, directly or indirectly, by the routine forming the root of the call tree is within the desired depth from the routine forming the root of the call tree; and if this is the case, trace information is output for given one of the routines called, directly or indirectly, by the routine forming the root of the call tree.

A method, system and computer instructions for users to visually rearrange telephone call trees are disclosed. A caller can connect to an automated telephone answering service, and download the service's call tree. The caller can view a display with the call tree, and modify or rearrange the order in which the menu options of the call tree are displayed. The user can then store the modified call tree for use in the future.

VoIP phones according to the present invention include a microphone, which may be internal or external, and allow the user to communicate unobtrusively, check voice mail and conduct other activities in an environment which can be noisy in general and extremely noisy sometimes. Speech recognition functionally may also be used to generate and send touch tone or DTMF tones such as in response to call trees or voice recognition functionality used by airlines, credit card companies, voice mail systems, and other applications. A system and method of audio processing which provides enhanced speech recognition is provided. Audio input is received at the microphone which is processed by adaptive noise cancellation to generate an enhanced audio signal. The operation of the speech recognition engine and the adaptive noise canceller may be advantageously controlled based on Voice Activity Detection (VAD).

A method to facilitate memory allocation includes examining an executable program file configured to be executed by a processor to identify a group of functions present within the executable program file, and calculating memory requirements for each function of the group of functions. Further operations include identifying a plurality of root functions as functions which are not referred to by other functions, creating a function call tree for each of the plurality of root functions, such that each of the function call trees comprise functions which are directly or indirectly referred to by an associated one of the plurality of root functions, and calculating memory requirements for one or more function call paths of each of the function call trees based upon the calculated memory requirements of the functions included within the one or more function call paths.

The invention provides a method for accurately estimating stack demand in an embedded system, which comprises the following steps of: performing stack demand analysis on the stack demand of a runtime library and a standard library of a local function and each call tree by using a complete function call relational graph, and summing; determining the maximum stack demand of each interrupt program in each priority level, summing, and adding the additional stack demand increased by saving the processor state; and summing the results to obtain the maximum stack demand of a single thread, wherein the complete function call relational graph is obtained by the following steps of: performing control flow analysis on a complete function relational graph to obtain a primary function relational graph, further analyzing by using a value analysis method of an abstract interpretation algorithm aiming at an indirect call function and a recursive call function, and noting function calls which cannot be analyzed by users. Aiming at multi-thread, a single thread step is repeated, a sum is calculated, and finally the sum plus the stack demand of the operation system is the total stack demand of the system.

A method and apparatus for identifying differences in runs of a computer program that are due to changes in the code of the computer program. With the apparatus and method, call trees are generated for two or more builds of a computer program. The apparatus and method perform a “tree-subtract” operation in which the two or more call trees generated during runs of two or more different builds of a computer program are subtracted from one another to identify build to build differences in the execution of the computer program. From the resulting tree, portions of the runs of the different builds of the computer program where the resource utilization of the computer program has not changed are easily identifiable. Moreover, portions of the runs of the different builds of the computer program where there are improvements or regressions in resource utilization of the computer program may be easily identifiable.

A method and apparatus for averaging out variations from run to run of a computer program are provided. With the apparatus and method, call trees are generated for two or more executions of a build of a computer program. The apparatus and method perform a “tree-addition” operation in which the two or more call trees generated during runs of the computer program are added to one another to thereby accumulate statistics for each call in the call trees. These statistics may then be divided by the number of runs whose tree data structures are being accumulated. In this way, an average of the tree data structures is generated. In addition, any portions of the tree data structure that are due to asynchronous events are averaged out so that their relative affect in the resulting tree data structure is minimized.

A specification of a routine name of a root of a call tree and a specification of a desired depth of call tree tracing are obtained. Upon entering a given routine in a program, a determination is made whether the given routine is the root. Responsive to determining that the given one of the routines is the root, trace information for the routine forming the root is output. Furthermore, upon entering a given one of the routines called, directly or indirectly, by the routine forming the root, a determination is made whether the given one of the routines called, directly or indirectly, by the routine forming the root of the call tree is within the desired depth from the routine forming the root of the call tree; and if this is the case, trace information is output for given one of the routines called, directly or indirectly, by the routine forming the root of the call tree.

The invention discloses a method for tracking and analyzing functions and statements involved in the dynamic executing process of a kernel of an Linux operating system. According to the invention, the method comprises the following steps of: expanding open source programs strace, KFT, tags and gcov, so that these programs are enabled to track each executable file on the original basis; meanwhile, filtering system call information and other information of a corresponding tracked executable file in the executing process; storing these information into a new established database; and finally displaying relevant information on a webpage and then linking and displaying a call tree, wherein linking each kernel function in the call tree to a file for defining the kernel function; and the display content comprises coverage of the functions in the file and executing frequency of each statement.

A method and apparatus for automatically performing regression processing on trace data are provided. With the apparatus and method, call tree data structures are generated for two or more executions of two or more builds of a computer program. The apparatus and method perform a “tree-minimization” operation on each set of call tree data structures for each of the builds to generate minimized call tree data structures for each build of the computer program. The minimized call tree data structures are then subtracted from one another to generate a subtracted minimized call tree data structure. From this subtracted minimized call tree data structure, the portions of the computer program that are different from build to build and which appreciably and consistently affect the difference in execution of the computer program from build to build may be identified. Thus, the analyst's attention is directed to these areas of the computer program code which may be optimized in order to obtain better execution of the computer program.

A software tool is provided to analyze static source code. Source Code files are selected to define the project work space. A class and a method in the class are selected from said selected source code files. The tool generates a Call Tree as an ordered recursive sequence of all method calls in different classes or their instances that are invoked by said selected method in said selected class. A Sequence Diagram is generated from said Call Tree. The tool remembers all updates to the Call Tree used to generate the Sequence Diagram. This information is used when a generated Sequence Diagram is impacted due to changes made to any source code file included in the project.

The invention concerns a test program executor for an Automated Test Equipment, wherein the test program executor is configured to execute a test flow having a plurality of test suites, wherein the test program executor is configured to asynchronously execute the plurality of test suites, wherein a test suite contains a call of a function of a subsystem, wherein the function of the subsystem is related with a subsystem operation that is to be executed by the subsystem, and to signal a call of a function of a subsystem by transmitting an asynchronous request to the subsystem, the asynchronous request having a call-specific call tree hierarchy address and the call-specific operation to be executed by the subsystem, and wherein the test program executor is further configured to determine an execution order of the subsystem operations, such that the execution order of the subsystem operations depends on their call-specific call tree hierarchy addresses.

The present invention is a system that uses a migration server to access voicemail of a source system through a front-end switch via a telephony interface, obtain voice messages stored on the source system and store them on a destination system via a data interface. A host processor initiates a migration based on a mailbox migration status stored in a host database and controls the switch to provide a path from the migration server to the source system. The host processor also controls call flow and initiates pass code (PIN) digit capture of a subscriber's pass code by the switch for mailboxes to be migrated. Call flow control includes determining to which system to route an arriving call based on migration status and determining whether to output a message-waiting indicator for newly stored messages. A migration server controls call tree navigation aspects of call flow during migration. Automated speech recognition is used to help capture the voice message as opposed to the voice message envelope and to capture message attribute information as well as the subscriber's greeting and voice announcement, and to assist in voicemail menu navigation.

The present invention discloses a system and method for delegated page specialization based on a page layer concept. A page consist of a set of layers. Except the first layer each layer represents a delta (container, frames) in its layout to its previous layer introduced on the corresponding level of administration. Administrators can modify the previous layers by defining new immutable and optional containers or frames on the page (delta). Only the deltas to the previous layers are stored with assignments to their parent layers. Immutable containers or frames of previous layers cannot be modified. The final page is automatically constructed as an union of deltas being stored in a so called tree-structure. The delegated page specialization is preferably accomplished via a GUI-component which supports the administrators.

Systems and methods are provided for generating a function-relation call tree. For example, an externally-specified global variable name is acquired; whether a first function matches the externally-specified global variable name is inquired; in response to the first function matching the externally-specified global variable name, whether a code of the first function includes a branch-judgment code is determined; in response to the code of the first function including the branch-judgment code, the code of the first function is divided to acquire a pre-branch-judgment code, a branch-judgment code and a post-branch-judgment code; the branch judgment code is analyzed to determine whether a related function is called by a code section associated with an attribute value of the branch-judgment code; and in response to the related function being called by the code section associated with the attribute value of the branch-judgment code, a function-relation call tree between the code section associated with the attribute value and the related function is generated.

A process of analyzing performance of a computer program including a plurality of components, each component comprising a plurality of methods, the program being executable by carrying out a plurality of calling sequences, each calling sequence includes a plurality of invocations of the methods, the process includes steps of: receiving a call tree profile having a plurality of nodes, each node representing an invocation and each node being annotated with a cumulative performance cost for the node; a set of one or more components of interest to a user; and a threshold level of a cumulative performance cost associated with invocations of methods of the component that constitutes an expensive method invocation; analyzing the call tree profile from leaf nodes, the analyzing step comprising selecting a set of one or more components of interest to a user and selecting only invocations that exceed the threshold level, and pruning the set of invocations that are not selected. Finally the process includes a step of presenting to the user a list of costs associated with the selected invocations.

The invention discloses a resource bottleneck prediction method, which is applied to a distributed business system. The method comprises the following steps of building a mathematic model between a message quantity of a single host and resource use in a machine learning mode; based on a message calling relation of a message bus, generating a calling tree of businesses corresponding to service scenes; and based on the mathematic model and the calling tree, performing resource bottleneck prediction on the businesses. The invention furthermore provides a resource bottleneck prediction device, a distributed business system and a computer readable storage medium. The quantization of resource use is realized, and an association relationship between the businesses and resources is established, sothat the resource bottleneck can be scientifically predicted based on business dimensions.