Abstract: A system for efficiently verifying compliance with a memory consistency model includes a test module and an analysis module. The test module may coordinate an execution of a multithreaded test program on a test platform. If the test platform provides an indication of the order in which writes from multiple processing elements are performed at shared memory locations, the analysis module may use a first set of rules to verify that the results of the execution correspond to a valid ordering of events according to a memory consistency model. If the test platform does not provide an indication of write ordering, the analysis module may use a second set of rules to verify compliance with the memory consistency model.

Abstract: A system and method to support embedded complete controller specification through explicit controller overlays are provided. The system and method partitions the controller layer of the MVC into a plurality of controller overlays. For example, a macro controller overlay, micro controller overlay, and global controller overlay are established for specifying macro controller objects, micro controller objects and global controller objects. Editors are provided for each of the plurality of controller overlays. The combination of the micro control overlay, macro control overlay, and global control overlay results in a complete controller specification for an application.

Abstract: A method and system for developing a minimized install profile for installing a minimized operating environment. After installing an operating environment comprising a plurality of installation packages on a computer system, one or more applications are also installed. System changes are determined and used to identify components added by the installed applications. Additionally, installation packages are identified that are required by the installed applications and that correspond to elements of the operating environment referenced by the added components. A minimized installation profile is created for installing a minimized operating environment based upon a minimum profile template and including the identified installation packages.

Abstract: A method, apparatus and program storage device for determining an optimal number of tasks during reorganization of a database system with memory and processor constraints. The reorganization system identifies memory constraints, identifies processing capabilities and determines a number of reorganization processes and a combination of reorganization processes that provides a minimum reorganization time based upon the identified memory and processing constraints. The identified memory and processing capabilities identify a domain representing a set of rules applicable to the identified memory and processing capabilities. The set of rules of the identified domain are applied to determine an optimal number and combination of reorganization processes that minimizes a reorganization time.

Abstract: Techniques and tools relating to annotating program source code facilitate inferring annotations from source code based at least in part on a description (or specification) generated with a programmable tool. Described techniques and tools provide flexibility in annotation inference across different code bases and program states or properties of interest, and can reduce the overhead of adding annotations to “legacy” source code. For example, a specification is generated with a programmable specification tool that is separate from an inference engine. In the inference engine, one or more annotations for a computer program are inferred based at least in part on the specification.

Abstract: Compiler device for optimizing program which manipulates a character string includes append instruction detection unit, store code generation unit, and append code generation unit. The append instruction detection unit detects an append instruction which appends a character string to a string variable for storing a character string, in the program. The store code generation unit generates, a substitute for each of a plurality of the append instructions detected by the append instruction detection unit, a store code for storing data of an appendant character string to be appended to the string variable by the append instruction into a buffer. The append instructions append the character strings to the same string variable. The append code generation unit generates append code for appending a plurality of the appendant character strings to the string variable, at a position executed before an instruction to refer to the string variable in the program.

Abstract: A system for debugging targets using various techniques, some of which are particularly useful in a multithread environment. These techniques include implementing breakpoints using out-of-line instruction emulation so that an instruction replaced with a breakpoint instruction does not need to be returned to its original location for single-step execution, executing a debugger nub for each target as part of the target task but using a nub task thread for the nub execution that is separate from the target task threads, providing immunity from breakpoints for specified threads such as the nub thread via specialized breakpoint handlers used by those threads, and virtualizing the debugger nub such that a shared root nub provides a uniform interface between the debugger and the target while specialized nubs provide differing functionality based on the type of target being debugged.

Abstract: A method, apparatus, and program for translating source code programs from COBOL into an object-oriented language and then utilize an “object” that emulates the COBOL's Working-Storage Section. By emulating the Working-Storage Section in an object-oriented program, the object-oriented program source code can closely resemble the original COBOL source code as well as have a very clean syntax. This allows it to be kept in a highly maintainable and readable form after translation.

Abstract: A method for conditionally sharing dynamically compiled code between different class loaders is provided. In this method, bytecodes of a first class type are compiled into a compiled code if the bytecodes have not been compiled. The locations of sequence of instructions in the compiled code that are loader dependent are then recorded. Thereafter, the loader dependencies in the compiled code are compared to determine whether the compiled code can be used by a method of a second class type. If the loader dependencies of the second class type are different from the loader dependencies of the first class type, the compiled code for the method of the first class type is cloned. Subsequently, portions of the cloned code that are loader dependent are modified to enable the method of the second class type to use the cloned code.