Abstract: A system and method for controlling execution of an interpreted language. Statements of the interpreted language to be executed by a script engine are intercepted by a protection module and control is passed to a script helper module that is associated with the script engine. The script helper module establishes a secure communications channel with an authorization component and passes the statements and an authorization request to the authorization component. The authorization component sends a reply to the script helper module which either permits the script engine to execute the statement or cancels the attempted execution. When the script engine is loaded, a list is updated identifying the script engine. If a script helper module is not present for the loaded script engine, a boot-strap loader is called to load the script helper module. A special information block contains data as to the location of the interception points.

Abstract: During compilation of a user logic design in a first type of programmable logic device (e.g., an FPGA), a log is kept of at least certain steps where choices are made. When that logic design is migrated to another type of programmable logic device (e.g., a mask-programmable logic device) the logged steps are taken into account to make sure that the same choices are made, so that the target device is functionally equivalent to the original device.

Abstract: Embodiments of the invention provide a debugging tool configured to translate a pre-compiled binary shader as part of debugging a graphics application running on a remote device. An instrumented driver may capture and serialize each graphics API call invoked by a graphics application running on the remote device along with any pre-compiled binary shader programs supplied by the graphics application. The graphical application debugger may translate the shader program into a form appropriate for graphics hardware present on the host system. By replaying the same sequence of API calls invoked on the target device using the same shader programs, the graphical application debugger may generate and display the same image displayed on the target device without the latency of waiting for a full set of framebuffer data to be transmitted over the communication link for each frame rendered on the target device.

Abstract: A method, system and program product for transforming a source code in one language into one or more target modules in one or more languages is provided. The method includes selecting one or more target programming languages suitable for transforming each source module of a source code into one or more target modules written in one or more target programming languages. The method further includes parsing the source code and looking up for a source function in the source code an equivalent target function in a target programming language, such that execution of the equivalent target function in the target programming language is optimized. The method further includes writing out in the target programming language the equivalent target function corresponding to the source function, such that each source module is transformed into one or more target modules whose execution in the one or more target programming languages is optimized.

Abstract: A flexible, platform-independent integration infrastructure is provided. The integration infrastructure may include an integration bridge and at least one plug-in, where the at least one plug-in may include translation rules, mapping rules, and other information associated with a component coupled to the plug-in. The translation rules, mapping rules, and other information may be used by the integration bridge during a mapping process to control communication between components. Based on the rules and information, a mapping translator of the integration bridge converts data received from component into a form readable by another component.

Abstract: A method and apparatus for executing different Java methods are provided. The method of executing different Java methods, includes when a first method calls a second method, storing information for returning to the first method in a first stack frame, adding a second stack frame for the second method to a stack, and storing information for executing the second method in the second stack frame, wherein the first stack frame and the second stack frame are included in the same stack in a same format.

Abstract: Architecture-dependent assets are automatically built and retargeted. An asset originally built for one architecture is downloaded and automatically retargeted on another architecture. This automatically retargeting may be performed on demand, at runtime.

Abstract: One embodiment of the present invention can include a computer program product comprising one or more computer readable media storing a set of computer instructions that are executable by one or more computer processors, wherein the set of computer instructions comprise instructions executable to generate a command according to a generic command structure, forward the command to a remote computer, receive the command at the remote computer and translate the command to platform specific format.

Abstract: A user accessing a first web application can request to clone that application to form a second web application, where the first web application may be owned by another user. The cloning operation involves copying at least part of a directory for the first web application to a new directory for the second web application. For example, non-private content types, queries, and/or hard-coded images and strings can be copied from the parent directory to the clone directory. The clone web application is then rendered in accordance with the content in its directory.

Abstract: A system and program product for facilitating computing-environment control of a resource to be accessed by existing program code is provided which includes transparently replacing an uncontrolled resource referenced by existing program code with a resource controlled by a computing environment. The protocol also includes transparently interposing at least one resource management service of the computing environment between the existing program code and the resource controlled by the computing environment, wherein the at least one resource management service provides computing-environment control of the resource to be accessed by the existing program code. The replacing of the uncontrolled resource prevents the existing program code from directly accessing the resource.

Abstract: The invention concerns the analysis of software code that includes code that is written in multiple languages. In particular the invention concerns, but is not limited to, static analysis on source code of an embedded system that has source code that is written in a low-level language embedded within a high level language. The invention provides transforming 60 the embedded low level language source code to a common high level representation that the static analysis can be performed on. This transformation may only retain sufficient semantic meaning to cater for the static analysis, but now more, allowing the transformation to be made. Aspects of the invention include a method, a computer system and software.

Abstract: Disclosed herein are systems, methods, and computer-readable storage media for obfuscating by a common function. A system configured to practice the method identifies a set of functions in source code, generates a transformed set of functions by transforming each function of the set of functions to accept a uniform set of arguments and return a uniform type, and merges the transformed set of functions into a single recursive function. The single recursive function can allocate memory in the heap. The stack can contain a pointer to the allocated memory in the heap. The single recursive function can include instructions for creating and explicitly managing a virtual stack in the heap. The virtual stack can emulate what would happen to the real stack if one of the set of functions was called. The system can further compile the source code including the single recursive function.

Abstract: Methods and systems for maintaining instruction coherency in a translation-based computer system architecture are described. A translation coherence cache memory can be used to store a memory page reference that identifies a memory page. The cache memory also stores a permission bit corresponding to the memory page reference. The permission bit indicates whether the memory page comprises code that has been translated into another form.

Abstract: Techniques that facilitate development of applications that may be executed by a client program. The client program may be a modeling framework that may be hosted by a browser or other client-side program. A programming language (referred to as “GmlScript”) is provided for developing the applications. In one embodiment, the programming language provides various features such as object-oriented programming, client-side scripting, self-contained components, aspect-oriented programming, namespaces and self-contained components (kits), classes, methods, and properties, prototypes for multiple inheritance, events and listeners for implementing dynamics and constraints, transactions for ensuring model consistency and for undo/redo operations, objects persistency, dynamic loading, introspection, self documentation, preprocessing pragmas, and other features.

Abstract: Instructions in an asynchronous transactional messaging language are transformed into instructions that are compatible with the web services. In one embodiment, the asynchronous transactional messaging language is XLANG/s, and the web service languages are the web services description language (WSDL) and the simple object access protocol (SOAP). A programmer simply writes high level declarative statements that pertain to the specific type of business transaction. During compilation, selected instructions are transformed into instructions that are compatible with web services. This transformation is transparent to the designer of the business application. The asynchronous transactional messaging language source files are compiled in an iterative compilation process. During each pass of this compilation process, different variables are parsed. The parsed results are logically organized in a tree structure. The tree structure is traversed in depth first traversal order.

Abstract: A schema parser can be used in data binding to create a schema object model when given an XML schema. Java classes can be generated using the schema object model, which correspond to elements and types in the schema. Mapping can be done in each direction between the schema and Java classes, which can be written to a type mapping directory. The schema object model can also contain mappings between each Java class and an XSD type. The mappings in the type mapping directory can then be used to generate XML when given a Java object tree, and can be used to create and populate a Java class when given an XML instance matching the schema object model.

Abstract: A method, computer program and device for the translation of typed data objects in a heterogeneous computational environment is described. The operating system (or installed shared code libraries) translates typed data objects from a first format (e.g., big-endian) to a second format (e.g., little-endian) if the application sending the object and the application receiving the object utilize different formats. By placing data object format translation capabilities into the operating system, the software development effort required to permit an application (e.g., a user-level application) to execute in a heterogeneous environment is significantly reduced.

Abstract: Emulation systems and method involving invalidating blocks of translated code in emulation of a target system on a host system in are disclosed. One or more blocks of target system code are translated by the host system to produce one or more corresponding blocks of translated code. The host system uses one or more native target system instructions as hints to invalidate or potentially invalidate one or more blocks of translated code. Blocks containing such hints cause the host system to mark some or all of the one or more blocks of translated code as potentially invalid. The potentially invalid blocks may be re-translated immediately. Alternatively, the potentially invalid blocks may be checked to see if the code in these blocks has been modified. If the code has been modified, corresponding blocks of target code may be re-translated.

Abstract: A method for updating communications service parameters includes receiving, at a platform configured for speech recognition functionality and corresponding to a communications address associated with verbally updating communications service parameters, a voice instruction from a requester to update a communications service parameter. The voice instruction is translated into digital command data and the digital command data and the update to the communications service parameter are stored in a database. A change in a communications service corresponding to the update to the communications service parameter is implemented in near real-time.

Abstract: A computer-implemented method for evaluating software code includes measuring a first coverage of a test applied to the software code and then making a modification in a first section of the software code. A second coverage of the test applied to the software code is measured after making the modification. A difference is identified between the first coverage and the second coverage in a second section of the software code, which is separate from the first section and was not modified since the first coverage was measured, and an indication of the difference is output.

Abstract: A system and computer program product for national language support. National language support for an application is provided by recording translations of a text string in corresponding different languages in a single property file so as to allow display of the translations in the property file. One of the translations of the text string recorded in the property file is selected for use by an application based on a locale associated with the execution of the application and the selected one of the translations is used in the execution of the application.

Abstract: A method of receiving and translating data within an external programmatic interface (EPI) is described. The method calls for receiving input into the EPI. The input is traversed. Where the input is presented in a prescribed format other than CLI, it is translated into a corresponding CLI statement, with reference to a representation of the CLI syntax. Where the input is presented in CLI, it is translated into a corresponding prescribed output format, with reference to a model of the prescribed output format derived from the CLI syntax. The translated input is output.

Abstract: A method, computer program product, and data processing system for substituting a candidate instruction in application code being loaded during load time. Responsive to identifying the candidate instruction, a determination is made whether a hardware facility of the data processing system is present to execute the candidate instruction. If the hardware facility is absent from the data processing system, the candidate instruction is substituted with a second set of instructions.

Abstract: A logic design support system which supports logic design using an HDL includes: RTL analysis means for receiving, as input, an RTL including a dedicated comment as a comment statement specifying expansion of a generate statement, detecting the dedicated comment from the input RTL, and retrieving a generate statement to be expanded; logic expansion means for expanding the generate statement retrieved by the RTL analysis means; and RTL output means for merging a portion not retrieved by the RTL analysis means from the input RTL with a portion expanded by the logic expansion means, and generating and outputting output RTL.

Abstract: The present invention provides processor-implemented method and system of creating an assured execution environment for at least one computer program executable on a computer system. In an exemplary embodiment, the method and system include (1) converting the executable into a computer program targeted for the computer system, where the converting includes scrambling the executable by applying an encryption scheme to the executable and (2) executing the program on the computer system only if the program complies with a policy.

Abstract: A method for modeling requirements of a product includes defining an abstract use case for each feature of said product, hierarchically decomposing each abstract use case until concrete use cases are specified for each feature, depicting every actor who would use the product as communicating with a concrete use case through a boundary, and programmatically extracting requirements from the use case diagram. Programmatically extracting requirements further includes converting use case diagrams into directed acyclic graphs, where each use case corresponds to a node of a graph and each relationship between a pair of use cases is represented by a directed edge between the corresponding pair of nodes in the graph where a directed edge points from a parent node to a child node, converting the directed acyclic graph into a tree, and searching the tree to extract the requirements.

Abstract: Systems and methods for extracting an original source code for an application, the original source code including source code for a function, receiving source code for a new function, the source code being a same type as the original source code, the new function to replace the function in the application, determining information from one of the original source code and an execution of the application and transforming the source code for the new function into transformed source code based on the information determined from the original source code.

Abstract: A method, computer apparatus and computer program product for bytecode weaving is described herein. The method includes determining when a code module such as an OSGi bundle that requires bytecode weaving becomes available for loading into a system. Code associated with the code module is loaded. This code may be part of the module itself or part of a separate entity, such as an OSGI bundle fragment, but does not require weaving. Responsive to loading the code associated with the code module, a reference is received to the entity responsible for loading the code associated with the code module. A code entity (which does require weaving) within the code module is identified and a woven set of bytes are provided to the code loading entity identified via the returned reference. Consequently, the woven set of bytes represents a transformed version of the identified code entity.

Abstract: A method and an apparatus take software source code to synthesize a hardware platform for running the software. The method determines which processor is suitable for running the code and meeting the performance parameters determined by the user. The method also determines which hardware devices are accessed by software. If the hardware target is a semiconductor chip, the invention selects the appropriate IP and creates an HDL description of the chip. If the hardware target is a printed circuit board, the invention creates a schematic or netlist that includes the appropriate microprocessor, the various semiconductor chips, and the necessary interconnections.

Abstract: The present invention is directed to automatically analyzing software systems for identifying faults or bugs and/or detection of malicious code. In various embodiments, the present invention measures code coverage for high priority invocable program elements, uses a relaxed coverage estimation technique that, instead of guaranteeing which code units will be executed, guarantees that at least a certain number of code units will be executed, determines and solves constraints in code to identify infeasible paths containing one or more selected nodes, determines, for a composite data type, a range of values for each of at least two non-composite data fields, and/or translates, prior to code analysis complex code into simpler code having fewer operators.

Abstract: A system allows a non-virtual method of a base class inherited by a derived class to be effectively overridden so that code developed to access the method via the base class accesses the overriding behavior. The system replaces an instance of the derived class with a dynamic object and transparent object with the transparent object appearing to provide to invoking code an implementation of the derived class. Upon receiving an invocation of a method, the transparent proxy directs the invocation to the dynamic object by invoking an invoke method of the dynamic object passing an indication of the invoked method of the transparent object. The dynamic object may be an instance of a dynamic class that inherits a real class with a virtual invoke method. The dynamic class overrides the invoke method to provide overriding behavior.

Abstract: Computing responses to semantic queries. A method includes accessing a plurality of objects that represent source code for an input program. The source code is transformed into a plurality of immutable objects that are structured such that the immutable objects can be used to derive any response as defined by the semantic rules about the source code. A query is received from a requestor requesting a semantic characteristic of the input program. The semantic characteristic is calculated. The semantic characteristic is returned to the requestor. The semantic characteristic is cached in a cache. Information describing a dependency between the cached semantic characteristic and one or more of the objects in the plurality of objects is stored.

Abstract: A system for automatic software production including specification and automatic generation of user interfaces is disclosed. A graphical editor presents diagrams and textual interactive dialogs which are used to enter requirements data defining the desired structure and behaviour of an application program being designed. The requirements data is automatically converted to formal counterparts in a formal language to create a Formal Specification. The Formal Specification is stored in translation structures which are object in memory taking the form of classes which have methods to use the requirements data to articulate source code templates which become source code components in the final output code. A Presentation Model based in a pattern language is used to specify a Presentation Model) using elements of the pattern language as meta-model building blocks which are articulated with requirements data that defines the specifics of the desired user interface.

Abstract: In one embodiment of the invention a method comprising (1) receiving an unstructured binary code region that is single-threaded; (2) determining a slice criterion for the region; (3) determining a call edge, a return edge, and a fallthrough pseudo-edge for the region based on analysis of the region at a binary level; and (4) determining a context-sensitive slice based on the call edge, the return edge, the fallthrough pseudo-edge, and the slice criterion. Embodiments of the invention may include a program analysis technique that can be used to provide context-sensitive slicing of binary programs for slicing hot regions identified at runtime, with few underlying assumptions about the program from which the binary is derived. Also, in an embodiment a slicing method may include determining a context-insensitive slice, when a time limit is met, by determining the context-insensitive slice while treating call edges as a normal control flow edges.

Abstract: A message gateway apparatus is provided for use in a web service system to process a message containing a request for a destination web service application, in which the message includes a plurality of events within a structured document conforming to a web service protocol and each event of the plurality of events has a name and a content thereof.

Abstract: During program code conversion, such as in a dynamic binary translator, automatic code generation provides target code 21 executable by a target processor 13. Multiple instruction ports 610 disperse a group of instructions to functional units 620 of the processor 13. Disclosed is a mechanism of preparing an instruction group 606 using a plurality of pools 700 having a hierarchical structure 711-715. Each pool represents a different overlapping subset of the issue ports 610. Placing an instruction 600 into a particular pool 700 also reduces vacancies in any one or more subsidiary pools in the hierarchy. In a preferred embodiment, a counter value 702 is associated with each pool 700 to track vacancies. A valid instruction group 606 is formed by picking the placed instructions 600 from the pools 700. The instruction groups are generated accurately and automatically. Decoding errors and stalls are minimized or completely avoided.

Abstract: An arithmetic program conversion apparatus, an arithmetic program conversion program and an arithmetic program conversion method that can convert the floating-point arithmetic of an arithmetic program into a fixed-point arithmetic without degrading the accuracy.

Abstract: A method and system for exposing a version-independent interface to a computer resource. The interface system exposes a version-independent interface to a computer resource, such as a database or computer program. The interface system also provides a version-dependent interface to the computer resource that is typically not exposed. When the computer resource is modified, the version-dependent interface may be modified, but the version-independent interface might not be modified. When the version-dependent interface is modified, a mapping is generated (in some cases automatically) between the version-independent interface and the version-dependent interface. When an accessing computer program uses the version-independent interface to request services of the computer resource, the system uses the mapping to map the request to a request that is appropriate for the version-dependent interface.

Abstract: A method for testing a software program creates test data by simulating data exchange messages between a server and a client and stores test data in Comma Separated Value (CSV) files. Data repository files stored in the CSV format can be edited by common tools, like a spreadsheet program, and can be maintained easily. The test automation method provides a data capturer tool so that the data repository could be created based on any existing test environment. The test automation method converts data repository files and simulates messages in order to load data to a mobile infrastructure system and set up data fixtures. The test automation method could be integrated in a build process so that data repository and test cases are validated against any program changes periodically.

Abstract: The present invention provides a method and system for describing variable precision computations without needing explicit conversion functions in case operands have different formats or sizes of fields, having the capability to modify at run time the sizes of the fields of any variable precision data object, as well as having access to special condition signals associated to each object in which results are stored.

Abstract: A method and system for using external storage to amortize CPU cycle utilization, wherein translated instructions are stored in a storage medium and subsequently accessed on a subsequent execution of a non-native application in order to amortize CPU cycles used in generating the translated instructions.

Abstract: A program verification process begins by converting a language of the program from a first language into an intermediate language representation. The loops of the program are eliminated. The program is converted from the intermediate language representation into a passive form. Dominators for the passive form of the program are determined. A verification condition is generated from the passive form of the program. The verification condition is structured according to the computed dominators such that when a theorem prover identifies a potential error, portions of the passive form of the program irrelevant to the potential error are ignored.

Abstract: Managed application programming interfaces (APIs), schemas and procedures receives a managed API call from an application, and maps the managed API call to an unmanaged API call. Managed data types and managed data objects of the managed API call are mapped to corresponding unmanaged data types and data objects. A request resulting from the unmanaged API call is dispatched to and interpreted by an unmanaged programming language interpreter, which executes the request in an unmanaged programming language. An unmanaged response to the request is mapped to a corresponding managed response, which is provided to the managed application.

Abstract: The present invention, in an example embodiment, provides a special-purpose formal language and translator for the parallel processing of large databases in a distributed system. The special-purpose language has features of both a declarative programming language and a procedural programming language and supports the co-grouping of tables, each with an arbitrary alignment function, and the specification of procedural operations to be performed on the resulting co-groups. The language's translator translates a program in the language into optimized structured calls to an application programming interface for implementations of functionality related to the parallel processing of tasks over a distributed system. In an example embodiment, the application programming interface includes interfaces for MapReduce functionality, whose implementations are supplemented by the embodiment.

Abstract: A method and system for evaluating a call to a library function at compile time. A first call included in a program being compiled by a compiler is identified. The first call is a call to a library function included in a pre-defined list of library functions external to the program. The first call includes one or more arguments associated with one or more formal arguments of a library function in the pre-defined list. The identification of the first call includes searching the pre-defined list of library functions for the library function. The arguments are determined to be constants. A second call to the library function is constructed in an optimizer of the compiler. A result of the second call is statically computed in the optimizer by issuing the second call with the constants as arguments. During compile time, the first call is replaced with the result.

Abstract: An improved architecture for a program code conversion apparatus and method for generating intermediate representations for program code conversion. The program code conversion apparatus determines which types of IR nodes to generate in an intermediate representation (IR) of subject code (10) to be translated. Depending upon the particular subject and target computing environments involved in the conversion, the program code conversion apparatus utilizes either base nodes, complex nodes, polymorphic nodes, and architecture specific nodes, or some combination thereof, in generating the intermediate representation.

Abstract: A computer implemented technique framework, prototype tool and associated methods that provide a high degree of visibility and control over the in-field execution of software in a minimally intrusive manner wherein developer-defined correctness tests and validation logic are embedded into the sensor node itself, making in-field software testing autonomous without necessitating continuous developer participation.

Abstract: Embodiments of the invention can provide systems and methods for providing an embedded service-oriented user interface integration bus. According to one embodiment, a system can be provided having a memory for storing computer executable instructions and a processor in communication with the memory via a computer interface. The processor can be adapted to execute computer executable instructions for receiving a user interface service request from an application module associated with a first platform. The processor can also be adapted to transform the user interface service request from the application module to a user interface service request for a host platform. The processor can also be adapted to match the transformed user interface service request to a platform service on the host platform and to transform the platform service for the host platform into a platform service for the client.

Abstract: Methods and apparatus to provide a modular native method invocation (NMI) system are described herein. In an example method, first NMI information associated with a first NMI call from a first virtual machine is received and second NMI information associated with a second NMI call from a second virtual machine different from the first virtual machine is received. The first NMI information and the second NMI information is translated via an NMI adapter. To generate a native stub, the translated NMI information is provided to a modular NMI component.

Abstract: A command conversion interface between an image machine with a plurality of hard keys and an image requestor is disclosed. When the command conversion interface detects and determines the activation of a specific hard key of the image machine, digital image information from the image machine is provided for the image requestor through the command conversion interface to execute a designated task, which has not been built in the image machine. In the command conversion interface, the designated task is interpreted by a destination command script, and the destination command script is processed by a compiler along with the digital image information, then transmitted to the image requestor to execute the task. The relationship between the specific hard key and the designated task refers to a new correlation table of the command conversion interface.