Abstract: A system, method, and computer-readable medium, is described that finds similarities among programming applications based on semantic anchors found within the source code of such applications. The semantic anchors may be API calls, such as Java's package and class calls of the JDK. Latent Semantic Indexing may be used to process the application and semantic anchor data and automatically develop a similarity matrix that contains numbers representing the similarity of one program to another.

Abstract: The present invention relates to method of defining multiple program abstractions, extraction methodologies, transformation, and code conversion to convert legacy monolithic architecture of business systems to a layered modern architecture using Object Oriented language such as Java.

Abstract: Techniques for expressing temporal relationships between lifecycle representations are provided. For example, one computer-implemented technique includes obtaining two or more lifecycle representations of at least two components of at least one computing system, annotating the two or more lifecycle representations with at least one temporal relationship, and storing the two or more annotated lifecycle representations as at least one deployment descriptor, wherein the at least one deployment descriptor is useable for managing the at least one computing system. In another computer-implemented technique, at least two internal lifecycle models of at least two components of at least one computing system are analyzed, at least one temporal relationship that exists between the at least two components are analyzed, and the at least one temporal relationship is transformed into at least one sequence of change management operations for use in managing the at least one computing system.

Abstract: A compiler receives source code for a program and determines that the code includes a declaration expression and an initialization expression in an assignment context. The declaration expression introduces a variable and specifies part of a parameterized type for the variable but not another part of the parameterized type. A parameterized type may include a ground type part and one or more type arguments; in a declaration expression, the specified part of the parameterized type may include a ground type and the unspecified part may include one or more of the type arguments. The initialization expression specifies an initial value for the variable, where the value has a parameterized type. The assignment context associates the declared variable with the initial value. The compiler infers the type for the variable based at least on the part specified in the declaration expression and on the type specified by the initialization expression.

Abstract: Method and apparatus for representing data for components of a system in respective model components, generating model sub components from model components for at least some of the system components, and accumulating information from the model components and model sub components to determine a world view of the system. In one embodiment, model components can be updated during system operation.

Abstract: In a method for configuring an integrated development environment for programming a type of computer application, a computer receives a selection of a target application runtime program supporting one or more types of computer applications. The computer sends a request for information and receives information on the one or more types of computer applications supported by the target application runtime program. The computer determines, based on the received information, the one or more types of computer applications supported by the target application runtime program. The computer requests and receives a selection of the type of computer application. The computer configures an integrated development environment for programming the type of computer application selected.

Abstract: An integrated software development system including an interface description language adapted to specify constraints on input parameters, a program analyzer adapted to identify input parameters of a software program, and a validation enforcement system adapted to enforce that an interface description in the interface description language complying with a predefined set of validation rules is provided for the input parameters of the software program.

Abstract: Local dependency metadata can be collected from local metadata repositories of a plurality of development systems in a layered development system landscape, and a global where-used list that includes intra-layer and inter-layer dependencies between development entities in a layered development system landscape can be created, for example by aggregating the collected local dependency data. A usage metric quantifying how frequently each development entity is depended upon by other development entities in the layered development system landscape can be assigned to each development entity in the layered development system landscape. A measure of a relative effect of a change to one of the development entities on other development entities in the layered development system landscape can be promoted.

Abstract: A system and method for utilizing aspect oriented programming on a server. The present invention subjects an HTML layout container to aspect oriented programming on a server-side, and tags the HTML layout container with a class name. A server framework determines if a HTML page of the HTML layout container is being served to an authorized browser, and acts on the determination for the HTML page of the HTML layout container.

Abstract: Methods, apparatus, and computer-readable media for integrating two programming languages into a new programming language are disclosed. A plurality of programming statements are received, some of the plurality of programming statements having a first syntax representative of a first programming language and some of the plurality of programming statements having a second syntax representative of a second programming language. The some of the plurality of programming statements having the first syntax representative of the first programming language are translated into new programming statements in the second programming language. A source file is generated that comprises the some of the plurality of programming statements written in the second programming language and the new programming statements.

Abstract: An apparatus, system, and method to facilitate the display and management of service candidates in a service-oriented architecture (SOA). In one embodiment, the method includes receiving a user request for an inventory of service candidates in a SOA service model, and providing a user interface displaying the service candidate inventory. The method further includes allowing user access to individual service candidates in the service candidate inventory via the user interface.

Abstract: An enterprise database is accessed through semantic labels to develop models that enhance the database. A database of business objects is accessed, the business objects including data tables that relate semantic labels to enterprise data. One or more rules that use the semantic labels are applied to select enterprise data corresponding to the semantic labels. The selected enterprise data are used to determine modeling parameters that relate a semantic-label input set to a semantic-label output set, the semantic-label input set and the semantic-label output set each including at least one of the semantic labels. The modeling parameters are used to generate a simulation table that predicts an operational range of at least one business object corresponding to at least one of the semantic labels. The at least one business object is augmented in the database by including the simulation table in the at least one business object.

Abstract: Techniques for debugging a computer program that includes multiple modules executing on multiple machines include receiving, at a unifying component, first data from a first machine. The first data indicates debugging information generated by the first machine. Second data is also received at the unifying component from a second machine. The second data indicates debugging information generated by the second machine. Based on the first data and the second data, third data is formed indicating a single integrated representation of debugging information for the computer program. The unifying component allows debugging information from several machines to be integrated and then presented to a user through a single debugger client.

Abstract: Disclosed are a method and a device for loading a service application of a robot based on a ubiquitous robotic companion (URC) environment. The method for loading a service application of a robot includes: generating a service code for a service which is implemented by the robot from at least one descriptor; and generating at least one service object based on the generated service code and loading the at least one generated service object on the robot.

Abstract: An apparatus, system, and method to facilitate the display and management of composition candidates in a service-oriented architecture (SOA). In one embodiment, the method includes receiving a user request to view one or more composition candidates from a composition candidate inventory in a SOA service model, and displaying the composition candidate inventory to the user in a user interface.

Abstract: A method and system for managing temporary processing agents. Second executable code is selectively loaded into an empty routine which converts the empty routine to a populated routine in a first space. A super agent includes first agent code that includes first executable code, third agent code that includes third executable code and is located contiguous to the first agent code within a contiguous space within the super agent, and the empty routine consisting of non-executable code in the first space within the super agent external to the contiguous space.

Abstract: A build system and method, including receiving attribute rules and new rules, wherein the attribute rules correspond to one or more predefined default actions of the build system, wherein the new rules specify new actions that are to be added to the build system. A graph is generated to include files specified as attributes in the attributes rules and the one or more predefined default actions that correspond to the attributes rules. A request to enable at least one of the new rules is received. Action listener rules are received, wherein the action listener rules indicate default actions and corresponding new rules of the one or more new rules. The graph is checked for default actions that are indicated in the action listener rules. Additional actions are added to the graph for new rules based on the default actions indicated in the action listener rules.

Abstract: A computer-implemented method includes executing instructions stored on a computer-readable medium. The computer-implemented method includes receiving, at a server hosting a strongly-typed object-oriented application programming interface (API), a single API call to request data from the strongly-typed object-oriented API, where the single API call includes a tuple having multiple object types, obtaining the requested data and returning the requested data.

Abstract: Methods and systems are described for binding attributes between visual components. A first visual component, including a first presentation space for presenting first data by an operating first application, is detected. Binding information, for the first application, is identified that specifies a mapping between a first visual attribute of the first visual component and a second visual attribute of a second visual component including a second presentation space for presenting second data by a second application. A change to the first visual attribute is detected. In response to the detection of the change, change information is automatically sent to change the second visual attribute according to the mapping.

Abstract: An emulator for hosting desktop widgets. The emulator mimics the functions of a desktop widget engine. The emulator serves as a user interface component that may be added via a rapid application development tool, such as Oracle International Corporation's Application Development Framework. The rapid application development tool may be used to install the emulator, for example, in a region of a user interaction environment or an application created by the rapid application development tool. If desired, multiple options may be provided in terms of regions to provide the emulator. In addition, one or more selection devices, such as a drop down menu, may be provided to select particular desktop widgets for use and display. Tabbed pages may be provided on a display for the emulator for organizing both personal and enterprise desktop widgets. Security settings control access to widgets, and an option to allow or restrict access to widget display options in the emulator.

Abstract: The claimed subject matter provides a system and/or method that facilitates creating a portion of an industrial process. An interface component can receive a first portion of data associated with a first programming language and a second portion of data associated with a second programming language, wherein the first programming language is independent and disparate of the second programming language. An editor component can create at least one of a portion of an industrial process or a portion of a mixed language object by enabling the combination of the first portion of data and the second portion of data independent of the respective programming languages.

Abstract: Provided are a method, system, and computer program product to generate references to reusable code in a schema. A program coded in a first programming language has data structures, wherein at least one of the data structures includes a reference to reusable code. A model file is generated identifying the reusable code, elements and attributes in a second programming language for the reference to the reusable code in the program. The data structure coded in the first programming language is processed to generate a data structure schema in a second programming language describing elements and attributes of the data structure coded in the first programming language. A reference in the data structure schema to the reusable code is generated.

Abstract: An apparatus, network and methods for software model derivation and normalization are provided. In one embodiment a meta-model is derived from a plurality of software applications. The meta-model is independent of any particular software application. A number of software models are derived each compliant with the meta-model. A customer specific software application may then be derived from the models and an enterprise resource planning software application. This Abstract is provided for the sole purpose of complying with the Abstract requirement rules that allow a reader to quickly ascertain the subject matter of the disclosure contained herein. This Abstract is submitted with the explicit understanding that it will not be used to interpret or to limit the scope or the meaning of the claims.

Abstract: In one embodiment the invention provides a method to provide command line utility output to an application without the need of temporary files. The method includes receiving an identifier, receiving output from a command line utility, and storing the command line utility output in a system storage at a location identified by the identifier. In one illustrative embodiment, command line utility output is stored in a system registry database. In another illustrative embodiment, command line utility output is stored in a shared system memory. The method may be stored in any media that is readable and executable by a computer system.

Abstract: Disclosed are a method and system for optimized, dynamic data-dependent program execution. The disclosed system comprises a statistics computer which computes statistics of the incoming data at the current time instant, where the said statistics include the probability distribution of the incoming data, the probability distribution over program modules induced by the incoming data, the probability distribution induced over program outputs by the incoming data, and the time-complexity of each program module for the incoming data, wherein the said statistics are computed on as a function of current and past data, and previously computed statistics; a plurality of alternative execution path orders designed prior to run-time by the use of an appropriate source code; a source code selector which selects one of the execution path orders as a function of the statistics computed by the statistics computer; a complexity measurement which measures the time-complexity of the currently selected execution path-order.

Abstract: Some aspects relate to systems to determine a first metamodel conforming to a first meta-metamodel supporting metamodel class inheritance at the first metamodel level, identify one or more segments of an aggregation-free tree of nodes of the first metamodel, identify a lowest-level node of one of the one or more segments, identify all higher-level nodes of the one of the one or more segments, and consolidate attributes of each of the identified nodes of the one of the one or more segments into a node of a second metamodel conforming to a second meta-metamodel.

Abstract: Embodiments of the invention provide a method and a system of detecting source code in a message being sent over a digital communication network to secure against unauthorized leakage of source code. The message is intercepted on a network device, placed into a memory on the network device, and divided into one or more segments, wherein each segment includes a predetermined number of lines of text from the message. For each segment, one or more syntax rules of a programming language is applied to the segment and a predetermined number of context lines of text before the segment and/or after the segment, to determine which of the syntax rules of the programming language are matched in the segment. A determination of whether the text message includes source code is provided based on the syntax rules that were matched.

Abstract: A target program is instrumented during execution by using statements in high-level programming languages, without restarting the target and without modifying the compiled binary of the target on disk. The target and the analysis program modifying it may each include managed code. The target program is presented by an instrumentation API as a queryable database, rather than a mere sequence of processor-level instructions. An instrumentation context for the target program's execution image is obtained, with identifications of functions, individual instructions, and other instrumentable items that satisfy criteria specified in a query. Functions and low-level instructions may be identified as satisfying the query regardless of whether they have executed yet. High-level statements transform query-satisfying items in the target's execution image, by appending code, injecting a fault, replacing an individual instruction, or replacing an individual operand.

Abstract: The present invention extends to methods, systems, and computer program products for allowing a computer system user to extend the functionality of a data-centric software application. The method includes instantiating the data-centric software application, where the data-centric application has portions of business logic categorized and associated with items of data-centric application functionality defined in a schema. The method includes receiving customization input to customize at least one of the portions of business logic. The method includes formulating a representative model corresponding to at least one of the portions of customized business logic. The method includes applying the representative model to the schema to generate a customized schema that extends the business logic of the data-centric software application.

Abstract: A method and a system for automatically synchronizing the design features of disparate but conceptually corresponding code elements (e.g., image representations) within disparate but potentially composable code components (e.g., frameworks and their payloads). For example, an element that is a field within a structure that points to an abstract image BP within a skeletal framework component may conceptually correspond to a simple element that is a concrete image B within some intended framework payload. In the composition of the framework and the computational payload, the concrete image B must acquire the design features of the abstract image BP (i.e., a pointer within a structure field) to be properly synchronized with the design of the framework. This invention automates differencing of composite types to compute transformations that can add design features to B to convert it to BP thereby synchronizing the design features of the framework and its payload.

Abstract: The compiled code of a computer program is stored in multiple pieces within a database. Each piece is optionally stored within a separate data record. Execution of the computer program includes using database queries to retrieve pieces of the compiled code for execution. The database and associated database management logic are used to provide numerous advantages in execution and management of the computer program. For example, in some embodiments, database queries are used to help facilitate program flow logic. In another example, database queries are based on a command line or universal resource locator. These queries may be used to select functionality of a computer program in response to the command line or universal resource locator.

Abstract: A method for creating a program for controlling the operation of a computer-controlled machine includes providing a conversion program for converting a first program in a programming language into an executable second program in a machine language, writing a first program in the first programming language, and converting the first program using the conversion program into an executable second program in the machine language.

Abstract: There is provided a precondition generating apparatus in which a storage stores a set “S” of logical expressions; a creating unit creates a first logical expression being a logical product of the “S”, logical expressions of a program and a negation of a logical expression indicating a postcondition; a solver finds a solution that makes the first logical expression true and specifies a set of clauses that cannot be simultaneously true in the first logical expression if not found; wherein the creating unit sets relaxing variables for the logical expressions belonging to the set “S” in the set of clauses wherein the logical expressions indicates a precondition of the program, generates a second logical expression by alleviating the clauses of logical expressions corresponding to the relaxing variables in the first logical expression, and applies same process as in the first logical expression to the second logical expression.

Abstract: A generalized workflow execution model is configured to provide access to workflow elements. A computer system instantiates a generalized workflow execution model that provides access to workflow elements stored in a database that is connected to the workflow execution model. The workflow execution model includes the following: activity models that include both agents which are configured to express the control flow of the activity models and symbols which represent values usable by the activity models and metadata configured to identify the workflow execution model. The computer system also receives user input requesting workflow elements and accesses the database to provide the requested workflow elements using the generalized workflow execution model.

Abstract: The current application is directed to flexible and run-time-modifiable implementation of crosscutting functionalities, including code instrumentation, error logging, and other such crosscutting functionalities. These crosscutting functionalities generally violate, or run counter to, modern code-development strategies and programming-language features that seek to partition logic into hierarchically organized compartments and modules with related functionalities, attribute values, and other common features. One feature of the methods and systems for implementing crosscutting functionalities to which the current application is directed is an intelligent switch that can be controlled, at run time, to alter invocation and behavior of crosscutting-functionality implementations, including data-collection instrumentation, error logging, and other crosscutting-functionality implementations.

Abstract: An aspect of the present invention facilitates analysis of software code written in a programming language. In one embodiment, a visual interface designed to receive values identifying constructs of the programming language is provided on a display unit. In response to receiving, from a user using the visual interface, values corresponding to a construct of interest, a rule indicating a string of characters (that would constitute the construct of interest) is generated based on the received values. The generated rule is then applied to the software code to identify blocks matching the string of characters, each block representing a corresponding occurrence of the construct of interest in the software code.

Abstract: In one aspect, a spellchecker is provided that differentiates between code and natural language parts of a source code file. In operation, the spellchecker identifies a string in the source code file and attempts to classify the string as inducing programming language instructions or natural language words. If the sting is classified as including natural language words, the spellchecker outputs an indication of a spelling mistake in the string. Otherwise, if the string is not classified as including natural language words, the spellchecker does not output indications of spelling mistakes found in the string.

Abstract: Methods are provided for thread-agile script execution. Thread-agile script execution may be carried out by receiving, in a message queue, a message for an instance of a script and determining whether the web browser has a stored state object for the instance of the script identified by the message. If the web browser has a stored state object for the script, thread-agile script execution may be carried out by retrieving the state object; preparing a thread available from a thread pool for execution of the instance of the script in dependence upon the state object and an execution context for the instance of the script; providing, to an execution engine for executing the script, the state object and the prepared thread; and passing the message to the execution engine.

Abstract: Various embodiments provide an interface between a Web browser's layout engine and a scripting engine. The interface enables objects from the layout engine to be recognized by a memory manager in the scripting engine and interact in a streamlined, efficient manner. In accordance with one or more embodiments, the interface allows browser layout engine objects to be created as objects that are native to the scripting engine. Alternately or additionally, in some embodiments, the native objects are further configured to proxy functionality between the layout engine and the scripting engine.

Abstract: A technique for enforcing the use of designated initializers in structured type initializations may include determining whether structured data type requires designated initialization, determining whether an initialization of a structured variable declared to use the structured data type employs an improper initializer that is inconsistent with said structured data type, and performing a diagnostic action if the initialization comprises an improper initializer.

Abstract: A method for facilitating the processing of markup language documents, e.g., XML documents, uses a code generator that creates programs configured to read dynamic XML documents at run time, avoiding many of the complexities arising from the use of conventional “XML Parse” statements. In one embodiment, this process involves (1) creating a template document using the markup language, wherein the template document includes a set of tags associated with the markup language documents; (2) parsing the template document to determine a data structure corresponding to the tags in the template document; and (3) generating an application program in the programming language (e.g., COBOL), wherein the application program includes a definition of the data structure, and is configured to read, during run-time, the markup language document and generate a corresponding set of data elements corresponding to the data structure.

Abstract: A virtual machine supports execution of compiler-generated code and provides an execution environment for code that may correspond to any of several different event-driven or message-driven programming models (such as state machines, rules for complex event processing and event correlation, monitoring contexts, processes, and mediations). The programming models may be used in business monitoring and/or business integration environments. A programming language is defined for execution using the virtual machine, which contains a relatively small number of instructions and which is preferably generated by a compiler from a higher-level, event-driven or message-driven model.

Abstract: The disclosed embodiments provide a system that facilitates the development and execution of a software program. During runtime of the software program, the system obtains a function call associated with an overloaded function and a generic type hierarchy that lacks contravariance. Next, the system determines an applicability of an implementation of the overloaded function to the function call. Finally, the system selects the implementation for invocation by the function call based on the determined applicability and a partial order of implementations for the overloaded function.

Abstract: The disclosed embodiments provide a system that facilitates the development and execution of a software program. During runtime of the software program, the system obtains a function call associated with an overloaded function and a generic type hierarchy. Next, the system determines an applicability of an implementation of the overloaded function to the function call. Finally, the system selects the implementation for invocation by the function call based on the determined applicability and a partial order of implementations for the overloaded function.

Abstract: A method of semantic translation of a class of diagrams to input/output-extended finite automata is provided. The method includes receiving a data representation of a diagram, said diagram comprising a plurality of blocks and said diagram being associated with a graphical modeling environment which defines semantics for executing the diagram, and processing, using a computing device, the data representation of the diagram to translate the diagram to an input/output-extended finite automata model.

Abstract: An end-to-end approach is provided for developing and maintaining network device management applications. The approach includes an XML-based development environment for network device management applications that uses Management Data API (MDA) schemas that define a hierarchical data model for components supported by a network device. The XML-based development environment also uses XML schemas to define a common XML-based interface used by management applications to access management data maintained on the network device. The approach provides programmatic access to network device management data and management data schema with an XML-based data model and interface that is consistent across all network device components. The approach includes mechanisms for automatically generating XML requests that conform to a hierarchical data model from requests that conform to a table-based data model.

Abstract: A system and method for configuring an event-based process are disclosed. A configuration module receives input describing an event-based process or modifications to an event-based process. For example, the configuration module receives as input a graphical depiction of one or more states and state transitions that comprise at least a portion of the event-based process. Using the received input description, the configuration module generates executable data, such as data formatted as an event processing language, corresponding to the input. The executable data is then communicated to an event engine which executes the executable data to implement the event-based process or modifications to an event-based process corresponding to the received input. One or more aspects of the execution of the event-based process may also be visualized, and graphically modified, though an event monitoring module.

Abstract: A computer readable medium is configured to receive a description of a COBOL copybook that can be represented in one of a plurality of disparate formats, to parse the COBOL copybook based on the description of the COBOL copybook, and to create a standardized data record schema based on the COBOL copybook. The description of the COBOL copybook includes information about the format of the COBOL copybook.

Abstract: A system may include acquisition of metadata defining a first object model, the first object model comprising an instance of a metaobject, acquisition of enhancement object metadata defining one or more enhancements to the first object model and associating each of the one or more enhancements with one of one or more stable anchors of the first object model, and creation, based on the metadata defining the object model and the metadata defining the one or more enhancements, of metadata defining an extended object model, the extended object model comprising an instance of the metaobject.

Abstract: An execution environment for functional code may treat application segments as individual programs for memory management. A larger program of application may be segmented into functional blocks that receive an input and return a value, but operate without changing state of other memory objects. The program segments may have memory pages allocated to the segments by the operating system as other full programs, and may deallocate memory pages when the segments finish operating. Functional programming languages and imperative programming languages may define program segments explicitly or implicitly, and the program segments may be identified at compile time or runtime.