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: A method and system for compiling a source code, the source code is written in a source-code-human-language. The method comprises associating a plurality of identifiers to a grammar analyzer. The grammar analyzer comprises an analyzer that corresponds to each identifier. The plurality of identifiers is arranged in a predefined-sequence. Further, the plurality of analyzers in the grammar analyzer is arranged in the predefined-sequence. Also, the method comprises tokenizing the source code in response to associating the plurality of identifiers.

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 for creating a specific POSIX style locale source file, on demand, suitable for compilation in a computer is provided the method comprising, receiving a request submitted for the specific POSIX style locale, and obtaining a plurality of localization values related to the specific POSIX style locale. Next, determining a category within the plurality of localization values and selecting process routines dependent upon the category, and then selectively extracting the category information. After extracting the category information is stored into a memory of the computer. A determination is made regarding more categories to process, which might result in processing the remaining categories, otherwise assembling the extracted information into the POSIX style locale source file. Assembling may entail addition of no files or files such as LC-CTYPE and LC_COLLATE to form a locale source suitable for compilation.

Abstract: A computer-implemented method of handling localizable objects is provided. The method includes the step of obtaining an initial class containing localizable properties and non-localizable properties. The initial class is then transformed into a base-part class and a translation-part class. A localization tool for performing the transformation is also provided.

Abstract: Method and apparatus for translating a first program in a dynamically-typed language to a program in a hardware description language. From the dynamically-typed-language first program, a second program in single static assignment format is generated. For cases where a variable is assigned different data types at different places in the program, the assignments of the different data types are resolved for the variable. The second program is then translated to a program in the hardware description language.

Abstract: An alternative to a real time operating system (RTOS) is provided based on serializing compilers. A serializing compiler can transform a multitasking application into an equivalent and optimized monolithic sequential code, to be compiled with the embedded processor's native optimizing compiler, effectively filling the RTOS gap. The serializing compiler can analyze the tasks at compile time and generate a fine-tuned, application specific infrastructure to support multitasking, resulting in a more efficient executable than one that is intended to run on top of a generic RTOS. By having control over the application execution and context switches, the serializing compiler enables the fine grain control of task timing while enhancing overall performance. The serializing compiler technology strengthens existing compilers, making them timing and task-aware.

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: 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 compiler deployed as a component of an integrated development environment (“IDE”) is adapted to transform source code into target code that is correct by construction by complying with approved patterns described by an external configuration file which is utilized to parameterize the generation of the target code by a code generator. The approved patterns can express various design requirements, guidelines, policies, and the like that are acceptable for the target code to include as well as those which are unacceptable. A rules generator that applies regular tree grammar is configured to encapsulate the approved patterns in the external configuration file using a formal description that is machine-readable by the code generator. A source code translator is alternatively utilized to transform non-compliant source code into compliant source code that adheres to the approved patterns.

Abstract: A scheme for protecting policy state information during the lifetime of a virtual machine is presented. In order to protect and preserve the policy state information of the virtual machine, a process creates a source policy, a mapping policy, and a binary policy. These policies are all different representations of a security policy. The different policy representations are chained together via cryptographic hashes.

Abstract: A method and/or computer program that incorporates isolation principles of separate address spaces and enforces the principles with a compiler and supporting runtime through a language-based model is disclosed. This approach significantly lowers the required overhead and retains the beneficial qualities of the scalable, isolated model. The model is implemented in a programming language where memory-based state is partitioned into a plurality of domains where the variables inside of a domain are isolated from external components. Agents are introduced inside of the domain and act on behalf of clients outside of the domain. The agents communicate with their clients via message-passing to enforce the isolation of the domain state. The domain-based isolation addresses the partitioning of memory-based state without the introduction of separate processes. Domains can also be used in conjunction with a distributed model either within a single computing device or between computing devices.

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: A method of annotating a specification of a programmable logic controller is provided that includes displaying a graphical element in a first graphical language for programming the programmable logic controller, and displaying a comment associated with the graphical element. A method for converting a specification for a programmable logic controller in a first language to a second language is provided that includes converting a first instruction in the first language to a second instruction in the second language, and converting a first comment associated with the first instruction to a second comment associated with the second instruction. A computer-readable recording medium is provided.

Abstract: A translation system and method is described that may automatically translate strings of a legacy application for use in creating an interfacing application that can interface with the legacy application. The translation system and method receive a plurality of input strings from a string list and use an initial language library to associate an identifier with the input strings. The identifier is used to determine the translated version of the input string from additional language libraries. The determined translated strings are associated with the input strings.

Abstract: Provided is a file conversion device which converts a file form written in a given language to a file form that can be interpreted by another language, which includes: a file readout device which reads description contents of an inputted file by each line, and manages the description contents by adding an index to each line of the read description contents; a syntax tree creating device which converts the description contents into a syntax tree of a tree structure based on the indexes through linearly scanning the indexes of the file managed by the file readout device; a syntax tree optimizing device which optimizes the tree structure of the syntax tree as a flowchart according to an optimization rule; and a file dividing device which divides the inputted file by having controllers in the flowchart optimized by the syntax tree optimizing device as identifiers.

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, 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, computer program product, and data processing system for performing automated optimization of a control processing flow containing Boolean conditional expressions is disclosed. Each conditional expression is profiled using a representative set of test vectors to determine the probabilities of individual conditions and combinations of conditions in the expression. Next, the expression is restructured or reordered, including selective computation of subexpressions, based on the probability information, so as to maximize the probability of a short-circuit termination of evaluation of the expression and/or to minimize the statistical execution time of the expression. This process is performed for all Boolean conditional expressions related to the control processing flow.

Abstract: A routing policy compiler generates a configuration data abstraction layer of a routing policy which maps configuration to an intermediate layer comprising fields, operators and arguments. A policy repository verifies the intermediate layer against a set of verification rules for one or more client protocols including versions thereof. The policy repository may generate compiled policy transmission language for use by one or more client protocols including versions thereof. The policy compiler supports multiple software versions of client protocols with differing capabilities as well as differing client protocols. In some embodiments, an optimization may be performed on a compiled policy so that route updates are processed more efficiently. The policy compiler may permit the addition of new attributes to a routing protocol without having to recompile. Policy statements may be verified for more that one client protocol including more than one version of a client protocol.

Abstract: The system and method for defining messages of communication networks in a formal notation called Transfer Syntax Notation One (“TSN.1”) and compiling TSN.1 message definitions into a software message parser using a TSN.1 compiler are provided. The parser is designed to speed up the development of wireless communication software. It translates messages between the implementation specific, programming language and platform dependent representations and the standard defined, programming language and platform independent representations. The messages described using the TSN.1 notation can be communicated to wireless device protocol stacks over a variety of networks, which utilize a number of protocols and implement OSI 7 Layers Protocol Model, including such layers as Transport, Network, and Data Link. The message parser generated by the TSN.

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 system and method for converting byte code of a first type into byte code of a second type. Byte code of a first type is received as input. The first byte code is converted into constituent byte code data elements that can comprise any logical unit or grouping of at least a portion of a software application. The first byte code data elements are mapped to data elements of a second byte code type. The second byte code data elements are assembled into a resulting second byte code.

Abstract: A method of automatic replication setup is disclosed. The method allows the business application user to focus on the requirements posed by the business application and to abstract from the low level infrastructure details. Information specific to the databases and infrastructure design decisions can be provided by a subject matter expert. By automating the requirements analysis and infrastructure setup process, the time to deliver can be decreased significantly and the potential for errors reduced.

Abstract: An application object for a supervisory process control and manufacturing information system application distributable to a plurality of networked computer devices and having a layered architecture, the application object comprising a set of text entries listed in a first language, a dictionary within each object drafted to enable the set of text entries to be translated into a plurality of multiple languages, and a set of one or more translation fields for storing text in each of the plurality of languages corresponding to the set of text entries listed in the first language.

Abstract: A programming editor and creator allows users with minimal knowledge of a computer language syntax to generate computer source code using a structured rather than freeform process. A predefined command sentence is provided representing at least a portion of a programming command, and includes words, which may be defined as constant or enterable words. Enterable words may be required or optional, and correspond to entry components. Each word may be defined according to word types, including list words, variable list words, variable words, mathematical words, condition words or Boolean words. Enterable words may include repeatable words which may be inserted multiple times within a command to create conditional statements, mathematical equations and string concatenations. Input values are provided for the entry components.

Abstract: Utilizing a JAVASCRIPT Object Notation (JSON) bridge during JAVA-based composite application development can begin with the receipt of a command to present the wiring diagram of a JAVA-based composite application by an enhanced JAVA-based composite application development tool. The JAVA-based composite application can consist of one or more JAVA-based components and non-JAVA-based components, with one property of a JAVA-based component being communicatively wired to a non-JAVA-based component. A JSON bridge can acknowledge the accessing of the JAVA-based composite application. The wiring diagram of the JAVA-based composite application can then be visually rendered. For the property of the JAVA-based component communicatively wired to the non-JAVA-based component, a user-selectable option to utilize the JSON bridge for communication can be presented.

Abstract: A mechanism is disclosed for compiling a program which is written in a first language having a first syntax. An indication is detected, in a set of code within the program, that the set of code contains a non-compliant identifier that is not intended to be compliant with the first syntax associated with the first language. In response to detecting the indication, the non-compliant identifier is transformed into a transformed identifier that is compliant with a second syntax associated with a second language. Compiled code that uses and operates with the transformed identifier is emitted. For example, the first program may be written in language that is substantially similar to the Java programming language. The first syntax may be a syntax that is substantially compliant with syntax of the Java programming language. The second language may be XML, wherein the second syntax is substantially compliant with XML.

Abstract: An embodiment of the present invention is a technique for translating a business rule. An operation for a rule to authorize a provision of information is created. A current container is established. A propositional expression in the rule describing the provision of the information is processed. If the current container is null, a context for the propositional expression is recorded as null, else an object type in the current container is recorded as a resulting context from the propositional expression.

Abstract: A method and system for tracking and processing user interaction information from multiple computing devices. Individual computing devices collect user interaction information corresponding to user interaction with discrete units of a set of data, such as software programming code. The individual information is collected and processed to generate a cumulative set of user interaction information that is transmitted back to the client computing devices. The client computing devices can then provide various visual interfaces corresponding to the processed user interaction data.

Abstract: A method for modeling and simulating a system comprising first and second interrelated components is disclosed. The method comprises modeling the behavior of said first and second components using first and second specifications. Each of said first and second specifications includes a functional specification and an associated simulation element. The method further comprises simulating the behavior of said first and second components using said first and second specifications. The simulation elements communicate with one another to provide a simulation system.

Abstract: A method and software for processing a server page is disclosed, in which a resource file is generated for each server page. The resource contains the markup text of the server page. When the server page is translated into a servlet, a static class initializer is included to read the resource file and initialize static class variables with the markup text. The initialized class is then loaded into a shored memory that is accessible to different processes.

Abstract: A digital system design method uses a higher programming language. In order to realize a digital system, an algorithm is verified based on a program written by the higher programming language and a program is programmed considering the higher programming language-hardware characteristics before the program is written in the lower programming language, and thus conversion into the lower programming language may be easily performed.

Abstract: A parse/build engine that can handle multi-format financial messages. The engine converts the different format messages into a common format, and the common format message is then processed by the business service application. A parser examines the message and determines an appropriate schema for the particular format of message received. The schema is a data structure in a schema registry that includes a grammar structure for the received format as well as pointers to handlers for converting the different fields of the message into the internal message format using the grammar structure (the “grammar” can include field sequence, field type, length, character encoding, optional and required fields, etc.). The handlers are individually compiled. As formats change, new formats or changes to old formats can be dynamically added to the parse/build engine by loading new schema and handlers.

Abstract: The subject disclosure pertains to computer programming languages and translation or conversion thereof. Rather than a complicated semantics preserving translation or conversion from a first source language to a second target language, the conversion can be one of syntax. The conversion can be accomplished, for example, via employment of a map that defines the relation between the syntax of the first language and the second language. The semantics of at least a part of the first language can be defined by the second target language. Thus, the first language can be open-ended and/or semantically extensible based on the second language.

Abstract: A system and method is disclosed for routing data of a declarative source expression to a destination. Declarative source expressions are analyzed at compile-time to discover variable properties. As such properties are discovered, a binding object is created and a list of watcher objects is generated associated with the particular variable properties. The watcher object includes a change event notification which is broadcast when a change in the property is detected. When a change event notification is received, a binding object, which is also automatically generated by the compiler, is executed causing the variable property to be read and the declarative source expression to be re-evaluated which propagates the property changes through the application.

Abstract: A computer-implemented system for accessing data stored in a computer-readable format comprises a data source indicator that identifies least one datum of a data source to be typed. The system also includes a type definition component that defines a strongly typed view of the at least one datum. Methods of using the system are also provided.

Abstract: Generating code is disclosed. A specification of one or more translation patterns is received. The one or more translation patterns are used to generate at least a portion of code associated with a translator. Using the one or more translation patterns to generate at least a portion of code associated with the translator results in the translator being configured to create a target object model. Creating the target object model includes populating one or more elements of the target object model in a processing order at least in part associated with an order of elements in the one or more translation patterns.

Abstract: A localization platform is used to localize data to one or more distinct markets. A matching component receives data to be localized and accesses different localization components and returns localized data corresponding to the input data. A data gathering component receives localized content from an input source that is external to the localization platform along with metadata that identifies the particular input source that provided the localized content. The data gathering component then only allows the particular input source that provided the localized content to modify that localized content.

Abstract: A method, computer program product, and apparatus comprise providing a Java developer kit class library comprising first Java classes; providing a Java Open Foundation class library comprising second Java classes each containing one or more of the first Java classes; providing a .NET SDK class library comprising .NET classes; providing a .NET language Open Foundation class library comprising first .NET language classes each containing one or more of the .NET classes; wherein each of the .NET language classes presents the same method signature as one of the second Java classes; receiving Java source code defining third Java classes, first calls to the first Java classes, and second calls to the second Java classes; translating the third Java classes into second .NET language classes; and translating the first calls to calls into the .NET SDK class library without modifying the second calls.

Abstract: A method for defining expressions in a meta-object model of an application by locating a string representation of an expression including an identification of a language of the expression; accessing a data type definition corresponding to the language of the expression, the data type definition including a converter for converting the string representation of the expression into an executable runtime representation of the expression; and converting the string representation of the expression into an executable runtime representation of the expression.

Abstract: A template-driven system for generating platform-specific artifacts, such as program code, from platform-independent service models is described. The system comprises a template storage with platform-specific templates, each template including platform-specific model transformation information; a repository with a plurality of at least essentially platform-independent service model elements and one or more service models modeled from the model elements; and a generator adapted to generate platform-specific artifacts by applying the transformation information included in the templates to the service models.

Abstract: A method and apparatus for dynamic binary translator to support precise exceptions with minimal optimization constraints. In one embodiment, the method includes the translation of a source binary application generated for a source instruction set architecture (ISA) into a sequential, intermediate representation (IR) of the source binary application. In one embodiment, the sequential IR is modified to incorporate exception recovery information for each of the exception instructions identified from the source binary application to enable a dynamic binary translator (DBT) to represent exception recovery values as regular values used by IR instructions. In one embodiment, the sequential IR may be optimized with a constraint on movement of an exception instruction downward past an irreversible instruction to form a non-sequential IR. In one embodiment, the non-sequential IR is optimized to form a translated binary application for a target ISA. Other embodiments are described and claimed.

Abstract: One embodiment of the present invention provides a system that facilitates identifying objects rendered on a graphic user interface (GUI) in a non-markup-language-presented software application. During operation, the system receives a non-markup-language-presented application at a computer. The system first selects a set of attributes that uniquely distinguish a target GUI object. The system then identifies a set of target GUI objects in the application, wherein a respective GUI object is not represented in a markup language in the received application. Next, the system represents the target GUI objects in the application with a markup-language-based structure, wherein each target GUI object is associated with a corresponding markup-language node in the structure.

Abstract: Message translation systems and methods are provided. In one embodiment, a method for translating messages comprises reading a first sequence of one or more message elements from a first interface, wherein the message elements are structured based on a first protocol; converging on a message mapping node based on the first sequence of one or more message elements, wherein the message mapping node is defined by a protocol metadata schema; performing one or more conversion operations on the first sequence of one or more message elements to construct a second sequence of one or more message elements, wherein the one or more conversion operations are based on the message mapping node; and writing the second sequence of one or more message elements to a second interface.

Abstract: A method and system for transforming information between data formats.

Abstract: Embodiments of the invention may provide methods and/or systems for converting a source application to a platform-independent application. Source programming language code of the source application may be translated to target programming language code of the platform-independent application. The source programming language code may comprise Connected Limited Device Configuration (CLDC) code, and the platform-independent programming language may be independent of one or more device platforms. Further, one or more source resources associated with the source application may be converted to one or more target resources.

Abstract: A software documentation preparing system which can prepare software documentation written in plural natural languages is provided.

Abstract: A method of generating an interface definition language (IDL) interface involves identifying parents for the IDL interface, identifying parent interfaces associated with the parents, wherein the parent interfaces include concrete parent interfaces, computing a set of directly implemented methods for the parent interfaces, generating an implementation of the IDL interface with the concrete parent interfaces to generate a plurality of delegation fields, generating an initialization method and a setting method for each of the plurality of delegation fields, and generating indirectly implemented methods with a body that delegates functionality to one of the plurality of delegate fields.

Abstract: A method and system for compiling multiple source language files that share a common library. The common library is represented in a common language that can be used by multiple different source languages. Font end compiler systems read the common language files that make up the common library and the source language files that use the library. Additionally, the front end systems produce common language files. The common language files produced by the front end systems can be used in the common library. The common language files may also be supplied to a back end system or runtime environment that further compiles the common language file to an executable form and executes the file. At runtime, the common language file is used by the runtime environment to layout the objects and methods used during execution.