Abstract: A single software project in an integrated development environment (IDE) may be built for multiple target environments in a single build episode. Multiple different output artifacts may be generated by the build process for each of the target environments. The output artifacts are then deployed to the target environments, which may be homogeneous or heterogeneous environments. The same source project may be used to generate multiple output artifacts for the same target environment.

Abstract: During compilation, the interval bounds for a programmable culling unit are calculated if possible. For each variable, interval bounds are calculated during the compilation, and the bounds together with other metadata are used to generate an optimized culling program. If not possible, then an assumption may be made and the assumption used to compile the code. If the assumption proves to be invalid, a new assumption could be made and the code may be recompiled in some embodiments.

Abstract: An apparatus and method for accelerating Java translation are provided. The apparatus includes a lookup table which stores an lookup table having arrangements of bytecodes and native codes corresponding to the bytecodes, a decoder which generates pointer to the native code corresponding to the feed bytecode in the lookup table, a parameterized bytecode processing unit which detects parameterized bytecode among the feed bytecode, and generating pointer to native code required for constant embedding in the lookup table, a constant embedding unit which embeds constants into the native code with the pointer generated by the parameterized bytecode processing unit, and a native code buffer which stores the native code generated by the decoder or the constant embedding unit.

Abstract: A method includes, by one or more computing devices, determining JavaScript statements to be evaluated, parsing the JavaScript statements, translating the JavaScript statements into Java bytecodes and JavaScript-specific instructions, executing the Java bytecodes in a Java execution engine, calling a JavaScript run-time engine from the Java execution engine, handling one or more semantic operations associated with the JavaScript-specific instructions through use of the JavaScript run-time engine, and providing return values to the Java execution engine. The statements are configured for execution on a computing device. The set of Java bytecodes and JavaScript-specific instructions is configured to conduct symbolic execution of one or more portions of the JavaScript statements. The symbolic execution is configured to evaluate the JavaScript statements.

Abstract: A technique for serializing both logical and physical meta-model information in a single file is disclosed. In an embodiment, the logical meta-model information is serialized in an Extensible Marking Language (XML) schema compliant format, and the physical meta-model information is inserted into the logical meta-model in suitable locations such that the mappings between the logical and physical meta-models are preserved. In an embodiment, an XML “appInfo” annotation is used to carry physical meta-model information used by multiple applications and suitably placed in a nested configuration with its corresponding logical meta-model information.

Abstract: A computing method includes accepting a definition of a computing task, which includes multiple Processing Elements (PEs) having execution dependencies. The computing task is compiled for concurrent execution on a multiprocessor device, by arranging the PEs in a series of two or more invocations of the multiprocessor device, including assigning the PEs to the invocations depending on the execution dependencies. The multiprocessor device is invoked to run software code that executes the series of the invocations, so as to produce a result of the computing task.

Abstract: Systems, methods, and computer-readable media having computer-executable instructions embodied thereon that generate notifications that are delivered to translators who provide updates or translations that are included in localization resources for software applications are provided. Resources are stored on a cloud device in a development file or a public database. The public database stores the content that is selected for modification or translation. The languages may be selected by one or more application developers or may be based on a geographic region associated with the content or the language currently associated with the content. One or more translators are identified based on matches to translator profiles included in the public database. The matching translators receive notifications, which inform the translator that updates or translations are requested. In turn, the translators may access the public database and provide the updates or translations.

Abstract: A storage medium containing computer code, which when executed by a computer causes the computer to perform the steps of creating a second file of messages to be outputted by the software from a first file of messages, the messages in the first file being written in a first language and executing the software using the second file. The creating of the second file includes for each message in the first file, applying specified rules to form a second message by changing the character length of the second message, filling in any blank characters in the second message with a dummy character, inserting characters from the target language into prescribed places in the second message to form a second message having both characters of the first language and characters of the target language, and copying the second message into the second file.

Abstract: A method of transmitting data is disclosed. At least one system block of a system-on-chip (SoC) is modeled at an untimed functional level in first and second untimed functional models. First and second transaction level (TL) models of the at least one system block system block are modeled at a transaction level (TL) using the first and second untimed functional models, respectively. First and second cycle accurate (CA) models are modeled at a cycle accurate (CA) level using the first and second TL models, respectively. Data is transmitted from the first untimed functional model to the first CA model, from the first CA model to the second CA model via a CA bus, and from the second CA model to the second untimed functional model.

Abstract: In a computing system having virtualization software including a guest operating system (OS), a method for executing guest OS instructions that includes: replacing each of one or more guest OS instructions with: (a) a translated instruction, which translated instruction is a one-to-one translation, or (b) a trap instruction.

Abstract: A computer-implemented method and apparatus for transforming code to embedded environments, the method comprising: receiving program code not complying with a limitation of an embedded computing environment; transforming at least part of the program code to modified program code in order for the modified program code to be in compliance with the limitation; and storing the modified program code on a storage device. wherein the modified program code complies with the limitation of the embedded computing environment.

Abstract: A physical computer system includes a processor and a memory configured to store instructions executable by the processor to implement a virtualization module, which in turn implements virtual machine(s) that execute an operating system distinct from any underlying operating system executed by the physical computer system. In response to a client request to initially perform a repeatable computation, the virtualization module instructs that the virtual machine(s) archive an original initial state of the repeatable computation, initially perform the repeatable computation, and archive an original terminal state of the repeatable computation.

Abstract: A method and an apparatus that modify pointer values pointing to typed data with type information are described. The type information can be automatically checked against the typed data leveraging hardware based safety check mechanisms when performing memory access operations to the typed data via the modified pointer values. As a result, hardware built in logic can be used for a broad class of programming language safety check when executing software codes using modified pointers that are subject to the safety check without executing compare and branch instructions in the software codes.

Abstract: The subject system provides the ability to parallelize pre-existing serial code by importing and encapsulating all of the serial code into an object orientated flowchart language utilizing an analytic engine so that the imported code can be efficiently executed taking advantage of the partially ordered transitive flowchart system. The importation examines the serial code to ascertain what elements may be processed under an atomic time to instantiate them as either Action or Test objects, whereas statements which require more than atomic time are instantiated as Task object, with the Action, Test and Task objects being processable by separate processors to establish parallel processing, or by the multitasking afforded by the partially ordered transitive flowchart system.

Abstract: Systems and methods for just-in-time (JIT) code compilation by a computer system. An example method may comprise identifying a defined pattern in a byte stream, evaluating a conditional expression associated with the pattern, and compiling the byte stream into a native code, while excluding, in view of the evaluating, a portion of byte stream associated with the pattern.

Abstract: A method for forming an extension to a scripting language compiler is disclosed. A compiler of a machine receives a source code that has a new keyword to a scripting language of the compiler. An extension compiler module processes the source code to support the new keyword. The compiler and the extension compiler module generate an executable machine code based on a process of the extension compiler module and the compiler.

Abstract: A method for storing and retrieving data in a storage node of a data store and storage node of a data store, storing in main-memory at least one segment of a relational table. The storage node includes at least one computational core running at least one scan thread each dedicated to the scanning of one of the at least one segment. At least one scan thread uniquely, continuously and exhaustively scans the dedicated segment of the relational table. The storage node receives and processes batches of query and update operations for the at least one segment of the relational table. The query and update operations of a batch are re-indexed at beginning of each scan by the scan thread. Then, the indexed query and update operations of a batch are independently joined to data records of said segment that match with predicates of the indexed query and update operations.

Abstract: A system and method for producing a massive number of diverse program instances so as to deter differential attacks, collusion, and similar hostile actions. Code portions are shown to be defined in various manners, instantiated, and aggregated. The system and method establishes a very large number of program instances that may be deployed. Furthermore, testing is accomplished over a minimal set of instances to provide for high test coverage and high confidence over the fully deployed in stance set without incurring a high penalty.

Abstract: The present invention extends to methods, systems, and computer program products for aliasing buffers. Embodiment of the inventions supporting buffer aliasing through introduction of a level of indirection between a source program's buffer accesses and the target executable physical buffers, and binding the logical buffer accesses to actual physical buffer accesses at runtime. A variety of techniques for can be used supporting runtime aliasing of buffers, in a system which otherwise disallows such runtime aliasing between separately defined buffers in the target executable code. Binding of logical buffer accesses in the source program to the actual physical buffers defined in the target executable code is delayed until runtime.

Abstract: The present invention provides systems and methods which allow the translation of a first representation into an intermediate representation and then into a target representation. The first representation can take numerous forms, including a system model that contains hardware components, software components or some combination thereof. Additionally, the target representation can be in the form of a desired system implementation. The intermediate representation generated from the first representation can include both parallel and serial processes from the first representation. This intermediate representation then uses both serial and parallel processing techniques operating on the system model from within a single intermediate representation to translate the system model of the first representation into a target representation. The target representation may be in a format that is readily used in the creation of a system implementation by a user.

Abstract: A collaborative language translation system, computer readable storage medium, and method is disclosed that allocates as between automated and manual language translation services, wherein a manual language translator creates a unique database including manual translator languages capability, accuracy skill level, scope of translation project desired, and translation turnaround time. Also a client creates a unique information set that includes original language, desired language, scope of translated material, client desired translation formats, client desired translation timing, and client desired translation accuracy. Also included in the system is an automated language translation database and instructions for allocating a flow of the unique information set as between the unique database and the automated language translation database based upon the client unique information set and instructions to perform the selected language translation for the client.

Abstract: One embodiment of the present invention sets forth a technique for translating application programs written using a parallel programming model for execution on multi-core graphics processing unit (GPU) for execution by general purpose central processing unit (CPU). Portions of the application program that rely on specific features of the multi-core GPU are converted by a translator for execution by a general purpose CPU. The application program is partitioned into regions of synchronization independent instructions. The instructions are classified as convergent or divergent and divergent memory references that are shared between regions are replicated. Thread loops are inserted to ensure correct sharing of memory between various threads during execution by the general purpose CPU.

Abstract: A graphical user interface (GUI) type model helps application designers create error free graphical user interface applications (GAPs). The GUI type model provides a reference set of GUI element types. The application designer assigns a selected GUI element type to each GUI element in a GAP design. The GUI element types help ensure consistent and proper treatment of the GUI element types at every stage in the development of the application, from initial planning and design, to compilation and execution.

Abstract: An aspect of the invention includes transforming a source model to a target model. A source model is received and a transformation specification that includes a set of rules is accessed. Each rule includes a pattern description and a production component. The pattern description includes a pattern in the source model and the production component includes an algorithm for generating an output in the target model from the pattern. For each expression in the source model, the expression is decomposed into sub-expressions, matching rules in the transformation specification for the expression and the sub-expressions are detected, one of the matching rules having the most specific pattern description is selected, and the production component of the selected rule is executed to generate the output in the target model. The target model is created from the generated output.

Abstract: Methods and apparatus are provided to access and present data from a process executing on a separate device, with the data being presented in a form suitable for the type of data, such as a graphical structure that represents the data. The methods include receiving a request to display a first data object stored in a memory of a second computing device, wherein the first object is of a first data type in a process configured to execute on the second computing device, generating an expression configured to convert the first data object to a defined data format, sending the expression to the process, executing the expression in the process to produce intermediate data that represents the first object in the defined format, receiving the intermediate data, creating a second object of a second data type based upon the intermediate data, and displaying a graphical structure of the second object.

Abstract: Systems and methods are disclosed for receiving a first specification that identifies program code behavior associated with a plurality of documents. The specification includes an input-output pair with a first data entity and a second data entity. The systems and methods further include identifying one or more documents, within the plurality of documents, that are configured to (i) use at least a portion of the first data entity as an input to program code associated with particular ones of the documents, and (ii) provide at least a portion of the second data entity as output associated with the program code, wherein the particular ones of the documents correspond to a positive matching between one or more constraints associated with each document and one or more constraints associated with the specification, and generating search results comprising the identified one or more documents.

Abstract: Techniques provided implement automatic data type annotation in dynamically-typed source code. A codebase, which may comprise a plurality of source code files, is scanned at a global level. The resulting scanned data may describe characteristics of the codebase, including variable and function usage. Based on inferences drawn from the scanning, data types are determined for different variables, expressions, or functions to facilitate conversion from dynamically-typed source code to statically-typed source code. For example, if a function is called once with a parameter value of data type A (e.g., class A), and another time with a parameter value of data type B (e.g., class B), a conversion tool may annotate the parameter variable in the declaration of the function with a data type D (e.g., class d) when data type D is identified as a common ancestor (e.g., superclass) to both data type A and data type B.

Abstract: A class definition syntax that leverages the array and math-oriented nature of a dynamically typed array-based programming language is discussed. Some embodiments of the present invention provides a mechanism for using meta-data to define a class implemented in the dynamically typed array-based programming language. The meta-data provide an easy way to provide class definitions and allow a user to access the class definitions from objects. The meta-data also support extension of class definitions without introducing backward incompatibility.

Abstract: The invention comprises (i) a compilation method for automatically converting a single-threaded software program into an application-specific supercomputer, and (ii) the supercomputer system structure generated as a result of applying this method. The compilation method comprises: (a) Converting an arbitrary code fragment from the application into customized hardware whose execution is functionally equivalent to the software execution of the code fragment; and (b) Generating interfaces on the hardware and software parts of the application, which (i) Perform a software-to-hardware program state transfer at the entries of the code fragment; (ii) Perform a hardware-to-software program state transfer at the exits of the code fragment; and (iii) Maintain memory coherence between the software and hardware memories. If the resulting hardware design is large, it is divided into partitions such that each partition can fit into a single chip. Then, a single union chip is created which can realize any of the partitions.

Abstract: A medium, method, and apparatus are disclosed for eliding superfluous function invocations in a vector-processing environment. A compiler receives program code comprising a width-contingent invocation of a function. The compiler creates a width-specific executable version of the program code by determining a vector width of a target computer system and omitting the function from the width-specific executable if the vector width meets one or more criteria. For example, the compiler may omit the function call if the vector width is greater than a minimum size.

Abstract: Embodiments of the present invention provide a method, system and computer program product for USING range validation during assembly of an assembly language program. In an embodiment of the invention, a method for USING range validation during assembly of an assembly language program has been provided. The method can include parsing assembler language source code loaded for assembly in an assembler executing in memory of a computer. The method also can include identifying a USING statement in the source code establishing a base address as the content of a register. Finally, in response to additionally identifying a subsequent statement in the source code that modifies the content of the register, a warning of an invalid USING range can be generated.

Abstract: The present disclosure involves systems, software, and computer implemented methods for providing a scripting language for business applications. One process includes operations for providing a scripting language editor for generating software components for a business application, the scripting language editor configured to receive scripting language input. A scripting language file saved by the scripting language editor is identified. Metadata associated with at least one of a business object or a data type of a platform of the business application is retrieved. A business application language file is generated based on the scripting language file and the retrieved metadata.

Abstract: Embodiments are directed to implementing a generic SIMD data type in software code. In an embodiment, a computer system accesses a portion of software code that includes an algorithm with a generic SIMD data type that includes a variable number of elements. The algorithm with the generic SIMD data type is to be processed by a specific processor that includes various specific hardware features. The computer system determines at runtime a portion of customized processor-specific code that is to be used with the specified processor based on the generic SIMD data type, wherein the runtime determination resolves the number of elements that are to be used with the specified processor. The computer system also processes the software code including the algorithm with the generic SIMD data type using the determined, customized processor-specific code.

Abstract: Methods for mapping a function pointer to the device code are presented. In one embodiment, a method includes identifying a function which is executable by processing devices. The method includes generating codes including a first code corresponds to a first processing device and a second code corresponds to a second processing device. The second processing device is architecturally different from the first processing device. The method further includes storing the second code in a byte string such that the second code is retrievable if the function will be executed by the second processing device.

Abstract: Particular embodiments optimize a C++ function comprising one or more loops for symbolic execution, comprising for each loop, if there is a branching condition within the loop, then rewrite the loop to move the branching condition outside the loop. Particular embodiments may further optimize the C++ function through simplified symbolic expressions and adding constructs forcing delayed interpretation of symbolic expressions during the symbolic execution.

Abstract: A method, a system and a program product provide for defining for an information technology (IT) system that may be modeled within the context of a plurality of architecture viewpoints, and whose model elements are defined within a configuration file, a plurality of architecture viewpoints within a single UML model. The method, the system and the program product also provide for synchronously automatically updating a remainder of the architecture viewpoints when one of the architecture viewpoints is manually updated.

Abstract: Technologies are described herein for providing power savings in a data center. Some example technologies may identify some user-provided hardware independent power saving codes from multiple virtual machines within the data center. The technologies may convert at least a portion of the user-provided hardware independent power saving codes into a device power management message specific to a computing system in the data center. The technologies may provide the device power management message to the computing system. The computing system may be configured to enable or disable one or more devices within the computing system according to the device power management message.

Abstract: The illustrative embodiment of the present invention provides a platform that enables a content developer to distribute uniform content to multiple types of requesting mobile devices. By authoring content in a generic markup language and using the technologies included in the Mobile Content Framework (MCF), the content developer is able to provide content to multiple types devices without providing different versions of the content. The content may be authored originally in the generic markup language or translated from other languages into the generic markup language by the MCF. The MCF exploits the capabilities and accommodates the limitations of different types of wireless devices by converting generic markup language content to device-specific content. The MCF interacts with device registries holding records of the device attributes in order to provide the device-specific content. The MCF handles these issues for current mobile devices while also being extensible for future mobile devices.

Abstract: A system, method and computer program product for a system, method and computer program product for using a GPU of a host computer system for supporting functionality of a number of VMs implemented on the host computer system. The GPU usage by a VM includes e.g., sharing a video card with a VM hypervisor; executing applications controlled by the hypervisor; optimization of a snapshot memory consumption; CRC calculations for memory ballooning; on-the-fly disk data encryption; indexing disk data; efficient data compression for HDD; compression of the VM execution trace data and video traffic; computations for backup storage; AV scanning; firewall-related services; traffic encryption (IPSec); processing and restoration of disk transactions; optimization of incremental backups (creation and comparison of snapshots); traffic indexing and replay; isolating some applications on the GPU for virus protection; optimization of runtime compilers.

Abstract: The invention relates to data processing apparatus and methods for automated conversion of software applications between computing platforms when said platforms do not support common set of programming languages. The Conversion System (CS) consists of several components. The Converter is a computer system that translates source application's code into target application's code. It uses set of methods to create in the target system's programming language constructs that represent source system language's constructs and that the Run Time Library (RTL) implements and supports at run time. The RTL also provides for supporting multiple target computing platforms as it insulates converted code from each target platform's specifics.

Abstract: A requirements testing system facilitates the review and analysis of requirement statements for software applications. The requirements testing system generates test artifacts from the requirement statements. The test artifacts characterize the requirements statements to provide valuable analysis information that aids understanding whether the requirement statements are testable, what the intentions of the requirement statements are, and other useful analysis information. Because the system generates the analysis information from the requirement statements, the system provides benefits in terms of early feedback along the software application development timeline.

Abstract: Embodiments of the invention relate to generating security permissions for applications. A static analysis on an application is carried out to determine security exceptions and to determine the application components responsible for the security exceptions. The determined security exceptions are analyzed to calculate permissions required for each component. A security policy file that includes a hierarchy of the required permissions suitable for the type of application is formatted and applied to the application to provide a security enabled application.

Abstract: A computer-implemented method for providing an informal interface and a formal interface to a computing application using a computer is provided. The informal interface includes first routines, the first routines using an informal input format. The method also includes providing a formal interface using the computer, where the formal interface includes second routines. The second routines support developer functionality, and the second routines using a formal input format. The method includes receiving a first input having a first routine input format, the first routine input format complying with the informal input format, or a second input having a second routine input format, the second routine input format complying with the formal input format. The method includes processing the received first input or the received second input and performing a computing operation based on the processing.

Abstract: The present invention performs manipulations on the assembly file level. As a compiler outputs an assembly file, the assembly file may be inspected and modified before it is sent to the assembler. One or more of the following modifications may be made to the assembly file: rewrite certain symbols, scramble program symbols, reorganize declarations of global variables so that their layout and default values are known prior to linking, and identify initializer and de-initializer functions in order to make them callable through central initialization and de-initialization functions, respectively.

Abstract: Modelling a serialized object stream can include receiving a stream of bytes corresponding to the serialized form of a first object, creating an empty initial model for containing a generic object and a generic class, and, upon detection of a class from the stream, constructing a corresponding generic class object in the model using a processor. Upon detection of a new object from the stream, a corresponding generic object in the model can be constructed. Further objects and classes in the model that are associated with the generic objects and classes can be referenced.

Abstract: Systems and methods for replacing inferior code segments with optimal code segments. Systems and methods for making such replacements for programming languages using Message Passing Interface (MPI) are provided. For example, at the compiler level, point-to-point code segments may be identified and replaced with all-to-all code segments. Programming code may include X10, Chapel and other programming languages that support parallel for loop.

Abstract: In one embodiment, a decision tree is evaluated in interpreted mode while statistics are collected. The decision tree is then represented as source code, and each decision in the decision tree is annotated with instructions determined based on the collected statistics. The source code is compiled into machine code, and the machine code is optimized based on the instructions annotating each decision in the decision tree.

Abstract: Systems and methods for managing data, such as metadata or non-metadata such as content. In one exemplary method, a composite document is received and it is determined whether the composite document contains at least one subdocument and if it does, the method captures metadata and/or content from the subdocument and stores the captured metadata and/or content for use in future searches (or an immediate search). The metadata and/or content from the composite document is typically combined together with information about the hierarchy of the subdocuments in the document. The type of information in metadata for one type of file differs from the type of information in metadata for another type of file. Other methods are described and data processing systems and machine readable media are also described.

Abstract: A method is provided for translating sets of constraint declarations to imperative code sequences based on defining an instantiatable object per set, inserting calls to a notification callback mechanism on state modification and defining calls in the constraint context as imperative code sequences that, in response to these callbacks, take actions to maintain these constraints.

Abstract: The invention provides a computer-implemented method for estimating the cost of translating a body of text associated with a software application, wherein the software application is configured to perform one or more tasks. In particular the method comprises: determining one or more content types associated with the body of text, wherein each content type has an average word count per content unit; assigning a number of tasks associated with the software application to each content type, wherein each task has an associated number of content units; generating an estimated word count for each content type based on the number of tasks assigned to each content type and the average word count per unit for each content type; summing the estimated word count for each content type to generate an estimated word count for the body of text; and calculating an estimated translation cost based on the estimated word count.