Abstract: A report representation system and method of transforming report outputs into a standard representation format are provided. The report representation system comprises a report parser for parsing a report output, a code generator for generating a standard representation code of the report output and a code compiler for converting the standard representation code into a format representable as a fixed schema repository. The method comprises the steps of parsing a report output, generating a standard representation code of the report output and converting the standard representation code into a format representable as a fixed schema repository.

Abstract: A method and apparatus for producer graph oriented programming and execution. According to one aspect of the invention, a runtime is provided that interprets producer dependency declarations for methods. The producer dependency declarations identify at run time a set of zero or more producers, where a producer is a runtime instantiatable construct that includes at least an instance and a method associated with that instance. The runtime automatically generates and executes, responsive to receiving a designation of a producer of interest whose method has a producer dependency declaration, a producer graph. The producer graph initially includes the producer of interest and is generated, from the producer of interest to source producers, through instantiation of producers based on the producer dependency declarations of the methods of the producers already in the producer graph. The runtime sequences the execution of the producers in the producer graph as indicated by the producer graph.

Abstract: Various embodiments enable dynamic crunching of script that can be referenced in a webpage. In at least some embodiments, a browser at a client can be employed to navigate to a webpage available from a server. The webpage can be a static webpage or a dynamically generated webpage. In response to a request from the client to the server, the server can be configured to dynamically generate script referenced in a webpage. Dynamic generation of the script at the server can include configuring the script and crunching of the script to reduce its size. The server can communicate a response having the dynamically crunched script to the client to enable execution of the script by the browser.

Abstract: A computer implemented application development (authoring) system permits objects (such as VBX custom controls) to be graphically inserted into the program under development by dragging and dropping associated icons into one of four views. The properties associated with the object may then be assigned settings. Development of a complete application is accomplished by visually arranging, ordering, and interconnecting the objects without the necessity of writing any code. The four views of Output, Map, Multitrack, and Workform may be synchronized so that changes made to the program in one view are simultaneously reflected in all other views. The system generates as output a script listing the objects and their properties which is then executed by a separate run time program. The system permits use of objects written to a standard specification and the addition at any time of additional objects written to that.

Abstract: An execution control method is described for use in a translator (19) which converts subject code (17) into target code (21). The translator (19) includes a translator trampoline function (191) which is called from a translator run loop (190) and which in turn calls either to a translator code generator (192) to generate target code, or else calls previously generated target code (212) for execution. Control then returns to the translator trampoline function (191) to make a new call, or returns to the translator run loop (190). Other aspects include making context switches through the trampoline function (191) and setting first and second calling conventions either side of the trampoline function (191). Jumping directly or indirectly between target code blocks (212) during execution is also described.

Abstract: Example embodiments described herein may comprise a transfer of firmware execution within a non-volatile memory device to one or more replacement instructions at least in part in response to a match between a code fetch address and an address stored in a trap address register.

Abstract: Graph oriented programming and execution. According to one embodiment of the invention, execution of a program includes automatically discovering and building a graph. The graph is to represent parent child relationships between combinations. Each combination is a specific method and a specific object-oriented instance. Based on a first of the combinations, other combinations are determined by iteratively discovering the child combinations for already discovered parent combinations. The graph is built of nodes coupled with links. Each of the plurality of combinations is identified by one of the nodes. Each of the parent child relationships is represented by one of the links. Execution of the program also includes executing the graph in an order indicated by the links until the root node is reached. Execution of each of the parent nodes includes executing the combination identified by that parent node to generate an output using the outputs of its child node(s).

Abstract: Method and system for translating a function in a computer programming language into a non-native instruction set, as part of a program that is otherwise in a native instruction set computer program. The method comprises translating the function into the non-native instruction set, prefixing the translated function with a preamble in the native instruction set format that implements the required conversion and non-native instruction set interpretation when called from native code segments, and incorporating into the translated function and/or the preamble a means of identifying the function as being in the non-native instruction set.

Abstract: Remote card content management using synchronous server-side scripting is provided. A system includes a computer processor and a script interpreter executable by the computer processor. The script interpreter is configured to perform a method. The method includes parsing a script configured to perform a card content management operation as a sequence of operations for a secure element based on receiving a request from a mobile device located remotely from the computer processor. The method also includes creating an execution context for the script to identify the sequence of operations in the script as non-flushing and flushing nodes. A flushing node is identified as an operation that sends a response to the request and expects a subsequent request from the mobile device for the secure element. The method further includes pausing execution of the script upon sending the response at the flushing node.

Abstract: A method, capable of being implemented in executable instructions or programmes in device(s), including computer system(s) or computer-controlled device(s) or operating-system-controlled device(s) or system(s) that is/are capable of running executable code, providing for the creation in Device(s) of executable code, such as boot code, programmes, applications, device drivers, or a collection of such executables constituting an operating system, in the form of executable code embedded or stored into hardware, such as embedded or stored in all types of storage medium, including read-only or rewriteable or volatile or non-volatile storage medium, such as in the form of virtual disk in physical memory or internal Dynamic Random Access Memory or hard disk or solid state flash disk or Read Only Memory, or read only or rewriteable CD/DVD/HD-DVD/Blu-Ray DVD or hardware chip or chipset etc.

Abstract: A computer-implementable method includes providing an instruction set architecture that comprises features to generate diverse copies of a program, using the instruction set architecture to generate diverse copies of a program and providing a virtual machine for execution of one of the diverse copies of the program. Various exemplary methods, devices, systems, etc., use virtualization for diversifying code and/or virtual machines to thereby enhance software security.

Abstract: In a host system, a method for using instruction scheduling to efficiently emulate the operation of a target computing system includes preparing, on the host system, an instruction sequence to interpret an instruction written for execution on the target computing system. An instruction scheduling on the instruction sequence is performed, to achieve an efficient instruction level parallelism, for the host system. A separate and independent instruction sequence is inserted, which, when executed simultaneously with the instruction sequence, performs to copy to a separate location a minimum instruction sequence necessary to execute an intent of an interpreted target instruction, the interpreted target instruction being a translation; and modifies the interpreter code such that a next interpretation of the target instruction results in execution of the translated version, thereby removing execution of interpreter overhead.

Abstract: A system controls operation of a business system having a processor, memory, and a hard drive. The system comprises a specification language file stored on a hard drive, the file containing specification language statements defining a state machine implementation of a business system, a parser for extracting specification language statements from the specification language file and interpreting the extracted specification language statements, a business logic application program comprised of business logic modules, the business logic modules including executable compiled program statements, and the parser calls at least one of the business logic modules to process a message extracted by the parser from the specification language file.

Abstract: A micro-architecture may provide a hardware and software co-designed dynamic binary translation. The micro-architecture may invoke a method to perform a dynamic binary translation. The method may comprise executing original software code compiled targeting a first instruction set, using processor hardware to detect a hot spot in the software code and passing control to a binary translation translator, determining a hot spot region for translation, generating the translated code using a second instruction set, placing the translated code in a translation cache, executing the translated code from the translated cache, and transitioning back to the original software code after the translated code finishes execution.

Abstract: Analyzing dynamic source code. A method includes accessing a specific metadata format data structure. The data structure was created by obtaining one or more first data structures defining constructs in a body of dynamic language source code. From the one or more first data structures, identifier information is extracted for one or more of the defined constructs. Knowledge about the constructs is augmented. The metadata format data structure is parsed to compute metrics about the metadata format data structure. The metrics about the metadata format data structure are provided to a user.

Abstract: The embodiments herein are concerned with building an information system for enterprises. It has a unique versatile executor engine, which can interpret and execute transaction structures and information views. The information system can grow along with the needs of the enterprise. An information system built in this methodology will allow online and on site creation of new options and changing the existing options without any down time. The embodiments herein incorporate a unique technology, which enables an information system to be built without writing software programs. This makes information system building simple and quick. The data is analyzed and split into transaction structures and information views. These are then defined using the builder, which stores these definitions as data. This is intercepted and executed by the unique executor engine to provide the necessary information.

Abstract: Various embodiments of systems and methods for dynamic binary translation in an interpreter are disclosed. An embodiment comprises a method for dynamic binary translation in an interpreter.

Abstract: A method and system for program protection based on a .NET card. The method includes compiling, by a first device, first source code into a first assembly, and storing the first assembly to a .NET card. Information of a remotely invoked class in the first source code is extracted to form a new class. A remote invocation instruction is written in the new class to generate second source code. The second source code is compiled into a second assembly, and the .NET card and the second assembly are provided to a second device. The second device executes the second assembly, remotely invoking the class in the first source code, executing the class at the .NET card via an interface of the .NET card, and receiving an execution result returned by the .NET card. The system includes a .NET card, a first device and a second device.

Abstract: Methods and systems for implementing “virtual machine” interpreters in a hardware component. The virtual machine interpreter may be implemented in the hardware component (e.g., a processor) by configuring the hardware component to include programming language interpreter logic. The hardware component is configured to include multiple logic gates and arrays representing a hardware-based implementation of a virtual machine interpreter.

Abstract: A solution is proposed for metering the usage of Java programs. For this purpose, each Java program to be metered is associated with a fingerprint defined by a reference sequence of classes that must be loaded for its execution. The sequence of classes that are actually loaded by the Java Virtual Machine (JVM) is monitored, for example, by means of a wrapper for a class loader of the JVM. The sequence of loaded classes is then used to identify the Java program in execution (which fingerprint matches this sequence of loaded classes).

Abstract: The deployment of native methods in a virtual machine environment may be significantly simplified by incorporating a corresponding native code segment into the application file, such as a JAVA class file, and using the embedded native code segment for library bind operations of the corresponding class file.

Abstract: Optimized compiled code can be generated from bytecode derived from a program written in a dynamic language such as JavaScript. Optimizations can be based on one or more assumptions. During execution of the optimized compiled code, the assumption or assumptions on which the optimization was based can be examined for validity. In response to determining that the optimization was based on an invalid assumption or assumptions, execution of the optimized code can stop, the state of variables used by an interpreter can be restored and execution of the program can resume in the interpreter using the unoptimized bytecode derived from the program. Resumption of the program can resume at the point in the bytecode analogous to the point in the optimized compiled code at which the assumption or assumptions was determined to be false.

Abstract: A method and apparatus for converting a method call to a function call. In one embodiment, the method comprises receiving an argument list from a function that has been called by a subroutine call. The method further comprises determining whether the subroutine call is a method call from the argument list. In response to a determination that the subroutine call is the method call, the method comprises converting the method call into a function call.

Abstract: There is described a method of compiling source code for a computer program into corresponding object code. The source code includes several declared variables. The method comprises, for each declared variable in the source code, including in the object code a declaration statement indicating an associated memory location for that variable and indicating the position in the object code of the next declaration statement. During compilation, the memory location for each declared variable can be retrieved from the object code by examining each declaration statement in turn, using the position information from each declaration statement to locate the next declaration statement. This is of particular advantage where the available volatile memory is limited, because there is no requirement for a look-up table of variables against memory locations.

Abstract: A computer program product comprises a computer useable medium. The computer useable medium has a computer readable program such that when the computer readable medium is executed on a computer, the computer is caused to configure an adapter such that the adapter is specific to a data source, provides a communication link to the data source, converts a format of the data source to a format native to a middleware system, and converts a format of metadata of the data source to a standard metadata format. Further, the computer is caused to configure an application interface component to convert an invocation of a function in the middleware system to an invocation of a function provided by an Enterprise Information System through the adapter, convert the data format of the middleware system to a format native to the Enterprise Information System accessed through the adapter, and maintain metadata describing a message format and a function provided by the adapter.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for creating mobile device applications. In one aspect, a method includes determining that a user has entered one or more user inputs into an integrated development environment, to select or arrange a component that defines a portion of an application, and transmitting interpreter code that corresponds to the component to a mobile device, where the interpreter code, when interpreted by a command interpreter on the mobile device, causes the mobile device to generate a mock-up of the portion of the application defined by the component.

Abstract: A method and system are described for generating reference tables in object code which specify the addresses of branches, routines called, and data references used by routines in the code. In a suitably equipped processing system, the reference tables can be passed to a memory management processor which can open the appropriate memory pages to expedite the retrieval of data referenced in the execution pipeline. The disclosed method and system create such reference tables at the beginning of each routine so that the table can be passed to the memory management processor in a suitably equipped processor. Resulting object code also allows processors lacking a suitable memory management processor to skip the reference table, preserving upward compatibility.

Abstract: A supervisory process control and manufacturing information application development and execution system is disclosed that supports the execution of application object scripts derived from multiple different scripting languages. In particular, the system includes a script editor interface that enables submission/specification of scripts for application objects. The script editor interface supports multiple distinct user-side script languages (e.g., user-supplied script text). A script translation component that receives the user-side script includes routines for rendering execution-side script (executable by a script engine) from source script rendered by the script editor and written according to any of a set of user-side script languages supported by the script translation component. The translator supports at least a first scripting language and a second scripting language.

Abstract: In an embodiment, a computer-readable medium may include computer-executable instructions for selecting a symbolic math engine. The instructions may be executed on a processor. The medium may include: one or more instructions for dynamically selecting a first symbolic math engine from two or more symbolic math engines; one or more instructions for converting a symbolic command from a standard format into a first format compatible with the first symbolic math engine; one or more instructions for passing the converted command to the first symbolic math engine for executing, the executing including producing a result; and one or more instructions for outputting or storing the result of the executing.

Abstract: A virtual machine can be extended to be aware of secondary cores and specific capabilities of the secondary cores. If a unit of platform-independent code (e.g., a function, a method, a package, a library, etc.) is more suitable to be run on a secondary core, the primary core can package the unit of platform-independent code (“code unit”) and associated data according to the ISA of the secondary core. The primary core can then offload the code unit to an interpreter associated with the secondary core to execute the code unit.

Abstract: An improved method for program building uses predefined source files and predefined build scripts comprising a sequence of build commands; wherein each build command comprises an origin command line interpretable by an operating system and addressed to at least one compiling tool.

Abstract: A method of simplifying the programming of animation of vector graphics for the graphic user interface of, for example, a SCADA system. The programming method allows the programmer to input unique yet simple instruction codes instead of inputting multiple lines of logic script to animate vector graphic objects and texts. An animation engine is used to interpret the simple instruction codes and instruct the browser to perform the necessary animation on the selected vector graphic objects.

Abstract: A facility is described for server-side evaluation of client-side script, such as to crawl and index dynamically generated links. In various embodiments, the facility provides an object that emulates a browser object. The provided object exposes a function for performing steps comprising receiving a first link and storing the received first link in a list of links to be processed. The facility receives a second link to be processed, loads a second document identified by the received second link, and assigns the provided object to a global variable so that a script associated with the loaded second document invokes the function exposed by the provided object instead of a function with a similar name that is exposed by the emulated browser object. The function with the similar name exposed by the emulated browser object handles the received first link without storing it in the list of links to be processed.

Abstract: The present invention extends to methods, systems, and computer program products for translating declarative models. Embodiments of the present invention facilitate processing declarative models to perform various operations on applications, such as, for example, application deployment, application updates, application control such as start and stop, application monitoring by instrumenting the applications to emit events, and so on. Declarative models of applications are processed and realized onto a target environment, after which they can be executed, controlled, and monitored.

Abstract: A method for extending a script language in a runtime environment of a data processing system to support an application, the runtime environment having a script language interpreter, the method comprising: subclassing a predetermined object defined by the script language to create a subclassed object, the predetermined object having an original method, the subclassed object having a respective replacement method for supporting the application; dynamically registering a symbol corresponding to the subclassed object; detecting the subclassed object in the application with the script language interpreter; and, executing the replacement method with the script language interpreter.

Abstract: Programming for a data processor to execute a data processing application is provided using microcode source code. The microcode source code is assembled to produce microcode that includes digital microcode instructions with which to signal the data processor to execute the data processing application.

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: A rule engine system works with physical systems monitored by Internet-enabled endpoints on one hand and developer custom applications on the other. Endpoints operate in both the domain specific language of the rule engine, and communicate with participating applications in the native protocols thereof. Whether new or legacy, whether hardware, software, or firmware, whether having much, little, or no digital processing or communication capacity, the participating application may be monitored and controlled by an endpoint that communicates over the Internet with the rule engine. Individual developers prepare rule language files, containing data and instructions for the rule engine to implement through the end point. Any apparatus, whether exclusively mechanical, electrical, electronic, highly sophisticated electronic, or some combination may be monitored and controlled. Any participating application, from a mechanical lawn sprinkler to an Internet commerce server may be implemented thus.

Abstract: A method and system for processing generic formatted data, including first data describing a sequence of generic operations without any loops, in view of providing specific formatted data, for a determined platform including Q processor(s) and at least one memory, the platform configured to process, according, directly or indirectly, to specific formatted data, an object made up of elementary information of same type, each elementary information being represented by at least one numerical value.

Abstract: A tool for simulating an industrial control system is provided. The tool includes a simulation component to emulate one or more simulation models according to a simulated execution environment. A switch component is associated with the simulation component to selectively enable or disable variability in the simulation models.

Abstract: Some embodiments of a method and an apparatus to abstract away rule languages from a rule engine have been presented. In one embodiment, rules written in a first rule language are parsed into descriptor classes, which are used to model concepts that can be expressed in a rule engine. An intermediate structure is generated from the parsed rules. The intermediate structure is input to a core of the rule engine, which is operable to execute the rules.

Abstract: The aspects enable a processor to concurrently execute markup language code (e.g., HTML) having embedded scripting language code (e.g., JAVASCRIPT®) during a page load operation by a browser. A markup language parser parses markup language code until embedded scripting language code is encountered. The segment of embedded scripting language code is extracted for execution by a scripting language engine which proceeds concurrently with speculative parsing of the markup language code. Markup language code generated by execution of scripting language code is evaluated to determine if it is well formed, and a partial rollback of the markup language parse and re-parsing of portions of the markup language code is accomplished if not. Concurrent parsing of markup language code and execution of scripting language code, with partial roll back of the parsing process when necessary, continues until all markup language code has been parsed and all scripting language code has been executed.

Abstract: A computer is programmed to automatically have multiple sessions update a common counter which is shared therebetween, when interpreting a given method so that system-wide statistics are collected for each method. The single counter is commonly accessed for updating by the respective interpreters in the multiple sessions which are executing the method. The computer is further programmed to asynchronously compile the method (regardless of the state of the multiple sessions), to obtain compiled software in the form of executable machine instructions. Specifically, asynchronous compilation starts dynamically, whenever a method's common multi-session counter satisfies a predetermined condition. Finally, each session is informed when compilation is completed so that the next time the method needs to be run, it is not interpreted and instead the compiled software is executed. The compiled software is kept in a shared memory which is accessible to each session.

Abstract: A computer-implemented method for focusing product testing based on areas of change within the product is described. A link between resource files of a product and test cases associated with the product is created. The resource files of a first build of the product are compared with the resource files of a second build of the product. A report that comprises which resource files changed between the first build of the product and the second build of the product is generated. The resource files that have changed and the test cases linked to the changed resource files are displayed. The test cases linked to the changed resource files are executed.

Abstract: Techniques for programming using a model based spreadsheet scripting language are disclosed herein, where procedural aspects may be incorporated along with the model based aspects therein. In particular, techniques for performing calculations of a value, and recalculation of interdependent formulas using programs written with the model based spreadsheet scripting language are disclosed.

Abstract: Methods, systems, and computer program products are provided for profiling source code to enable improved source code execution. A runtime engine includes a parser, a bytecode generator, an execution controller, an interpreter, a just-in-time (JIT) compiler, and a profile generator. The parser receives source code coded in a dynamic language and parses the source code to generate parsed source code. The bytecode generator converts the parsed source code to bytecode. The interpreter is configured to interpret the bytecode when enabled by the execution controller. The JIT compiler is configured to compile the bytecode when enabled by the execution controller. The profile generator generates profile information from the bytecode and stores the profile information. The execution controller enables the interpreter or the JIT compiler to perform their respective functions based on the profile information.

Abstract: The CPU includes a byte code interpretation unit that sequentially reads intermediate code instructions along an execution route, determining whether or not there is a compilation result of the read intermediate code instruction in the compilation result storage unit, interpreting the intermediate code instruction when there is no compilation result, and designating the compilation result if there is a compilation result; and a program execution unit that, if received the interpretation result of the intermediate code instruction from the byte code interpretation unit, executes the intermediate code instruction and, if received the designation of the compilation result, executes the program by executing designated native code. The CPU includes a compilation execution unit that compiles the intermediate code instruction interpreted by the byte code interpretation unit to generate the native code and stores them in the compilation result storage unit.

Abstract: Generating a virtual CD recorder by using a storage device is proposed. The storage device includes a first data sector for storing auto-run data and a second data sector for storing table of content (TOC) information data. When the storage device is connected to a host, a detecting module of the host detects whether the TOC information data exists in the second sector. When the TOC information data exists or could be accessed, a reading module can read a first disc image file based on the TOC information data. A burning module can record data into a second disc image file and update the TOC information data associated with the second disc image file in the second sector.

Abstract: A method for parsing and executing a software program includes receiving a portion of a software program in an original linguistic form, wherein the portion of the software program includes a nonlinear program element having a body, and, while retaining the original linguistic form, directly executing the nonlinear program element by manipulating a parse state and an input stream of tokens representing the body of the nonlinear program element, wherein directly executing comprises executing tokens until the dynamic end of the nonlinear program element is reached. A system includes a tokenizer operable to tokenize the software program and a parser operable to directly execute a nonlinear program element in the software program by manipulating a parse state and an input stream of tokens representing the body of the nonlinear program element, while preserving the original linguistic form of the software program.

Abstract: A data processing apparatus includes a host processing apparatus that can cooperatively verify, using generated Timed software, hardware and software of a semiconductor device mounted with a target processing device and an operating system (OS), wherein the host processing apparatus analyzes an assembler of the target processing device and recognizes a Basic Block, which is a basic unit for calculating information concerning time, and generates Timed software for the cooperative verification with reference to the Basic Block.