Abstract: We present a technique to perform dependence analysis on more complex array subscripts than the linear form of the enclosing loop indices. For such complex array subscripts, we decouple the original iteration space and the dependence test iteration space and link them through index-association functions. The dependence analysis is performed in the dependence test iteration space to determine whether the dependence exists in the original iteration space. The dependence distance in the original iteration space is determined by the distance in the dependence test iteration space and the property of index-association functions. For certain non-linear expressions, we show how to transform it to a set of linear expressions equivalently. The latter can be used in dependence test with traditional techniques. We also show how our advanced dependence analysis technique can help parallelize some otherwise hard-to-parallelize loops.

Abstract: Described herein are one or more implementations for facilitating the installation and/or maintenance of software products from a cached software-installation source. With at least one implementation, an installation-source manager loads installation-source components of an already-installed software product into an installation-source cache of a computer. The manager then enables the loaded installation-source components in the installation-source cache so that the computer is configured to acquire installation source components of the already-installed product from the loaded installation-source components in the installation-source cache. The manager does these things without re-installing the already-installed software product. With at least one implementation, an enterprise installation-source manager obtains installation-source components of a software product.

Abstract: A system and method may employ focused grammars to facilitate automated generation of computer programs. Such implementation of focused grammars enables a new form of symbolic regression referred to as generative programming or automated programming. The search through the space of possible programs may be guided by a streak search method in accordance with which identified candidate programs that improve on the current streak may be used to create focused grammars for directing an additional localized search. In some embodiments, candidate programs are generated by randomly traversing focused grammars from the starting rule, and subsequently through the grammars, until a complete candidate program parse tree has been constructed. Candidate programs may then be executed, for example, by an evaluator, which may employ an interpreter adapted for use in conjunction with a Stack Manipulation Language or other interpreted language.

Abstract: Methods of developing an application program to manage a distributed system or network are provided. In one embodiment, the method includes: a) defining managed objects in a resource definition language and storing the definition in resource definition language files, b) parsing the resource definition language files to ensure conformity with the resource definition language and creating an intermediate representation of the distributed system, c) processing the intermediate representation to form programming language classes, database definition files, and script files, d) developing a reusable asset center framework to facilitate development of the application program, the reusable asset center including an SNMP agent framework that provides SNMP interface functionality to the application program, and e) building the application program from the programming language classes, database definition files, script files, and the reusable asset framework.

Abstract: A scenario execution environment (SEE) may include one or more action layers. Each action layer may be associated with one or more SEE actions. Each SEE action may be associated with one or more action layers. SEE code may specify one or more SEE actions. The SEE code may be parsed for the SEE actions. Each SEE action may be dispatched to each associated action layer. The action layer interface may include a start scenario element, an end scenario element and a run action element. The start scenario element may inform the action layer that one or more scenarios of the scenario execution environment are commencing. The end scenario element may inform the action layer that one or more scenarios are concluding. The run action element may instruct the action layer to carry out one or more SEE actions associated with one or more scenarios.

Abstract: One embodiment of the present invention relates to disabling graphical code in a graphical program. A first portion of the graphical program may be disabled, which may include preventing the first portion of the graphical program from being compiled and/or preventing the first portion of the graphical program from being executed. Another embodiment of the invention relates to conditionally compiling graphical code in a graphical program. A first portion of the graphical program may be compiled if one or more associated conditions are true, or may not be compiled otherwise.

Abstract: A compiler that forms an intermediate representation of a program using a flow graph with less than all possible edges used to model asynchronous transfers within the program. The flow graph is formed in multiple phases. In one phase, the flow graph is formed without modeling asynchronous transfers. In later phases, representations of the effects of the asynchronous transfers are selectively added. As part of the later phases, edges modeling a possible asynchronous transfer are added to the flow graph following definitions in protected regions of variables that are live outside the protected region. A modified definition of live-ness of a variable is used to incorporate use of the variable in any region, including the protected region, following an asynchronous transfer. Edges from the protected region are also added to the model if the only use of the defined variable is in a handler.

Abstract: An object process graph (OPG) application development system. The system includes an OPG application program interface (API), an OPG application editor, an OPG application window editor, and an OPG application notation. The OPG API provides access to functions of an OPG system. The OPG application editor facilitates the creating and editing of the OPG applications via the OPG API. The OPG application window editor facilitates the editing of OPG application user interface windows while an OPG application is running. The OPG application notation includes a plurality of key words and associated definitions for describing and defining OPG applications.

Abstract: A method and system are provided for screening media segments received from at least one originator. The method includes receiving at least one media segment from an originator, providing the media segment to at least one screener, associating feedback from the at least one screener with the at least one segment, thereby obtaining associated feedback, and delivering the associated feedback regarding the at least one segment to the originator of the media segment. The feedback provided to the originator is input by a screener using a portable screening room. The system for screening media segments includes an interface enabling communication between the originator of the media segment and at least one screener screening the media segment and a portable screening room used by the at least one screener to associate feedback with the media segment that is then sent to the originator.

Abstract: Ambiguous stack references in low level software instructions can be resolved when raising a representation of low level software instructions, such as native code. The number of parameters passed to a function can be determined by heuristics, including direct call and indirect call heuristics. Indirect call heuristics can include dataflow-to-target-function, dataflow-to-target-type, import name, and cleanup instructions heuristics. A control flow heuristic can use an alternating direction propagation of seed points to determine the stack height at basic block boundaries. Interpolation can be used within the basic blocks as needed. The raised representation can be used for static analysis of the low level software instructions.

Abstract: According to program converting step S100 of the present invention, classes whose objects are created out of the classes included in a program are detected and the result is recorded in an analysis information storing section 12 at an object analyzing step S104, functions (unnecessary functions) regarding classes whose objects are not created are analyzed in accordance with information held in the analysis information storing section 12 and the result is recorded in the analysis information storing section 12 at an unnecessary function analyzing step S105, and definitions of the unnecessary functions are deleted in accordance with information held in the analysis information storing section 12 at an unnecessary function deleting step S106.

Abstract: A palette is displayed containing icons representing available system components for use in a solution. Associated with the icons are partially defined behavioral models, implementation logic, and user-modifiable parameters and options in a markup language format. Instances of the configurable behavioral models are instantiated through selection by a user. A design area of the display shows icons for the instances, where they are placed and arranged by the user, including connection logic and user-input model interface and behavioral logic parameters. The models are configured according to the parameters by modifying the associated markup language. A system solution behavioral model is automatically created in a modeling language comprising a collection of the interconnected and fully defined component behavioral model instances, allowing simulation of operation of the system solution.

Abstract: Disclosed herein is a data processing system-implemented method for investigating computer software. The data processing system-implemented method includes capturing tracing information at one or more boundary points of the computer software, and reproducing a behavior of the computer software at the boundary points based on the captured tracing information.

Abstract: A method of modifying an existing standard-based system can include automatically identifying at least one message of the standard-based system at runtime. A constraint can be associated with a selected message of the standard-based system at runtime. The constraint can be one that is not a specifiable option within the standard-based system. The method also can include intercepting the selected message and applying the constraint to the selected message.

Abstract: A Unified Debugger that enables the debugging of graphical models with combinations of entities from multiple domains such as time-based block diagrams, statecharts, and physical system models, with additional features for the debugging of hand-written and automatically generated code is disclosed. A view of the entity being executed that is consistent with the type of the modeling domain to which the entity currently being executed belongs is automatically generated for a user. Rather than requiring a user to manually transition from one debugger to the next, the Unified Debugger applies the appropriate debugging features from each modeling domain. The Unified Debugger also enables integration of diagnostic information from a multitude of modeling domains into a central user interface. In addition, a standard diagnostic interface which spans a plurality of modeling domains is defined that enables the customization of debug behavior.

Abstract: A user interface is provided that exposes items such as developer tasks, commands, property settings, and other related information to a user. The user interface may be invoked in a number of development interfaces such as, for example, a designer or an editor. The user interface may be either an object bound interface or an action triggered interface. An object bound interface exposes a set of items that are associated with a corresponding object. An action triggered interface exposes a set of items that are associated with a corresponding triggering action. In addition to enumerating developer tasks, the user interface may provide a direct link to other interfaces that facilitate task execution.

Abstract: Deployment of an application is managed using available resources from a resource system. A resource dependency characterization of the application is established to enable deployment of the application. A logical characterization and a network characterization of a desired deployment are also established. A deployment plan containing an outline for resources and configurations used for deployment is developed based on the resource dependency characterization, the logical characterization and the network characterization. The deployment plan is processed for correlation with the available resources. The processed deployment plan is then implemented.

Abstract: There is disclosed a method for flattening hierarchically structured flows using a breadth-first approach. At each level of hierarchy of a hierarchically structured source flow, complex nodes are flattened by one level across the entire breadth of the flow. The results of this flattening are placed in a target flow, and any connections that existed in the source flow are re-established in the target flow in such a way that any data input into the target flow will be processed as if it had been input into the source flow. After a processing iteration, if there are still complex nodes remaining in the target flow, the target flow becomes the next source flow, and the process is repeated until the flow has been completely flattened.

Abstract: Systems and methods for monitoring the performance of client-server transactions from the perspective of a client. In one embodiment, a JARTA (Java Application Response Time Analyzer) component (which may include JavaScript) is installed on an end user's browser to collect various response time measurements and certain client system information and transmit this information to a server. A JARTA utility on the web server can manage the actions (e.g., insert, modify, and delete) associated with web pages that are ear-marked for JARTA testing at the client browser. The JARTA component may include a Java™ applet that can be downloaded to a client computer along with a web page. In one embodiment, a certain percentage of web transactions to be monitored can be designated using, e.g., a sampling algorithm.

Abstract: A system and method for automatically identifying compound refactorings of program code through quantitative metric analysis is presented. Program code is maintained, including program statements written in accordance with a programming language and defining operations executed following transformation into machine code. Compound refactorings are built. The program code is refactored by evaluating one or more of the program statements against a compound refactoring including a set of one or more individual refactorings. The application of the refactorings to the program statements is validated for each evaluated refactoring. A quantitative measure is analyzed against a threshold to reflect a relative difference between the program statements prior to and after application of the refactorings.