Abstract: A method for assembling a plurality of software modules for executing at least one task is described. The method includes selecting at least one software module from a plurality of available software modules, the one or more software modules selected based on at least one task to be performed, if more than one software module is selected, then configuring the selected software modules to function together in a manner to perform the at least one task to be performed, and generating a cyber package including the at least one software module, the cyber package conforming to a pre-defined protocol.

Abstract: Using metamodels during context-sensitive analyses of reusable components of computer software applications, including identifying entry and exit paths into and from a reusable component within a metamodel of a computer application development environment, determining during a static analysis of a computer software application that navigation will proceeds along a path corresponding in the metamodel to such an entry or exit path, retaining, if an entry path, an identifier of an invoking node along the path within the computer software application, and, if an exit path, for each terminal node along each of a plurality of paths from the reusable component within the computer software application, comparing an identifier of an invoking node preceding the terminal node with the retained invoking node identifier, and determining, if the invoking node identifiers match, that the path among the plurality of paths is a correct path for a current context of the static analysis.

Abstract: A method and system for graphing JAVA bytecode. JAVA bytecode is analyzed to identify blocks of bytecode that are consecutively executed without being targeted by branching instructions. The links in the form of branching instructions or target based breaks are also identified. The blocks and links are then graphed to facilitate the review and debugging of the program. The graph can be optimized to improve the readability of the graph.

Abstract: A relational model may be used to encode primitives for each of a plurality of threads in a multi-core processor. The primitives may include tasks and parameters, such as buffers. The relationships may be linked to particular tasks. The tasks with the coding, which indicates the relationships, may then be used upon user selection to display a visualization of the functional relationships between tasks.

Abstract: A debugger allows a programmer to select the granularity of a line step function. Using a debugger step statement, the programmer can specify line step, statement step, or automatic selection. When the user specifies line step in the debugger statement, the debugger functions in true line step mode, where a line of source code is executed for each step. When the user specifies statement step in the debugger statement, the debugger functions in statement step mode, where a statement is executed for each step. When the user specifies automatic selection in the debugger statement, the program is analyzed, and a decision regarding whether to use line step or statement step is made based on the characteristics of the program and based on user-specified selection criteria. In this manner the function of the debugger when line stepping can vary according to the programmer's needs.

Abstract: A debugger allows a programmer to select the granularity of a line step function. Using a debugger step statement, the programmer can specify line step, statement step, or automatic selection. When the user specifies line step in the debugger statement, the debugger functions in true line step mode, where a line of source code is executed for each step. When the user specifies statement step in the debugger statement, the debugger functions in statement step mode, where a statement is executed for each step. When the user specifies automatic selection in the debugger statement, the program is analyzed, and a decision regarding whether to use line step or statement step is made based on the characteristics of the program and based on user-specified selection criteria. In this manner the function of the debugger when line stepping can vary according to the programmer's needs.

Abstract: A method, system and program product for guiding correction of semantic errors in code in an integrated development environment. The method includes inputting, using a code editor, code being developed by a developer in an integrated development environment, identifying, using one or more collaboration records located for a node in a syntax tree constructed for the code inputted, any semantic errors pertaining to use of a third-party library in the code inputted by the developer and, displaying one or more suggestions associated with the one or more collaboration records located to correct the any semantic errors identified for the node, wherein the developer can choose a suggestion of the one or more suggestions displayed to guide correction of the any semantic errors.

Abstract: Various embodiments provide per group verification techniques in which code may be verified against one or more rules on a group by group basis. In one or more embodiments relationships between portions of a module to be verified can be defined. By being aware of relationships between various code portions, various embodiments can divide a module into related groups and perform verification on the basis of the groups. Multiple groups can be derived based at least in part upon the relationships. Each group can then be verified separately for compliance with one or more rules. Verification results can be output for each of the groups.

Abstract: A system and associated method for asynchronous code testing in an Integrated Development Environment (IDE). The IDE has components of a source code editor, an impact analyzer, a test case launcher, a graphical user interface (GUI), and a database. All components run concurrently for asynchronous and real-time code editing. Upon modification of a code block of an input code, a test case is automatically generated and a launching priority is calculated based on the relationship between the modified code block and each code block affected by the modification. Generated test cases are automatically run by the test case launcher or manually selected by the user to produce a test run result.

Abstract: Application validation is performed based at least in part on object level hierarchy data associated with the application. An application is executed on a physical or emulated host device, and assembly code is generated for the executing application. The assembly code is analyzed to identify objects associated with the application, and to identify relationships between the objects. Based on the object and relationship data, an object level hierarchy is generated for the application. Validation of the application may be performed by comparing an object level hierarchy for a current version of the application to a previously generated hierarchy for a previous version of the application to identify differences between to the two hierarchies.

Abstract: A method of sampling instructions executing in a multi-threaded processor which includes selecting an instruction for sampling, storing information relating to the instruction, determining whether the instruction includes an event of interest, and reporting the instruction if the instruction includes an event of interest on a per-thread basis. The event of interest includes information relating to a thread to which the instruction is bound.

Abstract: An exemplary method includes providing an application that includes client-side code and server-side code, instrumenting the client-side code and the server-side code to generate timestamps, distributing the instrumented client-side code and the instrumented server-side code and monitoring timestamps generated during execution of the application. In such a method, where timestamps generated by the client-side code and timestamps generated by the server-side code occur along a common timeline, a developer can monitor performance of the distributed application. Other exemplary methods, systems, etc., are also disclosed.

Abstract: In one embodiment, a computer program product for injecting error code includes a computer readable storage medium having computer readable program code embodied therewith. The computer readable program code includes computer readable program code configured to determine critical points in executing code of software under test, computer readable program code configured to determine an appropriate response action for each critical point based on an error encountered at each critical point, computer readable program code configured to inject a critical point segment into the executing code at a corresponding critical point, and computer readable program code configured to output a unique identifier of each critical point segment. In another embodiment, a system includes a processor, and a computer readable storage medium having computer readable program code embodied therewith having the above described functionality. Other systems and computer program products are described according to more embodiments.

Abstract: Method for providing programming support to a debugger are disclosed. The method includes defining at least one debugger programming statement, and instructing the debugger to execute the at least one debugger programming statement which modifies a least a portion of the computer program during execution of the computer program without recompiling the computer program. The debugger may be instructed to execute the at least one debugger programming statement at a specified position of the computer program. The at least one debugger programming statement may include a delete instruction that instructs the debugger to prevent one or more programming statements at a specified position in the computer program from being executed. The debugger may be instructed to execute the at least one debugger programming statement instead of one or more programming statements at a specified position in the computer program without recompiling the computer program.

Abstract: A method, system and program product for optimizing emulation of a suspected malware. The method includes identifying, using an emulation optimizer tool, whether an instruction in a suspected malware being emulated by an emulation engine in a virtual environment signifies a long loop and, if so, generating a first hash for the loop. Further, the method includes ascertaining whether the first hash generated matches any long loop entries in a storage and, if so calculating a second hash for the long loop. Furthermore, the method includes inspecting any long loop entries ascertained to find an entry having a respective second hash matching the second hash calculated. If an entry matching the second hash calculated is found, the method further includes updating one or more states of the emulation engine, such that, execution of the long loop of the suspected malware is skipped, which optimizes emulation of the suspected malware.

Abstract: A system and method for partial object dematerialization within a virtual machine (VM), and particularly Java Virtual Machines. In accordance with an embodiment, the system allows for applying partial object dematerialization to situations where the object is either created locally, or is retrieved from external code where it might have already escaped. In accordance with an embodiment, the system comprises a computer; a virtual machine for executing a software application; memory space for the application byte code and the generated machine code; and a compiler with an object dematerializer, and dematerializer injector. Runtime partial object dematerialization code is injected into the intermediate code representation in such a way that additional or standard optimizer techniques can be applied to it.

Abstract: There is provided a system, method and computer program product for integrating at least one analytical or modeling driver into an existing business analytic environment. The system comprises a BAMS (Business Analytics and Mathematical Sciences) driver, implemented on the memory device and run by the processor, loads a real database driver and redirects a request from a client application to the real database driver. An extension driver, invoked by the BAMS driver, provides an interface to a data modeling or processing software and converts the interface from a software environment compiled by a programming language to another software environment targeted to another programming language. The extension driver extends or overrides functionalities of the BAMS driver. Implementing the BAMS driver and the extension driver in the existing business analytic environment do not require any change made on the existing business analytic environment.

Abstract: A system, method and computer program product for integrating at least one analytical or modeling driver into an existing business analytic environment. The system comprises a BAMS (Business Analytics and Mathematical Sciences) driver, implemented on the memory device and run by the processor, loads a real database driver and redirects a request from a client application to the real database driver. An extension driver, invoked by the BAMS driver, provides an interface to a data modeling or processing software and converts the interface from a software environment compiled by a programming language to another software environment targeted to another programming language. The extension driver extends or overrides functionalities of the BAMS driver. Implementing the BAMS driver and the extension driver in the existing business analytic environment do not require any change made on the existing business analytic environment.

Abstract: In modern multi-threaded environments, threads often work cooperatively toward providing collective or aggregate throughput for an application as a whole. Optimizing in the small for “thread local” common path latency is often but not always the best approach for a concurrent system composed of multiple cooperating threads. Some embodiments provide a technique for augmenting traditional code emission with thread-aware policies and optimization strategies for a multi-threaded application. During operation, the system obtains information about resource contention between executing threads of the multi-threaded application. The system analyzes the resource contention information to identify regions of the code to be optimized. The system recompiles these identified regions to produce optimized code, which is then stored for subsequent execution.

Abstract: A method for a discrete event simulation model of a system utilizing a just-in-time compilation for one or more code blocks associated with an event in one or more discrete event simulation models is disclosed. The method comprises the steps of determining the event in a discrete event simulation model, retrieving the code block associated with the event, compiling the code block into an object file using a compiler, linking the object file with a predetermined function in a simulation library, compiling the object file and the predetermined function into a customized dynamic link library, loading the customized dynamic link library (DLL) within a discrete event simulation program execution and linking the customized DLL to a simulation program. The method allows user entered logic to be executed in high speed by integrating a just-in-time compiler embedded into the discrete event simulation model to allow dynamic generation of high speed code blocks within one or more simulations.

Abstract: A method and an apparatus for dynamically generating a machine code is provided, including: sequentially storing generated instructions in a first buffer; sequentially storing data in a second buffer, when the generated instructions reference data; and flushing the first buffer and the second buffer to executable code when a distance between an instruction referencing the data and the data has reached a limit of an offset range of the data-referencing instruction.

Abstract: A system and method of compiling program code, wherein the program code includes an operation on an array of data elements stored in memory of a computer system. The program code is scanned for an equation which operates on data of lengths other than the limited number of vector supported data lengths. The equation is then replaced with vectorized machine executable code, wherein the machine executable code comprises a nested loop and wherein the nested loop comprises an exterior loop and a virtual interior loop. The exterior loop decomposes the equation into a plurality of loops of length N, wherein N is an integer greater than one. The virtual interior loop executes vector operations corresponding to the N length loop to form a result vector of length N, wherein the virtual interior loop includes one or more vector atomic memory operation (AMO) instructions, used to resolve false conflicts.

Abstract: Delayed insertion of safepoint related code is disclosed. Optimization processing is performed with respect to an intermediate representation of a source code. The optimized intermediate representation is analyzed programmatically to identify a safepoint and insert safepoint related code associated with the safepoint. In some embodiments, analyzing the optimized intermediate representation programmatically comprises determining where to place the safepoint within a program structure of the source code as reflected in the intermediate representation.

Abstract: A function may be memoized when a side effect is a read only side effect. Provided that the read only side effect does not mutate a memory object, the side effect may be considered as an input to a function for purity and memoization analysis. When a read only side effect may be encountered during memoization analysis, the read only side effect may be treated as an input to a function for memoization analysis. In some cases, such side effects may enable an impure function to behave as a pure function for the purposes of memoization.

Abstract: A control flow graph may be generated from a model. The control flow graph may be restructured by converting at least one cyclical unstructured region of a control flow graph into a structured region. The restructuring may involve introducing loop head and/or bottom nodes, serving as incident nodes for loop entry or exit, correspondingly. Loop back-edges may be re-routed to loop entry nodes, while all exit nodes may be re-rerouted to loop exit nodes, as long as the control flow within the loop is properly directed using control flow constructs.

Abstract: A computer-implemented method, system, and computer program product for performing object collocation on a computer system are provided. The method includes analyzing a sequence of computer instructions for object allocations and uses of the allocated objects. The method further includes creating an allocation interference graph of object allocation nodes with edges indicating pairs of allocations to be omitted from collocation. The method also includes coloring the allocation interference graph such that adjacent nodes are assigned different colors, and creating an object allocation at a program point prior to allocations of a selected color from the allocation interference graph. The method additionally includes storing an address associated with the created object allocation in a collocation pointer, and replacing a use of each allocation of the selected color with a use of the collocation pointer to collocate multiple objects.

Abstract: A method of memory disambiguation hardware to support software binary translation is provided. This method includes unrolling a set of instructions to be executed within a processor, the set of instructions having a number of memory operations. An original relative order of memory operations is determined. Then, possible reordering problems are detected and identified in software. The reordering problem being when a first memory operation has been reordered prior to and aliases to a second memory operation with respect to the original order of memory operations. The reordering problem is addressed and a relative order of memory operations to the processor is communicated.

Abstract: A method of generating a computer program, the method comprising: independently compiling a plurality of source code modules to generate a plurality of respective object modules comprising a plurality of respective threads explicitly designated by a user to be executed in parallel; in each of the object modules, inserting at least one symbol indicative of a property of the object module's thread potentially conflicting with a corresponding property of a thread of another of said object module as a result of parallel execution of those threads; executing a linker to perform a linking process on said object modules, the linking process comprising: assessing the symbols in conjunction with one another to determine whether a conflict exists between the threads of two or more of the respective object modules; and linking the object modules to generate a computer program in which said threads are executable in parallel, wherein the linking is performed in dependence on said assessment.

Abstract: A non-volatile storage device and consumer product are provided which co-operate to upgrade the software in the consumer product where the consumer product stores predetermined information regarding the consumer product on the storage device. The storage device is transferred to a computer product connected to the Internet. The predetermined information is used to acquire upgrade software from a remote server automatically without the user requiring detailed knowledge of the consumer product. The upgrade software is stored on the storage device, which is then transferred back to the consumer product. The consumer product upgrades the software using the upgrade software.

Abstract: A technique for facilitating customization of a software application is described. During this customization technique, an indicator, which indicates that a software application for an electronic device has been discovered by a user, is provided to a publisher of the software application. In response to the indicator, the publisher provides a token to the user. This token identifies a customized application-delivery service for the software application and/or a user-specific customization of the software application. Note that the customized application-delivery service and the user-specific customization are based on information about the user associated with the user's pre-existing or just-established relationship with the publisher. Next, the token is provided to an application-delivery service, and the application-delivery service provides the customized software application to the electronic device or a computer, for example, using the customized application-delivery service.

Abstract: Methods, systems and devices for remotely updating software installed on a digital signal processor (DSP) without setting the mode select pins on the DSP control card. Firmware configured to suspend operations upon receiving a programming signal is installed on the processor. A controlling computing device send the programming signal, causing the processor to halt execution, erase portions of the firmware, set an update firmware flag, and send control signals to the controlling computing device. The remote computing device sends updated firmware and an application program cyclic redundancy check to the processor. The processor compares a cyclic redundancy check of an on-chip flash memory with the received application program cyclic redundancy check. If the two match, the processor installs the received firmware, unsets the update firmware flag, and restarts itself.

Abstract: The disclosure is for run-time accessing a software component is provided, together with a computer system embodying the same, and a software utility directing the method. Initially a software component is loaded and analyzed to identify one or more features thereof, which features are checked against a database. Following the check, the component is classified as one of at least first, second, and third component types. A first component type is run without amendment. A second component type is replaced by a component of equivalent functionality prior to running. A third component type is blocked from running.

Abstract: A portable terminal includes: a storage unit for storing at least a first program and software converting data to convert the first program into a second program; a storage control unit to perform reading and writing of the program and data as to the storage unit; a software converting processing unit to execute processing that converts the first program into the second program, using the first program and software converting data read by the storage control unit from the storage unit; and a terminal starting control unit to execute at the time of terminal startup one or the other of starting up the first program, and starting up the converting processing from the first program to the second program by the program converting processing unit and the second program that has been converted.

Abstract: A non-disruptive upgrade (NDU) technique involves installing and activating a first copy of a new version of an application in a temporary directory to (i) obtain control from an original version of the application while the original version is installed in an application directory and (ii) shut down the original version. The technique further involves, after the first copy of the new version obtains control from the original version and the original version is shut down, installing and activating a second copy of the new version of the application in the application directory to (i) obtain control from the first copy of the new version while the first copy of the new version is installed in the temporary directory and (ii) shut down the first copy of the new version. Such operation maintains the continuity of work at each phase of the NDU technique.

Abstract: Systems and methods for implementing data concentrated initiated multicast firmware upgrade in power line communications (PLC) are described. In an illustrative embodiment, a method performed by a PLC device may include forming a group of PLC devices to receive a transmission of a data set, the group being organized according to a hierarchical structure, transmitting the data set to the group of PLC devices, determining whether a PLC device in the lowest level of the hierarchical structure is missing one or more portions of the data set, and retransmitting at least the missing portions of the data set until the lowest level of PLC devices each have the full data set.

Abstract: A message is received at a message consumer, the received message having a component dependency identification that indicates a version of a software component that is necessary to process the message. The version of the software component is automatically downloaded if the message consumer does not already include the version of the software component. The version of the software component is then used to process the received message.

Abstract: A method characterized by association of object elements to operational modes is adapted for use during installation or runtime of a software package. In an example embodiment, the software package includes objects and object behaviors, wherein a particular object has at least two different object behaviors associated with the particular object, and wherein different object behaviors are each associated with a different operational mode. The example method includes accepting a signal from a user input device to specify an operational mode in a target system for the software package and determining an object behavior that is associated with the specified operational mode. In one implementation, the determined behavior is installed in the target system while at least one other object behavior that is not associated with the specified operational mode is not installed in the target system.

Abstract: Configuration items for a software application can be automatically and/or manually discovered, and the application can be packaged to form a virtual application package. A deployment configuration can include settings for the configuration items. The deployment configuration can be set after packaging the software application. For example, a selected configuration item in the deployment configuration may be changed in response to user input. The virtual application package can be deployed to instantiate the application one or more times, and the deployment configuration can be applied in the instantiated application.

Abstract: A virtualization system is described herein that facilitates communication between a virtualized application and a host operating system to allow the application to correctly access resources referenced by the application. When the operating system creates a virtualized application process, the virtualization system annotates a data structure associated with the process with an identifier that identifies the virtualized application environment associated with the process. When operating system components make requests on behalf of the originating virtual process, a virtualization driver checks the data structure associated with the process to determine that the helper process is doing work on behalf of the virtualized application process. Upon discovering that the thread is doing virtual process work, the virtualization driver directs the helper process's thread to the virtual application's resources, allowing the helper process to accomplish the requested work with the correct data.

Abstract: Technologies are described herein for regulating memory bandwidth usage in virtual machines via CPU scheduling. A virtual machine monitor (“VMM”) executing on a host computer detects excessive memory bandwidth usage by programs executing in a virtual machine on a processor of the host computer. The VMM may detect excessive memory bandwidth usage by monitoring cache-misses occurring in the processor, for example. Upon detecting excessive memory bandwidth usage, the VMM penalizes the virtual machine currently executing on the processor through the CPU-scheduling algorithm utilized to allocate processor time among the virtual machines.

Abstract: A virtual system on chip (VSoC) is an implementation of a machine that allows for sharing of underlying physical machine resources between different virtual systems. A method or corresponding apparatus of the present invention relates to a device that includes a plurality of virtual systems on chip and a configuring unit. The configuring unit is arranged to configure resources on the device for the plurality of virtual systems on chip as a function of an identification tag assigned to each virtual system on chip.

Abstract: Systems and methods for reliably migrating a virtual machine (VM) are provided. The method comprises receiving overhead and reliability factors for hosts in a hosting fabric; determining a plurality of viable migration paths for migrating a source VM from a source host to a target host in the hosting fabric, wherein the migration is accomplished through a series of migration phases, wherein a phase involves migration of the source VM from one host to another host in a migration path; determining total overhead costs associated with each migration path; and selecting a migration path from among said plurality of migration paths according to the overhead costs and reliability factors, wherein the reliability of the migration over the selected path is monitored and controlled by dynamically allocating and de-allocating one or more replicas of the source VM on one or more hosts in the migration fabric.

Abstract: An in-memory database management system (DBMS) in a virtual machine (VM) preserves the durability property of the ACID model for database management without significantly slowing performance due to accesses to disk. Input data relating to a database transaction is recorded into a replay log and forwarded to the VM for processing by the DBMS. An indication of a start of processing by the DBMS of the database transaction is received after receipt of the input data by the VM and an indication of completion of processing of the database transaction by the DBMS is subsequently received, upon which outgoing output data received from the VM subsequent to the receipt of the completion indication is delayed. The delayed outgoing output data is ultimately released upon a confirmation that all input data received prior to the receipt of the start indication has been successfully stored into the replay log, thereby preserving durability for the database transaction.

Abstract: A method of monitoring a virtual computer system including a network device coupled to a client computer, sever computers each coupled to the network device, and a performance degradation source locator apparatus coupled to the network device and the server computer, obtaining, by the performance degradation source locator apparatus, performance information on physical computer resources and performance information on virtual computer resources of extracted virtual machines and server computers and the virtual machine and the server computer in which the latency has increased to locate a part in which the latency has increased.

Abstract: According to one embodiment of the present disclosure, a method includes receiving a request to instantiate a virtual machine image in a virtualization environment. The method also includes sending a request for verification of the virtualization environment. The method further includes receiving information from the enforcement module in response to the request for verification of the virtualization environment. The method further includes determining whether the virtualization environment is verified based on the information received.

Abstract: A system, method and a computer-readable medium for processing resources on a multithreaded browser. The browser includes a main thread and receives a resource. The browser initializes the main thread, the main thread includes an event loop and initializes a plurality of virtual machines, one virtual machine for each code segment within the resource. Each virtual machine includes a UI thread and is configured to share the main thread within the browser with the UI thread. Each UI thread is further configured to execute an event scheduled on the event loop on the virtual machine.

Abstract: High level characteristics are extracted from a virtual machine provisioning request stream for a cloud computing environment. A plurality of prediction models are generated for a plurality of different types of virtual machines. A regression-correlation ensemble is applied to appropriate ones of the prediction models to predict future virtual machine demand for the cloud computing environment.

Abstract: A method of managing host physical memory using a balloon application executing within a guest virtual machine (GVM) running on a host platform is described. The balloon application receives allocation parameters from an entity outside the GVM, the allocation parameters identifying an amount of memory for the balloon application to allocate. The balloon application adjusts the allocated amount of memory according to the allocated amount. Physical memory backing up the allocated memory can then be assigned by virtualization software for use by another virtual machine running on the host platform.

Abstract: Instruction set architectures for compute-centric object stores. An exemplary method may include receiving a request from a user, the request identifying parameters of a compute operation that is to be executed against one or more objects in a distributed object store, generating a set of tasks from the request that comprise instructions for a daemon, locating the one or more objects within the distributed object store, the one or more objects being stored on a physical node. The method includes providing the set of tasks to a daemon, the daemon controlling execution of the compute operation by a virtual operating system container based upon the set of tasks, and storing an output of the virtual operating system container in the distributed object store.

Abstract: Monitoring a task queue in real-time is disclosed. A request is received for task queue information regarding the task queue. The task queue is queried in real-time to obtain the requested task queue information. The obtained task queue information is provided.