Abstract: A method for optimizing functions is described. A query including an invocation of a function is received. A function declaration indicates that the function is associated with a first set of datatypes. At compile-time, static type-checking is performed on the query. During the static type-checking, a second set of datatypes is determined for the function. The second set of datatypes includes the datatype of each argument of the function that is specified in the invocation. The query is compiled, where compiling the query includes compiling the function with the second set of datatypes.

Abstract: A method of calculating a premium payable by an insured person on a life insurance policy uses the amount of claims made from a health insurance plan of the insured person and information regarding the general well-being and/or lifestyle of the insured person to calculate the premium payable. The premium is calculated using a base percentage amount which is then either increased or decreased. If the insured person has made few claims to the health insurance plan and they have taken positive steps to look after their health, they will be rewarded by a relatively lower premium on their life insurance policy.

Abstract: A method of data processing that converts a set of restricted terms, which is considered prohibited for use in source files, into an encrypted form, which prevents unauthorized users from reading the set of restricted terms. Further, the terms from a selected source file are encrypted with the same algorithm that was used on the set of prohibited terms. Then, a determination is made if the selected source file has one or more of the encrypted, restricted terms. In response to determining that the selected source file has one or more of the encrypted, restricted terms, an indication is given that the selected source file has one or more of the encrypted, restricted terms.

Abstract: The present invention provides methods and system for building a computer program, such as a dynamically linked library, capable of recognizing graphical user interface objects in HTML applications. The program accepts HTML DOM structures as input and processes the DOM by 1) creating one or more tokens for each parsed DOM element, and 2) parsing the generated tokens according to an application specific grammar. The program outputs user-interface objects that correspond to the graphical elements and other items displayed in the web browser.

Abstract: Methods, systems, and data structures are provided for normalizing data characteristics between applications. A first application is associated with a first data characteristic, and a second application is associated with a second data characteristic. A most-restrictive or common data characteristic is determined from the first and second data characteristics. The most restrictive or common data characteristic is enforced on access attempts to the first or second applications.

Abstract: Partial methods enable separation of method declaration and/or calls from method implementation. A partial method specifies a signature of a join or hook point in a class. Calls to a partial method specify a join or hook point in code that can optionally be linked with an actual method implementation of the same signature. Separate method implementations or other code related to a partial method are injected into a single program prior to execution. Unimplemented partial methods are treated as no operation instructions or otherwise ignored.

Abstract: A computer-implemented method for configuring a business process includes configuring a solution map and deriving a pre-configured set of collaborative business scenarios based on the solution map. The pre-configured set of collaborative business scenarios is then configured and a pre-configured set of event driven process chains is derived based on the configured set of collaborative business scenarios. Finally, the pre-configured set of event driven process chains is configured.

Abstract: Upon accessing binary that was generated by a compiler using corresponding source code, a potential reportable problem in the binary is identified. The binary includes a compiler transformed indication that the potential reportable problem is to be suppressed at least under some circumstances. The transformed indication is generated by the compiler using a corresponding untransformed indication in the corresponding source code. The transformed indication is then used to decide that the potential reportable problem should not be reported. Thus, artifacts within the source code itself may ultimately direct what problems are not to be reported on when the corresponding binary is analyzed after the compile phase.

Abstract: A compilation method is provided for correcting compiler errors that include compiler internal errors and errors produced by running a validation suite. The method includes running a compiler on a computer and storing a set of optimization levels in memory accessible by the compiler. The method includes receiving a source file with the compiler that includes a user-defined optimization level to be used in compiling the source file. The method includes identifying a set of functions within the source file and using compiler components to compile these functions using the original optimization level. When the compiling results in an internal error occurring and being reported for one or more of the functions, the method includes using an optimization adjustment module to process the internal error and assign an adjusted or lower optimization level to the one or more functions and recompiling of these functions again with the lower optimization level.

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 compilation method is provided for automated user error correction. The method includes using a compiler driver run by a processor to receive a source file for compilation. With a compiler component invoked by the compiler driver, the method includes identifying an error in the source file such as a linking problem or syntax error in the user's program. The method includes receiving with the compiler driver an error message corresponding to the identified error. With an error corrector module run by the processor, the method includes processing the error message to determine an error correction for the identified error in the source file. The compiler driver modifies the source file based on the error correction and compiles the modified source file with the compiler component.

Abstract: A method for string matching includes accepting an input regular expression comprising one or more nested references to respective referenced regular expressions. The nested references in the input regular expression are replaced with the respective referenced regular expressions, so as to provide a modified regular expression that does not contain nested references. The modified regular expression is matched to a target string.

Abstract: A method for producing parallel computer programs by using a compilation method that produces executable computer programs having an undefined execution order. The execution order is defined during execution of the program depending on the execution architecture. This allows the best possible level of concurrent execution in different architectures. The compilation method includes producing data dependency and data flow graphs that are used for executable code generation.

Abstract: An apparatus and a method for searching and caching results of pure functions in a computer program is described. The computer program is parsed to identify pure functions. A computed result of the identified pure functions is stored and shared with at least one process of the computer program. Each identified pure functions is replaced with the computed result of the corresponding pure function.

Abstract: A system and method for dynamically associating an application with an extension service to generate an extended, dynamically linked version of the application. The application is configurable for deployment on an electronic device and for subsequent interaction with the extension service during execution through communication messages defined in a structured definition language. The system and method include a parser module configured for analyzing a set of service metadata descriptors to identify a communication interface associated with the extension service, such that the service metadata descriptors describe the communication interface including structure and type of parameters expected by the extension service for use in manipulation of the communication messages.

Abstract: A system including spreadsheet sheets, makes calculations and data transformations, which is available through a programming interface, and conforms to the grammar and syntax of a target software development language is presented. The system includes an Object Model with Data Structures representing entities involved in spreadsheets. The system includes a Parser and Code Generator that extracts data from a body of spreadsheet data, instantiates instances of Data Structures of the Object Model to represent the spreadsheet data, parses the data and formulas contained in the cells of the spreadsheets, iterates through the instantiated instances of the Data Structures, and generates source code that performs the calculations and data transformations embodied in the spreadsheet data. The system includes a Calculation Engine with software base classes that implement the common structural and data access features of spreadsheet data, and further implement the operations of common spreadsheet functions and operators.

Abstract: A method for configuration of a program with a plurality of configuration variables to operate on a computer system that includes obtaining a plurality of priority semantics for the plurality of configuration variables, wherein the plurality of priority semantics are heterogeneous, assigning a value for each of the plurality of configuration variables based on the plurality of priority semantics, and configuring the program using the value to operate on the computer system.

Abstract: A process for detecting errors in computer code in C/C++ language in a computer, which comprises the operations of:—making available in said computer a source computer program (P) containing computer codes in C/C++ language; compiling (Z) said source computer program (P) to obtain an executable program (E); and—executing (240) said executable program (E) to generate (245) an error report (R). According to the invention, said method comprises, prior to the operation of compilation (Z): executing an operation of syntactic analysis (AS) to identify variables (x) having a structure of vector or pointer; modifying said source computer program (P) via the application to said identified variables (x) of a test function (f ( . . . ); io_sper; io_sper2; io_sper3; io_sper4) that is able to veriCy, during the operation of execution, whether an index (y) supplied for said variable x is valid.

Abstract: A method includes receiving a modeling template, the modeling template comprising a plurality of modeling constructs and profile constructs, each profile construct generated from a modeling profile and comprising an extension of one of the modeling constructs. The method further includes parsing the modeling template into the plurality of modeling constructs and profile constructs. One or more object-oriented constructs are defined based, at least in part, on the parsed modeling constructs and profile constructs. Source code is automatically generated in an object-oriented programming language based, at least in part, on the defined object-oriented constructs. The object-oriented programming language comprises an object-oriented programming language with embedded inferencing.

Abstract: A system that provides programming language translation includes a first compiler that compiles a source file in a first programming language into a parsed representation of the first programming language, and a transformation component that receives the parsed representation and generates a token stream from the parsed representation. The token stream comprises second language tokens of a second programming language and at least one compilation phase of the first compiler is skipped. The system further includes a second compiler that compiles the token stream into an object code and skips at least one compilation phase of the second compiler. The transformation component provides the token stream to the second compiler in memory.

Abstract: Methods, systems, and apparatus, including computer program products, for processing input data and for defining processing operations to be performed on such data. Input data is processed according to a data parser description associated with the input data format, and output data is generated based on the processing. The data parser description includes a plurality of leaf nodes and a plurality of branch nodes arranged in a tree structure. The leaf nodes each have an associated function. Each of the branch nodes has one or more associated child nodes selected from leaf nodes and other branch nodes. The nodes of the data parser description are evaluated in an order defined by the tree structure. For branch nodes, one or more of the associated child nodes are evaluated; for leaf nodes, the associated function is executed based on data in a current location in the input data.

Abstract: Syntax for creating object instances utilizing expressions instead of statements. A syntax component facilitates extension of conventional object-creation-expression syntax. An initializer component provides for initialization of a newly-created entity via object and collection initializers. The initializer component provides initialization of the newly-created entity utilizing an object initializer where the object initializer specifies values for one or more fields or properties of the newly-created entity which is an object, and consists of a sequence of member initializers enclosed by tokens and separated by commas. The initializer component can also provides initialization of the newly-created entity utilizing a collection initializer when the underlying object implements a certain interface or implements a certain pattern. An overloading constructor can be called as part of the initialization process.

Abstract: A mechanism is provided to facilitate complex textual pattern matching. Regular expressions are specified utilizing a set of rules of various simplicity/complexity. These rules are subsequently employed to generate a more complex regular expression described by the rules, which can be passed to a regular expression engine to identity textual patterns as a function thereof.

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: Automated (e.g., compiler implemented) techniques provide safe secure software development. One exemplary illustrative implementation addresses undefined behavior in the C and C++ programming languages.

Abstract: A method, system and computer program product for performing error correction are disclosed. The method includes performing on source code a selected compilation operation from among a set of compilation operations and, responsive to encountering an error in the selected compilation operation, running an error handler to isolate the error utilizing data logged for the compilation operation. Responsive to determining that the error handler has not sufficiently isolated the error, a source code modifier is run to modify a portion of the source code selected by reference to the data logged for the compilation operation.

Abstract: A front end component and a technique are provided. The front end component allows a transformation rule writer to specify syntax structure of interest, as well as what action to take when a syntax structure of interest is found. Example syntax structures include function call, variable declaration, math expression, etc. Typical actions include matching, replacement, or copying. The technique allows transformation tool writers to translate the specification into actual query and manipulation commands on the program representation. It is structured to be target language agnostic and, therefore, can be easily re-targeted to different programming languages.

Abstract: One aspect of the invention is a transaction processing system comprising a software service operable to receive a transaction request and to generate a first object associated with the transaction request. An object generator may convert the first object into a first document written in a self-describing language. A document generator may convert the first document into a first transaction message according to a schema associated with a first transaction type determinable from the first document.

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: System and method for implicit downcasting at compile time in a data flow program. A first data flow function in an object-oriented dataflow program is identified, where the first function includes an input of a parent data type and an output of the parent data type. The first function is analyzed to determine if the output preserves the run-time data type of the input. A second dataflow function in the object-oriented data flow program is identified, where the second function includes a program element that calls the first function, passing an input parameter of a child data type of the parent data type as input. If the analysis determines that an output parameter returned by the output of the first function will always be of the child data type, the program element is automatically configured at compile time to always downcast the output parameter from the parent data type to the child data type at run-time.

Abstract: Disclosed is an apparatus, including a memory for receiving a resource descriptor, the resource descriptor including a uniform resource identifier (URI) for a particular resource and an associated search query for locating the particular resource; and a controller, coupled to the memory, for initiating an access process for the particular resource using the resource descriptor. A method of retrieving a particular resource, comprising: parsing a resource descriptor into a uniform resource identifier (URI) for the particular resource and an associated search query for locating the particular resource; and initiating an access process for the particular resource using the URI and the associated search query.

Abstract: Character validation systems and methods are implemented. Characters in a data processing system may be may be represented by a set of n-bit data values, however not all n-bit values necessarily represent valid characters. Each data value corresponding to a character of a stream of characters may be validated in response to a member of a data structure corresponding to the value, in which each member of the data structure includes validity information for a corresponding data value. The member may be addressed by indexing into the structure with the data value.

Abstract: String replacement is performed in text using linguistic processing. The linguistic processing identifies the existence of direct or indirect links between the string to be replaced and other strings in the text. Morphological, syntactic, anaphoric, or semantic inconsistencies, which are introduced in strings with the identified direct or indirect links to the string that is to be replaced are detected and corrected.

Abstract: Modified compilers and other development tools provide implied line continuation within a sequence of syntax tokens of a programming language grammar which includes multiple semantic contexts and which uses line termination as presumptive statement termination. When source code parsing encounters a line terminator adjacent a context-dependent implicit line continuation token in an associated semantic context, an explicit decision is made whether to imply line continuation. Line continuation may also be implied in response to other specified tokens.

Abstract: A compiler implemented software cache is provided in which non-aliased explicitly fetched data are excluded are provided. With the mechanisms of the illustrative embodiments, a compiler uses a forward data flow analysis to prove that there is no alias between the cached data and explicitly fetched data. Explicitly fetched data that has no alias in the cached data are excluded from the software cache. Explicitly fetched data that has aliases in the cached data are allowed to be stored in the software cache. In this way, there is no runtime overhead to maintain the correctness of the two copies of data. Moreover, the number of lines of the software cache that must be protected from eviction is decreased. This leads to a decrease in the amount of computation cycles required by the cache miss handler when evicting cache lines during cache miss handling.

Abstract: An object-oriented query to retrieve data from a data source stored on a data storage device connected to a computer is processed. One implementation involves receiving a Java Query Language (JQL) user query, compiling the JQL query using a Java compliant compiler, and detecting any compilation error due to a syntax error in the JQL query. If a compilation error is detected, then informing the user of the compilation error such that the user may correct the syntax error in the JQL query. Otherwise if a compilation error is not detected, then processing the JQL query for execution.

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: Methods and systems for manipulating information represented by computer code are described. Macroinstructions that are used to analyze an input are accessed. The macroinstructions are written according to a first computer system language. The macroinstructions are rewritten as strings according to a second computer system language. The strings are included in an exportable representation.

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: Embodiments of a method and system for compiling code, such as program-generated code, are disclosed herein. The method and system efficiently encode combined range and stride checks. For example, the method and system are operable to encode combined range and stride checks as they occur in a translation of switch statements. The method and system can generate code to perform the range and stride check, and to branch to the case body, if the range and stride checks are successful. The various embodiments may operate to provide an efficient code transformation, better code density, and processing performance. Other embodiments are described and claimed.

Abstract: Described is a system and method for declaring a resource element in markup that is intended to be instantiated lazily only upon use at run-time rather than always at markup load time. In one embodiment, the invention provides a parent resources tag that encloses resource elements that may be any type of markup element. On compile, a specially prepared compiler/parser identifies the Resource tag and creates definitional information sufficient to describe the resource elements in such a manner that the resource elements are defined but not created at run-time when the markup is first loaded, and are created only upon use at run-time. A resource may be defined to be shared or non-shared. If shared, the resource is instantiated only once and that same instance is handed out each time the resource is accessed. If non-shared, a new instance of the resource is always created and handed out on each access of the resource.

Abstract: A system, method and media for a method for resolving dependencies given a first package and a first type, comprising determining one or more anti-dependencies for the first package; and compiling a first one of the anti-dependencies if at least one of the following is true: 1) the first anti-dependency has a compilation error; and 2) the first anti-dependency depends on a second package wherein the second package that has a second type with the same name as the first type. This abstract is not intended to be a complete description of, or limit the scope of, the invention. Other features, aspects and objects of the invention can be obtained from a review of the specification, the figures and the claims.

Abstract: Systems and methods to indicate whether to store a database query language module in a local directory or a global directory are disclosed. An application program can be created once, tested once, and deployed in separate environments. The database query language modules can be shared among a group of application programs running in a common environment. Separate query language modules can be maintained for each environment.

Abstract: Many integrated development environments provide “intelligent feedback” to developers. Current “intelligent feedback” techniques may not work well with source code files comprising context sensitive programming languages because edits to one place in the code may change the meaning of arbitrary other places in the code, thus requiring additional full semantic parses to maintain correctness of the system. As provided herein, context-free “name” parsing may be performed to support entity candidate recursive semantic parsing in determining the meaning of the entity. A name parse may be performed to build and/or update a name table and a range table comprising names of entities and their positions within a source code file. Upon receiving a request to determine the meaning of a selected entity within the source code file, the tables may be queried to determine entity names and locations that are to be semantically parsed to determine a selected entity meaning.

Abstract: A method for and a pre-compiling device capable of easily changing a software structure in compliance with a hardware characteristic. The pre-compiling device includes a source code scanner for scanning for a source code file, retrieving a configuration directive, analyzing a syntax of the directive, and outputting a tree of a lexical unit corresponding to the retrieved configuration directive; a core for outputting the configuration directive in a configuration state; code generation modules for outputting a configuration state output from the core as a programming language that has no correlation with a flow of the lexical unit; and programming language modules for transferring information on a comment syntax of the corresponding language to the source code scanner and the code generation modules, and receiving the programming language that has no correlation with the flow of the lexical unit outputted from the code generation modules and outputting source codes.

Abstract: Architecture that extends existing types including constructed and sealed types using extension methods. Extension methods are static methods that can be invoked using instance method syntax. Extension methods are declared by specifying the keyword “this” as a modifier on the first parameter of the methods. Extension methods have all the capabilities of regular static methods. In addition, once imported, extension methods can be invoked using instance method syntax. Also disclosed are rules for importing extension methods, and extension method invocations. Extension methods are imported through using-namespace-directives. In addition to importing the types contained in a namespace, a using-namespace-directive imports all extension methods in all static classes in the namespace. In effect, imported extension methods appear as additional methods on the types that are given by their first parameter and have lower precedence than regular instance methods.

Abstract: A method and apparatus to perform frame parsing are described wherein a configuration module stores configuration information and a parsing module, connected to the configuration module, receives a frame of information and determines a frame format associated with the frame. Configuration information corresponding to the protocol is retrieved, and a set of hardware elements are reconfigured to parse the frame. Other embodiments are described and claimed.

Abstract: The present invention extends to methods, systems, and computer program products for managing set membership. A set definition is translated into one or more membership conditions. Each membership condition includes statements about the attributes of a resource that are to be true if the resource is to be included in the set. For any given resource request, resources touched by the request are compared to membership conditions applicable to the touched resources. Thus, embodiments of the invention minimize the work that is done to determine which sets a resource may or may not belong to whenever a resource is modified. Accordingly, based on available resources, embodiments of the invention can scale to accommodate larger numbers of sets and larger numbers of potential members of sets.

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: The present invention discloses a program converting unit for generating a machine language instruction from a source program for a processor that manages an N-bit address while processing M-bit data, N being greater than M, and such a processor that runs the converted program. The program converting unit comprising: a parameter holding unit for holding a data width and a pointer width designated by a user; the data width representing the number of bits of data used in the source program while the pointer width representing the number of bits of an address; and a generating unit for generating an instruction to manage the data width when a variable operated by the instruction represents the data, and for generating an instruction to manage the pointer width when a variable operated by the instruction represents the address.