Abstract: A data processing system, method, and instructions executable on a computer inspect the quality of software code. A summary report is generated that summarizes aspects of the current status of a software project. The summary report may include which portions of code have been written, which have been edited to predetermined standards, and which remain to be written. Errors in the code may be identified. Warnings associated with portions of the code may be generated, as well as suggested changes to the code. For comparison, the suggested code changes may be displayed along side of the corresponding portions of the pre-existing code that the suggested code is intended to replace. Hard coded values may be automatically identified. Text elements corresponding to each hard coded value may be automatically created. Subsequently, each hard coded value may be automatically replaced by the corresponding text element. Revisions to pre-existing code may be inspected.

Abstract: A system and method for dynamic instrumentation of an interpreted application. The method includes the operation of loading an interpreted code unit into a virtual machine. Testing instrumentation can then be inserted into the interpreted code unit using the virtual machine while the interpreted application continues executing. Another operation is executing the interpreted code unit with the testing instrumentation.

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

Abstract: The current invention describes a virtual machine designed to run on a variety of platforms of varied capabilities, and in particular describes support in the coding and development environment for assessing and managing the variation in capability and performance among the platforms.

Abstract: The present invention comprises: a converting step for converting a source program into a machine language program; an inserting step for inserting notifying instructions for notifying that the source program has been executed in the machine language program; and a program generating step for generating the executable program from the machine language program in which the notifying instructions are inserted. Further, in the inserting step, the notifying instructions are placed at the entry points of each basic block that constitutes the machine language program and the notifying instructions to which the same conditions as those of the conditional instruction groups are granted are placed at the entry points of conditional instruction groups provided in the machine language program. In the program generating step, identification information for identifying the notifying instructions is granted to each of the notifying instructions.

Abstract: A computer-implemented method for determining whether an array within a loop can be privatized for that loop is presented. The method calculates the array sections that require first or last privatization and copies only those sections, reducing the privatization overhead of the known solutions.

Abstract: The present invention generally relates to a method for describing network events in a service aware network (“SAN”). In addition, the present invention relates to software that performs the method and has a programming model containing protocol libraries, abstract protocol messages declarations, and network events. The method and software enable a user to define basic as well as complex network events in the application, presentation, session, transport and/or network layers of a communication model, which result in internet protocol (“IP”) level triggers or other triggers. Such triggers will result in actions which may be applicable in all layers of a communication model up to the highest layer. As a result, the method and software allow a user to describe a hierarchy of high level network events through a hierarchy of lower level events. In addition, a development system and an apparatus which utilizes the method and software are also provided.

Abstract: A method for constructing a software distribution image includes modifying zero or more to-be-compiled components of the software distribution image using pre-processing instructions to delineate modifications for inclusion or exclusion from a final compiled version of the to-be-compiled components. Modifying one or more not-to-be-compiled components of the software distribution image using pre-processing instructions to delineate modifications for inclusion or exclusion from a final ready-to-run version of the not-to-be compiled components. Preprocessing each of the zero or more to-be-compiled components to either include or exclude each of the delineated modifications of the to-be-compiled components based on desired characteristics of the software distribution image.

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

Abstract: 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: 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: 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: 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: 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: Noting that there is a case where a type of a pointer “this” in a member function can be specified, the present invention provides a program converting method in which a virtual function call can be converted into a direct function call, and by which improvement of execution performance as well as reduction of a code size of a program can be achieved. The program converting method is a method for converting a program described in an object-oriented language, including: analyzing, in the program, a type of an instance by which a method is called; extracting, from a definition of the method, a virtual method call which is called by the instance; and converting, based on the type of the instance analyzed by the analyzing, the virtual method call extracted by the extracting, into a direct method call.

Abstract: A system and method for parsing XML is provided. The method includes associating an input stream with a pull model parser, accepting requests to selectively parse out XML items from the input stream and retrieving metadata information associated with the parsed out XML items. The method further includes checking the pulled XML item to determine whether it conforms to XML syntax and/or semantic standards and validating the pulled XML item to determine whether it conforms to a selected DTD.

Abstract: A method, system, and computer product for processing information embedded in a text file with a grammar programming language is provided. A text file is parsed according to a set of rules and candidate textual shapes corresponding to potential interpretations of the text file are provided by compiling a script. An output is provided, which may include either a processed value corresponding to a particular textual shape, or a textual representation of the text file that includes generic data structures that facilitate providing any of the candidate textual shapes, where the generic data structures are a function of the set of rules.

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: A system for automation of processes in a working environment to achieve targeted deliverables, said system comprising: mapping means adapted to map discrete processes in a working environment; reader means adapted to read human instructions in relation to targeted deliverables at mapped discrete processes; interpreter means adapted to interpret said read instructions into a machine readable instruction format; compiler means adapted to compile said machine readable instruction format into a pre-defined operating system executable instruction format; packager means adapted to classify and package said operating system executable instruction format in a pre-defined format; and installer means adapted to install and deploy said packaged format in said working environment to complete the automation process and achieve targeted deliverables.

Abstract: Disclosed herein are systems, methods, and computer readable-media for obfuscating code. The method includes extracting a conditional statement from a computer program, creating a function equivalent to the conditional statement, creating a pointer that points to the function, storing the pointer in an array of pointers, replacing the conditional statement with a call to the function using the pointer at an index in the array, and during runtime of the computer program, dynamically calculating the index corresponding to the pointer in the array. In one aspect, a subset of instructions is extracted from a path associated with the conditional statement and the subset of instructions is placed in the function to evaluate the conditional statement. In another aspect, the conditional statement is replaced with a call to a select function that (1) calculates the index into the array, (2) retrieves the function pointer from the array using the index, and (3) calls the function using the function pointer.

Abstract: Immutable structures are employed to effect immutable parsing. In particular, an immutable parsing configuration, comprising a stack and lookahead buffer, is utilized by a parser to perform lexical and syntactical analysis of an input stream and optionally output an immutable parse tree or the like. Performance with respect to the immutable structures can be optimized utilizing sharing and lazy computation. In turn, immutability benefits are afforded with respect to parsing including safe sharing amongst services and/or across multiple threads as well as history preservation, among other things.

Abstract: A compiler includes: a syntax analyzer analyzing whether or not an operation described in a source program conforms to grammatical rules, and analyzing whether or not a combination of the operations defines an intrinsic function and details of processing operations of the intrinsic function; an intrinsic function definition database storing a definition of the intrinsic function and the details of the processing operations of the intrinsic function, as analyzed by the syntax analyzer; a code generator generating machine instructions from the source program based on a result of the processing of the syntax analyzer; and a code optimizer optimizing the machine instructions to machine instructions corresponding to the details of the processing operations of the intrinsic function, if a string of the machine instructions generated by the code generator are in agreement with the details of the processing operations of the intrinsic function stored in the intrinsic function definition database.

Abstract: A method for automatically analyzing formulas and adding pattern annotations to quantifiers based on a database of common pattern idioms. The method involves matching base pattern inference for Satisfiability Modulo Theories (SMT) solvers. The method uses a database for fault detection in externally supplied pattern annotated formulas. The method also uses matching code trees to mixed second-order pattern matching.

Abstract: A method and apparatus for detecting script language viruses is provided. The apparatus includes a script language processor, a detection data processor and a detection engine. The script language processor prepares language description data corresponding to at least one script language. The detection data processor prepares detection data for viral code corresponding to the script language virus. The detection engine lexically analyzes a data stream using the language description data and the detection data to detect the viral code. The language description data may correspond to language definition rules and language check rules. The data stream may be converted to a stream of tokens, wherein the lexical analysis is performed on the token stream. The script language virus detection apparatus may be a computer program stored on a computer readable medium and/or transmitted via a computer network or other transmission medium.

Abstract: In a wireless communications device, methods and systems for processing a plurality of AT commands are disclosed. Aspects of the method may comprise generating AT command codes for the plurality of AT commands. The generated AT command codes for the plurality of AT commands may be compiled and linked with operating code. The linked AT commands and operating code may be executed. At least one command definition corresponding to at least one of the plurality of AT commands may be generated. The plurality of AT commands may be arranged according to the generated command definition. At least one pattern within at least a portion of the arranged plurality of AT commands may be selected and at least one command expression may be matched with the selected at least one pattern. The AT command codes for the plurality of AT commands may be generated utilizing the matched at least one command expression.

Abstract: A system and method for validating arguments in a request to activate an application is provided. An application may include declarations with information for validating arguments provided with a request to activate the application. A compiler may then compile the source code of the application to generate an assembly with information for validating the arguments and may also generate an entry in a manifest with information identifying the assembly with the information for validating the arguments. The compiler may also generate an activation executable with executable code used for validating the arguments before the application may be executed. When a request may be received with arguments for activation of the application, activation code may validate the arguments and then execute the application code which may access the validated arguments.

Abstract: A method for handling preprocessing in source code transformation creates a semantically correct view of a program being transformed. This semantically correct view is called a transformed form and it is capable of being parsed with a regular grammar. The original use of preprocessing macros is determined, including their relationship to the transformed form and the preprocessing is reconstructed in the modified source code.

Abstract: A style sheet is incrementally parsed when a change is made. Instead of parsing the entire style sheet text each time a change is made, only a portion of the style sheet is parsed in response to the incremental change. As a result of the incremental parsing the number of data structures needed to be updated upon the incremental change to the style sheet text is minimized. Since only a portion of the data structures are updated, it is possible for other components in software to have smart behavior based on the changes. For example, instead of all the display elements updating their display based on a change to the style sheet, only those dialogs or other parts of the user interface that were showing information about the changed rules need to update their display.

Abstract: The invention relates to a method and an automated system for determining the processing sequence of function blocks of a technological function. According to said method, a first function block, whose outputs are respectively disconnected or form exclusively one or more output signals of the technological function, is determined. Starting from said first function block, a second function block is sought in the opposite direction to the signal flow direction, whereby the block inputs of said second block are respectively disconnected or receive one or more input signals of the technological function only.

Abstract: In an embodiment of the invention, a method for lazy signal blocking, includes: when a program is going to enter a critical region of code where signals will be blocked, then setting an enabled flag and marking a signal mask with signals to be blocked, wherein the enabled flag and the signal mask are in a memory address space of the program; and when the program has left the critical region of code where signals will be blocked, then clearing the enabled flag.

Abstract: A method for analyzing a target system that includes obtaining a plurality of characteristics from the target system using a characteristics extractor and at least one selected from the group consisting of a software build project associated with the target system and a modified software build project associated with the target system, wherein the plurality of characteristics is associated with a characteristics model, storing each of the plurality of characteristics in a characteristics store, and analyzing the target system by issuing at least one query to the characteristics store to obtain an analysis result.

Abstract: A behavioral synthesis system which synthesizes behavior without inline expansion of a callee function, even one which has a pointer as an argument during the synthesis of a caller function. There is also a language analyzer that analyzes the behavior level description for conversion into an internal representation for behavioral synthesis and one which represents a correspondence relationship between a pointer variable and a circuit entity. There is also a pointer-terminal converter that converts a pointer into a set of a terminal and condition in the internal representation generated by the language analyzer. Further, there is a behavioral synthesizer that processes the internal representation from which the pointer variable has been removed by the pointer terminal converter to generate a circuit description at low abstractness.

Abstract: A system, method, and computer program product for providing real-time developer feedback are provided. The system includes a computer executing a source code editor; a feedback repository storing a programming language (PL) construct database, a profile database, and a general database; and a lexical analyzer executing on the computer. The analyzer parses code entered by a user into the editor. The constructs are used to search the construct database to determine a PL used in entering the code. The PL is used to search the construct database to determine a construct type. The analyzer searches the profile database for a developer profile of the user for the construct type. In response to a hit resulting from the search of the developer profile, the analyzer determines a frequency of occurrence of the construct type associated with the hit, identifies a cue assigned to the frequency of occurrence for the construct type, and delivers the cue to the computer.

Abstract: A system and method for a desk checker includes a partial state representation, a simulator controller to access the partial state representation and to continue a simulation without state information, and a desk checking component controlled by the simulator controller. The desk checking component includes any of a user interface, a static analysis engine, a partial execution component, and an analyzer. The system and method for desk checking includes simulating code execution on a computing device with partial state information and requesting user input to supplement the partial state information.

Abstract: Various embodiments of a method, apparatus, and article of manufacture for processing an extensible markup language (XML) script using an XML based scripting language are provided. The XML script is parsed. The XML script comprises element nodes. Each element node comprises a component name. A first element node comprises a first component name referencing a first user-defined component. An argument is passed to the first user-defined component. The argument is evaluated when an element node associated with the first user-defined component comprises an evaluate-component name that explicitly specifies that the argument be evaluated.

Abstract: A programming language syntax that embeds object type declaration in the object name. The objects are self-documenting because its object type is embedded in each object. In one embodiment, the object type-declaration prefix precedes the object name and explicitly declares the object type information. For example, a SQL object FirstName, may be implemented as SQL@FirstName, a URL object may be implemented as URL@FirstName, environment object from an environment table may be implemented as ENV@user.

Abstract: A method for prevention of system execution malfunction is provided. First, an IDL (Interface Definition Language) file is compiled using an IDL compiler to generate a compiled IDL file. The compiled IDL file is converted by defining additional operations corresponding to a specific operator in the compiled IDL file. When a program comprising the converted file is executed with the specific operator, the additional operations are performed before original operations thereof.

Abstract: The automatic generation of schemas for XML documents is provided. In an illustrative implementation, a computer readable medium having computer readable instructions to instruct a computing environment to execute one or more inference algorithms is provided. In operation, an XML document is processed according to the computer readable instructions such that the content and tags of the XML document are identified. The XML document is processed according to an inference algorithm, which executes one or more processing rule, and uses the XML document information in conjunction with the rules and operations of the XML schema definition language, to automatically produce a schema for the XML document.

Abstract: Status estimation is determined for an entity having a plurality of components. An original disjunction of diagnostic expressions indicating at least one of a fault-free or at least one fault mode for at least one of the components is determined, which is then investigated against a set of diagnostic test results, and expressions that do not imply the test result are discarded. Further, for each statement in the test result, a joint diagnostic expression is generated representing a conjunction of the statement and the currently investigated diagnostic expression. Joint diagnostic expressions that imply one of the original diagnosis expressions are discarded. Otherwise, they are added to an updated disjunction of diagnostic expressions. All remaining diagnostic expressions in the temporary disjunction of diagnostic expressions are then added to the updated disjunction of diagnostic expressions, and a status report is produced.

Abstract: When, during debugging, a program failure occurs, the location of the failure is determined. First the address in the stack related to the program failure is found. Then static analysis is performed in order to determine a possible culprit for the failure. For example, when a security cookie has been overwritten, indicating a probable overflow, the location of the security cookie on the stack is determined, and proximate storage structures (such as arrays) which may have overflowed onto the location of the security cookie are determined. Then static analysis is used to determine probable sources (e.g. functions or instructions in a function) for this error. In this way, the root cause of a buffer overflow or similar problem can be identified easily, rather than requiring extensive time and knowledge regarding the working of the compiler, the security cookie, the stack, static analysis, and the source code.

Abstract: A method for parsing and verifying the contents of a command script containing a token and written in a scripting language. A first, relatively rapidly accessible data store and a second, less rapidly accessible data store are provided. Each data store contains function signature definitions which include a function name and an associated parameter list of zero or more parameter specifications. The first data store contains function names associated with commands that do not require data retrieval for completion. The second data store contains function names associated with commands that, unlike those in the first data store, do require data retrieval for completion. A potential function name and its associated arguments, if any, are recognized within the token. The first data store is searched for a matching function signature, having a function name matching the potential function name, and a parameter list matching the parsed potential function arguments.

Abstract: A loader section (102) for converting a program from a class file to a runtime execution format, a runtime saving section (103) for performing a runtime saving process by which a runtime execution format is converted to a temporary runtime execution format, a temporary runtime execution format storing section (302) for storing a temporary runtime execution format, and a post-loader section (105) for performing a post-loader process by which a temporary runtime execution format is converted to a runtime execution format are included, and determination is made whether or not there is a temporary runtime execution format in the temporary runtime execution format storing section when a start-up of a program is instructed, the loader section is requested to perform conversion to a runtime execution format if there is none, and the post-loader section is requested to perform conversion to a runtime execution format if there is any.

Abstract: A method, system, architecture and apparatus for generating a shared library for a pervasive device target platform which can accommodate relocatable data. A tool chain in furtherance of this purpose can be arranged in accordance with the present invention to include a compiler programmed to compile source code into a compiled object and a linker programmed to link the compiled object into a linked object using a relocatable data segment. In this regard, in a preferred aspect of the invention a linker configuration file can be included for use in the linker which specifies the use of the relocatable data segment in lieu of a position independent data segment. The tool chain further can be arranged to include a relocation data extraction tool programmed to extract relocation data from the linked object and to dispose the relocation data in a relocation data file configured for disposition in a pervasive device.

Abstract: Methods and systems for generating an application are described. In one embodiment, source code associated with an application may be accessed. A header section of a main segment may be generated based on the compiling. The header section may describe the application. A user interface section of the main segment may be generated based on the compiling. The user interface section may be capable of being used to draw screens, display information, and receive user input. A procedures section of the main segment may be generated based on the compiling. The user interface section may be capable of being used to draw screens, display information, and receive user input. A text resources segment of the application may be generated based on the compiling. The text resources segment may include textual data. A binary resources segment of the application may be generated based on the compiling. The binary resources segment may include binary data.

Abstract: A system to provide an extensible type repository environment can include one or more type repositories, each of which is capable of representing a type system and maintaining one or more type definitions, each representing a type in the type system. Each type repository can also define a type repository interface, which is capable of providing a standard set of services for use by the system in interacting with the type repository. In addition, a compiler is capable of translating types defined in one or more language modules into types defined in one or more type repositories, performing name resolution, maintaining and resolving dependencies among types during recompilation of the types. This description 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: Statements of a computer program expressed using a first source natural language are made meaningful to a programmer familiar with a second target natural language. The first source natural language of the computer program is determined from the programmer, or through analysis, and the second target natural language desired by the programmer is selected. Textual constructs may be parsed, with reference to stored coding conventions to determine meaningful lexical tokens. Such tokens are translated with a translation engine, and displayed to the programmer, desirably using a graphical user interface feature of an integrated development environment (IDE) for computer programming in a particular programming language.

Abstract: A system for processing regular expressions containing one or more sub-expressions. Information regarding one or more regular expressions, each containing one or more sub-expressions, is stored. Data is compared to the stored information regarding expressions in only a single pass through the data. From the comparison, for any stored expression, the location within the data of the beginning and end of each sub-expression, and the end of the regular expression, are determined. From such determination, the presence within the data of any one or more stored regular expressions containing one or more sub-expressions is identified.

Abstract: A method, system and computer program product for processing a bundle file are disclosed. According to an embodiment, a method for processing a bundle file comprises: parsing the bundle file into bundle entries; creating a virtual XML file element to represent a bundle entry in a virtual XML document; and processing the bundle file using the virtual XML document.