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 source code clarification system is described. In various embodiments, the source code clarification system receives clarified source code and transforms the clarified source code into standard source code or object code that implements asynchronous components. The standard software source code can contain expressions for enabling asynchronous communications. The clarified code can be software source code that is expressed in an imperative language and is capable of static analysis. The clarified source code can contain a coordination primitive that encapsulates interactions between asynchronous components. By using the coordination primitives and events, the clarified source code can express interactions between asynchronous components so that the clarified source code is easier for developers to understand and for static analysis tools to analyze.

Abstract: Software, methods and devices for executing textually-defined instructions at a wireless communication device are disclosed. The instructions may be for performing a mathematical operation upon specified integer or floating-point operands, for performing one or more specified actions for each pass through a loop, for performing one of two sets of actions based on a user selection of one of two user interface controls, or for triggering a timer for delaying a subsequent action by a specified time interval. The instructions may be defined in a markup language such as Extensible Markup Language (XML). The software, methods and devices may form part of a system for allowing varied wireless communication devices to interact with server-side software applications.

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 computer implemented method of delegating activities in a service oriented architecture of distributed computing systems. An activity specification is defined. The activity specification contains a set of service invocations. The activity specification is transformed into continuation passing style to form an activity. The activity is then executed using an activity execution engine.

Abstract: In one embodiment, after translating a plurality of target instructions from a target memory location into a plurality of host instructions, a write operation to a target memory portion which includes said target memory location is detected. In response to the detecting, a copy of the target instructions is stored in a host memory. In response to an attempt to execute the host instructions, the copy is compared with a plurality of current target instructions presently stored in the target memory location. Further, in response to a mismatch based on the comparison, the host instructions are disabled.

Abstract: Systems and methods are provided for an extensive content build pipeline. The exemplary content build pipeline is based on a code build process using a standard XIF file format containing reference to game content produced using various game content editors and tools. This standardized file format is capable of containing the information required by the content build as metadata, thus enabling a standard content build pipeline. This is opposed to being based on a number of game-specific formats and thus requiring the use of exporters. However, game engine developers can then optimize the XIF files to their particular game engine format.

Abstract: A system and method of discovering one or more program variable values may extract an abstract interpretation of a program variable used in a computer program, locate installation-specific repositories associated with the computer program, parse the located installation-specific repositories and extract one or more configuration parameters, and substitute the one or more configuration parameters into the extracted abstract interpretation.

Abstract: A computer implemented method, apparatus, and computer program product for filtering source code are described. A code filtering compiler identifies an entry for a named entity in a symbol table. When a flag for the named entity in the symbol table indicates the named entity is referenced in source code, the code filtering compiler retrieves coordinates from the entry for the named entity in the symbol table. The coordinates identify a location of a definition associated with the named entity in the source code. The definition for the named entity located at the coordinates from the source code is copied into a filtered source listing. The filtered source listing includes a set of definitions from a set of header files associated with named entities that are referenced in the source code. Definitions associated with entities that are unreferenced in the source code are absent from the filtered source listing.

Abstract: Methods and systems for automating technology integrations are presented. A source application system that connects to external technologies, such as plug-ins, is ported from one computing environment or ecosystem to another and thereby integrated on the other ecosystem. The porting is facilitated by the extraction of information and code from the source environment, creating an XML “ecoprint” payload file, copying the ecoprint file to the target system, and applying an integration defined by the XML ecoprint payload file to connect and otherwise integrate the application system with external technologies in the target environment.

Abstract: A method is disclosed of associating a mapping function with a configuration construct of a digital design defined by one or more hardware description language (HDL) files. According to the method, in the HDL files, a configuration latch is specified within a design entity forming at least a portion of the digital design. In addition, a Dial is specified that defines a relationship between each of a plurality of input values and a respective one of a plurality of different output values. The HDL files also include a statement that instantiates an instance of the Dial in association with the configuration latch such that a one-to-one correspondence exists between a value contained within the configuration latch and an input value of the instance of the Dial. The HDL files further include a statement associating the Dial with a mapping function that applies a selected transformation to values read from or written to the instance of the Dial.

Abstract: The present invention relates to a data processing system including a first file converter converting a set of file formats into an extended markup language format, a software development tool, and a workflow processing system. The software development tool includes a second file converter for rendering the extended markup language format into a unified modeling language graphic, a renderer for rendering a unified modeling language format converted file, a modifier for graphic modification of the rendered file, a third file converter converting the unified modeling language format to the extended markup language format, and means for deploying an extended markup language format converted file to the workflow processing system. The present invention enables to provide a meta workflow system that can be implemented on the level of existing workflow systems by integration.

Abstract: A method includes combining functionality from a matrix language programming environment, a statechart programming environment and a block diagram programming environment into an integrated programming environment. The method can also include generating computer instructions from the integrated programming environment in a single user action. The integrated programming environment can support fixed-point arithmetic.

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: Described herein is a method that produces fully (mathematically) tractable development of policies for autonomic systems from requirements through to code generation. This method is illustrated through an example showing how user formulated policies can be translated into a formal mode which can then be converted to code. The requirements-based programming method described provides faster, higher quality development and maintenance of autonomic systems based on user formulation of policies. Further, the systems, methods and apparatus described herein provide a way of analyzing policies for autonomic systems and facilities the generation of provably correct implementations automatically, which in turn provides reduced development time, reduced testing requirements, guarantees of correctness of the implementation with respect to the policies specified at the outset, and provides a higher degree of confidence that the policies are both complete and reasonable.

Abstract: Disclosed is a computer program product for managing granularity of a computing infrastructure, wherein the program, when executed on a computer, causes the computer to: identify at least one set of service functions suited to characterization by one or more sets of metrics; create a representation of at least one supplied functionality for the set of service functions for input to a formal process; characterize at least one rule and at least one constraint for input to the formal process; determine at least one set of metrics for evaluating the service functions; quantify benefits associated with at least one of the sets of service functions using the set of metrics; and provide one or more of the sets of service functions as output, wherein the output is based on the metrics determining the output by use of the formal process. Systems and infrastructure are also disclosed.

Abstract: A method for modeling a component of an information processing application, includes: defining an applicability condition of a component, wherein the applicability conditions includes variables representing objects that must be included in a pre-inclusion state and a graph pattern that semantically describes the objects that must be included in the pre-inclusion state, wherein the pre-inclusion state is a state against which the applicability of the component for inclusion in a processing graph is evaluated; and defining an inclusion effect of the component, wherein the inclusion effect includes variables representing objects that must be included in a post-inclusion state and a graph pattern that semantically describes the objects that must be in the post-inclusion state, wherein the post-inclusion state is a state resulting from inclusion of the component in the processing graph.

Abstract: A method for efficiently stress testing a service oriented architecture based application. A business process flow is recorded between a client and a server. When an XML document is extracted from the recorded business process flow, an XML document file is created for the extracted XML document, an XML document descriptor file is created comprising XPath queries for data elements in the XML document file, a configuration file is created comprising user input parameters obtained from the recorded business process flow, and test input data file is created. The user input parameters in the configuration file are used to generate a test script to test the service oriented architecture based application, wherein data values from the test input data file are inserted into a template of the XML document file at locations specified by the XPath queries in the XML document descriptor file. The test script is then executed.

Abstract: To address security that can arise in information systems, the present invention uses novel methods and/or systems to enhance security in information systems, using a new way to deploy selected security policies. Instead of trying to modify a whole binary file all at once to add in code to implement additional security policies, the current invention modifies the code in memory in a piecemeal, as-needed fashion.

Abstract: A Java code directive automatically defines the fields declaring methods in delegation objects such that the compiler generates the corresponding delegation signatures and/or headers. The configurations define a predetermined sequence, or annotation, of compiler interpreted instructions to identify a class as a delegation class from an invoking object, and generate the required signature, or header in the invoking object. The resulting signature satisfies the compiler restriction to implement each method in the delegation class. Particular methods for which a specific implementation is desired may then be superceded or supplemented by specific coded instructions in the invoking object. In this manner, a developer need not manually code the implementation, or signature (so-called “boilerplate code), for each method in a delegated object (class).

Abstract: An emulator schedules emulation threads for DMA emulation and other emulation functions in a time-multiplexed manner. Emulation threads are selected for execution according to a load balancing scheme. Non-DMA emulation threads are executed until their execution time period expires or they stall. DMA emulation thread execution is allowed to execute indefinitely until the DMA emulation thread stalls. The DMA emulation thread prefetches additional adjacent data in response to target computer system DMA requests. Upon receiving a target computer system DMA request, the DMA emulation thread first checks to the prefetched data to see if this data matches the request. If so, the request is fulfilled using the prefetched data. If the prefetched data does not match the target computer system DMA request, the DMA emulation thread fetches and stores the requested data and additional adjacent data for potential future use.

Abstract: Dynamic optimization of application code is performed by selecting a portion of the application code as a possible transaction. A transaction has a property that when it is executed, it is either atomically committed or atomically aborted. Determining whether to convert the selected portion of the application code to a transaction includes determining whether to apply at least one of a group of code optimizations to the portion of the application code. If it is determined to apply at least one of the code optimizations of the group of optimizations to the portion of application code, then the optimization is applied to the portion of the code and the portion of the code is converted to a transaction.

Abstract: A method, system, and computer program product containing instructions for automatically converting an MPI source code program into an MPI thread-based program. In response to inputs in the form of an MPI source code program and a command, a converter declares a global variable of the MPI source code program as a thread private variable to create a first private variable for a first thread and a second private variable for a second thread. A library is identified to support converting processes to threads during execution of the MPI thread-based program, and the identified library is used to build an executable version of the MPI thread-based program. The identified library may include code to identify instantiation of a new process when the MPI thread-based program is executing, and in response, to cause a corresponding thread for the MPI thread-based program to be instantiated.

Abstract: An application compiled to a binary executable according to a first set of binary interface rules has selected caller/callee pairs that present parameter passing improvement possibilities modified from compliance with the first set of binary interface rules to compliance with a second set of binary interface rules to improve the efficiency of parameter passing, such as by reducing the number of instructions used to pass the parameters. A binary executable search engine searches the binary executable to locate functions having parameter passing improvement possibilities. Identified caller/callee function pairs are updated with a function modifier to pass the parameters more efficiently. Selected of the identified callee functions are cloned so that a cloned function is modified instead of the original function, thus leaving the original function to pass parameters with functions beyond the view of the binary executable search engine.

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: An embodiment of the present invention is a system and method relating to shrinking, or optimizing, executable images resulting is a savings of storage space. In at least one embodiment, the present invention removes unnecessary fields, or information, from an executable image header before storing the image on a flash for a target platform. The removal of information that is irrelevant to the target platform allows the executable to take up less space on the flash memory. When loaded, the image is interpreted based on the optimized header information. In an embodiment, the image may be further compressed by known methods, to save additional space. Other embodiments are described and claimed.

Abstract: Methods and apparatuses for extending a web-based application class by performing a compile-time extension that is communicated from a client device, having a compiler implemented thereon, to a server device via a remote procedure call.

Abstract: A bytecode accelerator which translates stack-based intermediate language (bytecodes) into register-based CPU instructions transfers plural pieces of internal information from a register file of a CPU to the bytecode accelerator by means of an internal transfer bus between the bytecode accelerator and the CPU and an input selection logic of the bytecode accelerator when the bytecode accelerator is started and transfers plural pieces of internal information in the bytecode accelerator to the register file of the CPU by means of the internal transfer bus, an output selector and an output selector selection logic of the bytecode accelerator when the bytecode accelerator ends its operation in transition between hardware processing and software processing by software virtual machine.

Abstract: A method in a software development environment for developing product runtime code having at least two code components written in different runtime languages, the method comprising: providing a programming interface for development of the code components in a single development language: translating developed code components in the development language back to the respective runtime language for execution.

Abstract: A binary rewriter that can provide complete code coverage without relocation information is provided, together with a method of performing such rewriting. The method can include processing a binary file as an original binary file. The method can also include disassembling the binary file to provide a disassembled binary file. The method can further include rewriting the disassembled binary file without relocation information to provide a rewritten binary file. The rewriting can provide a physical transformation in a recording medium relative to the binary file in the recording medium prior to the rewriting. The processing the binary file, disassembling the binary file, and rewriting the disassembled binary file can be performed by a particular machine.

Abstract: An application-specific client for object-oriented processing of markup includes a model object and a plurality of element objects. The model object is configured to respond to client requests including construct-element, accept-root-element, and accept-root-text. The element objects are configured to respond to client requests including accept-attribute, accept-element, and accept-text. Responses to requests contain application-specific processing as necessary. A driver generates client requests in response to processing of XML markup. An RSS client processes markup describing syndicated web content to HTML markup.

Abstract: Methods and an apparatus for forming a transaction object instruction construct are provided. An example method translates a source instruction construct to form a transactional objective instruction construct, executes the transactional objective instruction construct, intercepts an aborted transaction associated with the transactional objective instruction construct during execution, maintains a graph of nodes and edges associated with the executed transactional objective instruction construct to predict a deadlock situation, and resolves the deadlock situation associated with the transactional objective instruction construct based on the graph.

Abstract: Binary rewriters that do not require relocation information and automatic parallelizers within binary rewriters are provided, as well as methods for performing binary rewriting and automatic parallelization. The method, in certain embodiments. includes disassembling a binary file and determining functions in the disassembled binary file. The method can further include rewriting the binary file without relying on relocation information or object files. Optionally, the method can further include performing automatic parallelization of the binary before rewriting the binary file.

Abstract: A system and method for managing data, such as in a data warehousing, analysis, or similar applications, where dataflow graphs are expressed as reusable map components, at least some of which are selected from a library of components, and map components are assembled to create an integrated dataflow application. Composite map components encapsulate a dataflow pattern using other maps as subcomponents. Ports are used as link points to assemble map components and are hierarchical and composite allowing ports to contain other ports. The dataflow application may be executed in a parallel processing environment by recognizing the linked data processes within the map components and assigning threads to the linked data processes.

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: According to a method of simulation processing, a collection of files including one or more HDL source files describing design entities collectively representing a digital design to be simulated is received. The HDL source file(s) include a statement specifying inclusion of an instrumentation entity not forming a portion of the digital design but enabling observation of its operation during simulation. The instrumentation entity includes sequential logic containing at least one storage element, where the instrumentation entity has an output signal indicative of occurrence of a simulation event. The collection of files is processed to obtain an instrumented simulation executable model. The processing includes instantiating at least one instance of each of the plurality of design entities and instantiating the instrumentation entity. The processing further includes instantiating external instrumentation logic, logically coupled to each instance of the instrumentation entity, to record occurrences of the event.

Abstract: Automatic program conversion method: An analysis step analyzes the number of times that first instruction pattern information elements appear in an old source program; an analysis results output step outputs the analysis results; an instruction pattern conversion step converts old source program descriptions that correspond to the first instruction pattern information elements analyzed to appear a specified number of times or more, so as to correspond to second instruction pattern information elements; a new program output step outputs a new program resulting from the old source program converted in the instruction pattern conversion step; and an input receiving step receives user-entered manual input regarding the descriptions in the old source program that correspond to the first instruction pattern information elements analyzed to appear less than the specified number of times, so that such descriptions are modified for a new source program. Thus, program migration is achieved efficiently, reducing bugs.

Abstract: A method of managing a machinery monitoring system is provided. The machinery monitoring system includes a database of at least one rule set, the rule set including at least one rule expressed as a relational expression of a real-time data output relative to a real-time data input, the relational expression being specific to a plant asset. The method includes importing data representative of a rule set into the machinery monitoring system, applying the at least one rule set to a specific plant asset wherein the at least one rule set is configured to locate the data input using at least a portion of the relative path information, determining a data output of the at least one rule set using the at least one relational expression and the data input, and transmitting the data output to at least one of the machinery monitoring system and the plant monitoring and control system.

Abstract: Identifying service candidates in legacy source code, including a source code analyzer performing structured and unstructured analyses of computer software source code procedures, a repository storing results of the analyses, a target profile analyzer analyzing a target service description of a Service Oriented Architecture and formulating a query therefrom, a search module querying the repository to identify source code elements that match the target service description, and combining any matches within a predefined distance from each other within the source code, a ranking engine ranking the combined matches in accordance with predefined heuristics, and a procedure aggregator aggregating the combined matches by their location in propinquity to the procedures, comparing interface definitions defined for the service description to entry and exit points of the procedures to identify candidate procedures having similar input and output parameters, and producing a ranked list of candidate procedures that map int

Abstract: Methods and apparatus for an application modification framework used in an integrated technology platform are shown, which allows hot deployment of modifications, including a modification component, a hot deployment component, and a package manager component. The framework provides various editors to allow a developer of the base application or a custom client application to edit files and features associated with the application. Managers are provided to control each of the editors and for maintenance of historical information to allow auditing and modification monitoring. Hot deployment controls the ability of the user to implement modifications and changes, wherein changes are identified as to origin and purpose, allowing smart debug to identify if error(s) occurred during custom modification, base modification or otherwise.

Abstract: System and method for converting a class oriented data flow program to a structure oriented data flow program. A first data flow program is received, where the first data flow program is an object oriented program comprising instances of one or more classes, and wherein the first data flow program is executable to perform a first function. The first data flow program is automatically converted to a second data flow program, where the second data flow program does not include the instances of the one or more classes, and where the second data flow program is executable to perform the first function. The second data flow program is stored on a computer memory, where the second data flow program is configured to be deployed to a device, e.g., a programmable hardware element, and where the second data flow program is executable on the device to perform the first function.

Abstract: A method, and corresponding software and system, for translating an expression are described. The method includes accepting a first expression in a first syntax, the expression including a first character sequence representing a string value using the first syntax; identifying a second syntax for representing the expression; and generating a second expression in the second syntax representing the first expression, including generating a second character sequence using the first character sequence such that the second character sequence represents the string value using the second syntax.

Abstract: A method of providing a routing key interpreter for a signalling gateway, the method comprising the steps of generating an input file comprising a plurality of input expressions and a plurality of routing keys corresponding to the input expression, supplying the input file to a lexical analyser generator to generate a lexical analyser, and implementing the routing key interpreter using the lexical analyser.

Abstract: Systems and techniques for testing machine-readable instructions. In one aspect, a method includes identifying a subroutine in a set of machine-readable instructions that can request a service from a service provider, modifying the identified subroutine to convey a description of a service request to a recorder, and storing the modified subroutine so that the modified subroutine is accessed during subsequent data processing activities and the description of the service request is conveyed to the recorder in response to a request for the service from the service provider during the data processing activities.

Abstract: An the integrated circuit comprises a plurality of processor cores interconnected by an interconnection network. A method for generating instructions to be executed in the integrated circuit comprises accepting a plurality of programs, at least some of the programs including one or more communication operations to communicate with other programs; mapping each program to one or more of the processor cores; determining correspondence among communication operations in the programs; and mapping communication for corresponding communication operations to resources associated with the interconnection network.

Abstract: Methods and apparatus provide for translating a software program page by page from a first instruction set architecture (ISA) into a second ISA using one or more of a set of processors of a multi-processor system; and executing the translated software program using a dedicated other processor of the multi-processor system.

Abstract: A method stores, uses and suggests terms in a business solution software program having multiple languages. Instead of only searching for a general use of a term based on its text and general use, one can search for a term based on a specific use in a module. Each term is assigned its own unique identifier in a term ID structure, which also contains information related to how the term is used in the system. The text for the term is stored in a separate term text structure. The term text structure contains the text of the label in all of the available languages. The specific use of the term is stored in a separate term area table including a description of the specific use of the term. When a new label is written the developer can search the current terms to find a term that matches the intended use.

Abstract: A method of generating a software program executable binary file. A first file including source code therein is accessed. A second file including object code therein and further including object file summary information is accessed. The executable binary file is generated from at least the first and second files. The object file summary information is used in optimizing the executable binary file generated.