Abstract: A software transactional memory system is described which utilizes decomposed software transactional memory instructions as well as runtime optimizations to achieve efficient performance. The decomposed instructions allow a compiler with knowledge of the instruction semantics to perform optimizations unavailable on traditional software transactional memory systems. Additionally, high-level software transactional memory optimizations are performed such as code movement around procedure calls, addition of operations to provide strong atomicity, removal of unnecessary read-to-update upgrades, and removal of operations for newly-allocated objects. During execution, multi-use header words for objects are extended to provide for per-object housekeeping, as well as fast snapshots which illustrate changes to objects. Additionally, entries to software transactional memory logs are filtered using an associative table during execution, preventing needless writes to the logs.

Abstract: A computer-implemented method for verifying a target system includes defining a specification including properties applicable to the target system. Execution sequences of the target system are identified. A set of the execution sequences is grouped into an equivalence class characterized by a common control flow. A symbolic representation of the equivalence class is evaluated so as to verify a compliance of the set of the execution sequences with one or more of the properties.

Abstract: An apparatus and a method for creating a control code for a home network appliance according to resolution of a control device which can automatically create a control code for a home network appliance according to the resolution of the control device and can perform a testing of the device even in the case in which the home network appliance is not bound.

Abstract: A method for managing software of a terminal in a device management system is provided. The device management server identifies if the memory area required for downloading and installing software is ensured in the terminal when the device management server has the software to be downloaded to the terminal. Then, the device management server acquires at least one among a usage rate during a predetermined period of time, a last use time, and a total number of times of usage for each software installed in the terminal when the required memory area is not ensured in the terminal. Next, the device management server selects software to be removed based on the usage rate, the last use time, etc., and notifies the terminal of the selected removal-targeted software. Then, the terminal removes the removal-targeted software when the terminal receives a removal acceptance input of the removal-targeted software from the user, and notifies the device management server of a result of the removal.

Abstract: This disclosure provides a computing system and method to profile a program for finding potential optimization in heap usage by reducing lag and drag in lifetimes of heap memory blocks. The process consists of three steps. First, an instrumentation engine analyzes a given program, and inserts additional code at interesting locations to collect needed information. Second, when the instrumented program is executed on a set of test cases, runtime data is collected. Third, since this data could be relatively large for a complex and long running program, data is processed to present it to a user in useful ways so that the programmer can improve the heap utilization in the program.

Abstract: A method for rendering software resistant to reverse engineering. Replace at least one first constant (mathematical expression, etc.) in a computational expression with a second mixed mathematical and bitwise-Boolean expression, the first constant being simpler than the second expression and the second expression being based on the value or the variables found in the first constant (or expression).

Abstract: Provided is a method of pre-processing a conditional region. By analyzing and designating code lines according to the present invention, when a conditional region included in a pre-processing region of an arbitrary file is compiled, the compiling can be efficiently performed, and when the arbitrary file is executed, an execution result can be derived in a short time.

Abstract: The present invention provides a virtual Reusable Asset Specification (RAS) repository. A method in accordance with an embodiment of the present invention includes: providing RAS assets for each different lifecycle phase of a software asset; and linking the RAS assets together using RAS related-assets.

Abstract: A legacy application decommissioner provides developers a tool to decommission and migrate legacy application functionality in a phased approach. The decommissioner identifies core web services that invoke legacy applications through an accessibility layer that monitors operator interaction with the application. The decommissioner then defines, creates, and deploys a web service that provides control over the operation of the legacy application. As a result, the functionality of the legacy application may be migrated to a new platform and architecture and the legacy application decommissioned so that organizations may continue to realize a return on their significant investment in the creation of the legacy application.

Abstract: An operating status monitoring device detects execution of a machine instruction included in an execution module that is obtained by translating a source program into machine language, specifies a step in the source program corresponding to the detected machine instruction with reference to a definition list that stores correspondence between each step in the source program and a machine instruction in the execution module, updates a data table, which defines correspondence between a step position in the source program and the execution count of the step, by adding the execution count of the specified step in the data table, and outputs an operating status map in which execution count of each step can be visually recognized by arranging unit marks and by changing a displaying pattern of each unit mark in response to the execution count.

Abstract: A system, method, and computer-accessible medium are disclosed for identifying in-line synchronization instructions in binary program code. One or more executable segments of the binary program code may be scanned to identify one or more potential in-line synchronization instructions. For each potential in-line synchronization instruction, it may be determined whether neighboring potential instructions are valid instructions. For each potential in-line synchronization instruction, it may be determined that the potential in-line synchronization instruction is a valid in-line synchronization instruction if the neighboring potential instructions are valid instructions.

Abstract: The present invention provides a standardized way to incorporate any new or legacy application into a templatable solution by using Reusable Asset Specification (RAS) profile features. A method in accordance with an embodiment of the present invention includes: providing a default RAS profile for a templatable RAS asset corresponding to the application; and adding at least one extension to the default RAS profile, the at least one extension including a templatable implementation extension for implementing a templatable interface.

Abstract: A patch tool receives multiple patches, with each patch designed to fix a corresponding subset of a set of errors in a system. Some of the patches may require that the files from older patches be removed from the system. In an embodiment of the present invention, a developer of a patch is provided the flexibility to specify that a desired file from an older patch fixing a specific error, not be removed during deployment of a new patch designed to fix the same specific error. Rolling back later to the older version of the patch may be simplified by not removing the desired file.

Abstract: A tracer object for tracing a user or process in a data processing system is provided. An application receives a tracer key containing a request for information to be traced. The received tracer key is checked against all tracer keys that the application has stored. If a match between two tracer keys is found, the stored tracer key maps the tracer key containing the request to the stored tracer key's associated tracer object and applies the conditions and modifiers contained in the tracer key containing the request to the tracer object. The tracer object then gathers the required information as requested.

Abstract: An apparatus, program product and method utilize metadata collected for a lock in a computer program to determine an optimal lock acquisition strategy for the lock. The metadata is typically collected via profiling of the computer program to determine a wait characteristic for the lock in the particular runtime environment in which the computer program executes, and the metadata is used to select from among different lock access implementations to be used to attempt to acquire the lock, often enabling an optimum lock access implementation to be selected for a lock.

Abstract: Methods, systems, and computer program products for performing the method are provided. The method includes collecting specified events generated during a run-time operation of a designed computing process flow having a model that defines, at a service-oriented architecture level, which of several predefined computing services are used in the computing process flow and relationships among the predefined computing services that are used in the process flow. The method also includes generating, on a display device, a visual display that shows visual representations of all or a portion of the service-oriented architecture-level model for the computing process flow, and of the collected specified events and where, relative to the model, the collected specified events were generated.

Abstract: A computer-implemented method of handling localizable objects is provided. The method includes the step of obtaining an initial class containing localizable properties and non-localizable properties. The initial class is then transformed into a base-part class and a translation-part class. A localization tool for performing the transformation is also provided.

Abstract: A method and apparatus for use in compiling data for a program shader identifies within data representing control flow information an area operator definition instruction statement located outside the data dependent control flow structures. The method identifies within one of the data dependent branches at least one area operator use instruction statement that has the resultant of the area operator definition instruction statement as an operand. After identifying the area operator use instruction statement, the area operator definition instruction statement is placed within the data dependent branch.