Abstract: Reducing coherency problems in a data processing system is provided. Source code that is to be compiled is received and analyzed to identify at least one of a plurality of loops that contain a memory reference. A determination is made as to whether the memory reference is an access to a global memory that should be handled by a direct buffer. Responsive to an indication that the memory reference is an access to the global memory that should be handled by the direct buffer, the memory reference is marked for direct buffer transformation. The direct buffer transformation is then applied to the memory reference.

Abstract: In one general aspect, a computer-based software testing method is disclosed that includes presenting to a user an interactive visual user interface of an application under test that includes a plurality of user interface controls, with each of the presented user interface controls having a predefined native interaction mode. The method also includes intercepting normative pointing-device-based user interaction with each of a plurality of the user interface controls, with the normative pointing-device-based user interaction mode being different from the native interaction mode. Interface definitions are built for the application based on results of the steps of intercepting for the plurality of interface controls.

Abstract: Embodiments of the present invention provide computer program products, methods, and systems for extracting and revising data for a resource embedded in a dynamic-link library (DLL) assembly. In various embodiments, the DLL assembly is loaded and data for a resource is extracted from the assembly. In particular embodiments, a manifest is created that includes a path for the extracted data extracted. This path includes information on placing the data for the resource into the assembly to construct a necessary DLL structure compatible with the program application. After the extracted data has been edited to create replacement data, in various embodiments, the replacement data is imported into the assembly based on the path for the extracted data and the assembly is compiled to create a revised DLL that may be read by the program application in place of or in addition to the original DLL assembly to utilize the replacement data.

Abstract: A method apparatus and computer program product is disclosed for adding instrumentation to a body of code to enable generation of code coverage data for said body of code in which used instrumentation code is arranged to be optimized out by a compiler.

Abstract: Embodiments of the methods and apparatus for automatic cross language program code translation are provided. One or more characters of a source programming language code are tokenized to generate a list of tokens. Thereafter, the list of tokens is parsed to generate a grammatical data structure comprising one or more data nodes. The grammatical data structure may be an abstract syntax tree. The one or more data nodes of the grammatical data structure are processed to generate a document object model comprising one or more portable data nodes. Subsequently, the one or more portable data nodes in the document object model are analyzed to generate one or more characters of a target programming language code.

Abstract: A keyboard definition updating method for a computer system includes generating an updating scan code; storing the updating scan code into a storage device of the computer system; and accessing the updating scan code when the updating scan code stored in the storage device is detected and utilizing the updating scan code for the scan code of the computer system.

Abstract: A debugger can step through target code in a computer program. The debugger can identify a coroutine yield point in the target code, and can obtain identifying information to identify continued processing of a coroutine instance triggered by the operator. The debugger can set a breakpoint at a location for continued stepping after the coroutine yield point. The breakpoint can have a condition of matching the identifying information with runtime information. The debugger can perform the coroutine instance and resume execution of the target code after the coroutine yield point. The debugger can also encounter the breakpoint in the target code, and can determine whether the condition of the breakpoint is met. If so, the debugger can pause execution of the target code at the breakpoint. If not, the debugger can continue execution of the target code past the breakpoint without pausing at the breakpoint.

Abstract: In a distributed system that includes a debug server and debug clients coupled for data communications through a data communications network, where the debug server includes a debug administrator, a message router, a back-end debugger, and a debuggee, collaborative software debugging includes receiving, from the debug clients, application-level messages, including receiving, from a symbol locking debug client, a request to lock one or more symbols from value modification; routing, by the message router, the application-level messages among the debug clients, the debug administrator, and the back-end debugger, including: establishing a lock for each of the one or more symbols; and returning, to the debug clients, client-specific debug results including, returning, responsive to a request to modify a value of a locked symbol, an indication that the symbol is locked without modifying the value of the locked symbol as requested.

Abstract: A computer implemented program analysis method employing a set of new abstract domains applicable to non-convex invarients. The method analyzes programs statically using abstract interpretation while advantageously considering non-convex structures and in particular those situations in which an internal region of an unreachable state exists within a larger region of reachable states. The method employs a new set of non-convex domains (donut domains) based upon the notion of an outer convex region of reachable states (Domain D1) and an inner region of unreachable states (Domain D2) which advantageously permits capture of non-convex properties by using convex regions and operations.

Abstract: One embodiment of the present invention sets forth a method for generating one or more tests for testing a command provided by a command line interface. The command is specified in a pre-determined meta-language. The meta-language is then converted in the tokenized post-fix notation, which is processed to generate a direct acyclic graph (DAG) that represents the different permutations of the command. By traversing the DAG from a root node to a leaf node, a test can be generated. The test is then executed within the command line interface, and the result analyzed to determine whether the command line interface is operating correctly.

Abstract: The invention generally relates to enterprise computer applications, and more particularly to methods and tools for data-driven engineering of computer applications. A method of generating a business application includes: inputting requirement data into a requirement model; inputting platform data into a platform model; generating a design model based on the requirement model and the platform model; generating source code of the business application from the design model; and outputting the source code.

Abstract: Computer-implemented methods, apparatus, and products for embedding software developer comments in source code of computer programs that includes receiving, by a software development application from a software developer, a location in source code of a computer program at which to insert a multimedia annotation, the multimedia annotation including software developer comments; and inserting, at the location in the source code, by the software development application, a hyperlink including a URL specifying a storage location for the multimedia annotation.

Abstract: The subject matter disclosed herein relates to alter an expression of executable instructions via a compiler component for use in ranking of electronic documents.

Abstract: First tag addresses and data are stored in association with first index addresses in a memory cell unit provided in a cache memory. The first tag addresses and the first index addresses are configured based on address information respectively. Designation address information is provided to designate an address to read one of the stored data. The designation address information is converted to a second index address and second tag address by an address converter, in order to read the one of the stored data according to the designation address information. The memory cell unit is accessed according to the obtained second index address. When one of the first tag addresses matches the second tag address, the one of the data corresponding to the one of the first tag addresses is read. The designation address information and the one of the data are displayed in a cache memory display unit.

Abstract: Extensions or additional software programs that are requested by a computer application running on an application platform are handled in an efficient manner by, among other things, regulating and tracking extensions that are downloaded. This allows the size of the application platform upon which the application is running to remain relatively small so as to mitigate strain on resources when the platform is initially deployed over a network (e.g., the Internet), thus making it easier and more likely for a user to install the application platform (and/or updates thereto). Requested extensions are subsequently added to and/or removed from the (already deployed) application platform based on, among other things, download metrics.

Abstract: Provided is a system and method for production of a multi-user network game that may produce and debug a multi-user network game and simply construct a multi-user network game environment using a single game production tool to thereby reduce a game production time. A system for production of a multi-user network game being performed between a game server and a plurality of game clients via a network, may include: a game production module configured to produce and debug the multi-user network game and a multi-user network execution environment; and an emulation module configured to emulate an execution of the multi-user network game by constructing a virtual network execution environment that comprises at least one server virtual machine and at least one client virtual machine configured to execute the produced or debugged multi-user network game.

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 operations that are vectorizable. The vectorizable operations are examined to determine whether they should be executed at least in part in a vector atomic memory operation (AMO) functional unit attached to memory. If so, the compiled code includes vector AMO instructions.

Abstract: The invention addresses the objective of optimizing performance of a media data carrier interpreting device. This is achieved by a media data carrier interpreting device which comprises means for transforming a machine- interpretable instruction comprised in a media data carrier into a machine-executable code during media content presentation. Said media data carrier comprises a set of machine-interpretable instructions generated according to a method which comprises the steps of generating a first auxiliary set of instructions corresponding to a set of elements wherein the elements are conform with a template and compiling said first auxiliary instruction set. Then, said compiled first auxiliary instruction set is linked with a compiled second auxiliary instruction set corresponding to said template. This method removes the need for runtime parsing and therefore frees processing capacity for runtime transformation of the machine-interpretable instructions into machine-executable code.

Abstract: Mapping is performed between operations of an abstract asynchronous programming model and a concrete asynchronous programming model. In other words, differences between asynchronous programming models are bridged to enable interaction.

Abstract: In one embodiment, a method includes accessing a set of use cases of a software application and selecting, from the set of use cases, a subset of use cases that has a goodness-to-cost ratio that satisfies a predetermined requirement. Computing the goodness-to-cost ratio for the subset of use cases includes: for each use case from the subset of use cases, computing a second cost as a sum of the first costs associated with the user actions of the use case; computing a third cost as a sum of the second costs; for each user-interface component that is acted upon by at least one of the user actions of at least one of the use cases from the subset of use cases, computing a first goodness measure that indicates a level of user-action coverage that the subset of use cases provides on the user-interface component; computing a second goodness measure as a sum of the first goodness measures; and computing the goodness-to-cost ratio as a ratio between the second goodness measure and the third cost.