Abstract: A tool, such as a compiler or an interpreter, receives program source code and determines that the code includes an operation for which type conversion is permitted on an operand. The tool determines a source type of the operand, and a target type to which the operand is to be converted. In response to determining that the source type is a reference type and the target type is a primitive type, the tool generates a set of instructions to (a) determine whether, at run time, in accordance with a class definition of the reference type, a value of the target primitive type can be obtained via one or more method invocations on the operand (b) if such a value can be obtained, obtain the value and assign the value to a result of the operation and (c) if such a value cannot be obtained, generate an error indication.

Abstract: A computer implemented rule for verifying consistency in design documents is modeled as a set of associations among deliverable components, and a descriptive text explaining the specification is generated in combination with a text template.

Abstract: A business object is generated based on a discovered web service having an associated Web Service Description Language (WSDL) file. The business object includes at least one data type and the at least one interface operation of the WSDL file. The business object is configured to expose web service functionality of the web service in an integrated manner within a business object based application environment. Generating the business object includes converting the at least one data type to a format consistent with the business object based application environment, creating at least one business object node of the business object that corresponds to each interface operation of the WSDL file, the at least one business object node being based on the at least one message, and creating a node action for the at least one business object node, the node action corresponding to the at least one interface operation.

Abstract: A method for use in replaying actions performed by a user of a software application. An input signal indicating an action performed by the user is received from a user input interface. Computer-executable instructions corresponding to the input signal are executed by a processor. An input event associated with the human-readable statements is stored in a memory device. Application object code corresponding to the human-readable statements may later be executed to replay the input event. In addition, an application state representing one or more variables of the software application may be stored.

Abstract: Web sites are modeled using mappings from paths to expressions. A mapping data structure of expressions represents a web site's hierarchical structure, and an enumerator, an array of characters, or an array of bytes represents the web site's content. Expressions are written in a declarative programming language, and are lazily evaluated to provide results used in HTTP responses. A mapping may be recursive. An expression may contain a function call which returns contents of a file named in the HTTP request path, or the expression may evaluate to a text string, for example. Expressions may call functions which produce side-effects. An expression may recursively map a directory name to a mapping of a file name. Scalability is promoted by concurrently evaluating expression(s) on different machines in a stateless middle tier, and by streaming results. An arbitrarily large web site may be implemented in this manner.

Abstract: The disclosed embodiments provide a system that provides access control for a software program. During operation, the system identifies a member of a module to be used in the software program. Next, the system infers the visibility of the member based on the accessibility of the member. Finally, the system uses the visibility and the accessibility to provide access control during the life cycle of the software program.

Abstract: Described are techniques for configuring a target data store. Code written in a scripting language is provided. The scripting language includes environment blocks that retrieve data used in a subsequent block and execution blocks that execute an operation to configure said target data store. The retrieved data includes data from said target data store. The code is processed and includes retrieving data in accordance with environment blocks included in the code, and updating said target data store in accordance with execution blocks included in said code.

Abstract: A background process installs a system hook for message interception of integrated circuit chip layout display software. A call message is intercepted through the system hook, and current layout coordinates are read from the integrated circuit chip layout display software. A representation of the current layout coordinates is entered into tool control software configured to control a physical tool for analyzing integrated circuits, and the physical tool is controlled with the tool control software. In an “inverse” approach, a background process is used to install at least one system hook for message interception of tool control software configured to control a physical tool for analyzing integrated circuits, and a call message is intercepted through the system hook. Current coordinates are read from the tool control software. A representation of the current coordinates is entered into integrated circuit chip layout display software, and at least a portion of an integrated circuit layout is displayed.

Abstract: The present invention provides a method for converting source code written in a dynamically typed language into target code written in a statically typed language. The method includes the step of generating in a storage device the target code from the source code, the step of generating the target code including storing in a buffer a signature of a function/method used by a caller in the source code. In this step, generation of an interface class is delayed to a time point immediately before execution of a part of the target code corresponding to the function/method call by the caller, the interface class being needed to generate the caller and serving as an interface in the statically typed language. The method also includes the step of generating in the storage device a consolidated interface class for all signatures stored in the buffer, and loading the generated consolidated interface class from the storage device.

Abstract: Techniques for data pattern analysis using deterministic finite automaton are described herein. In one embodiment, a number of transitions from a current node to one or more subsequent nodes representing one or more sequences of data patterns is determined, where each of the current node and subsequent nodes is associated with a deterministic finite automaton (DFA) state. A data structure is dynamically allocated for each of the subsequent nodes for storing information associated with each of the subsequent nodes, where data structures for the subsequent nodes are allocated in an array maintained by a data structure corresponding to the current node if the number of transitions is greater than a predetermined threshold. Other methods and apparatuses are also described.

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: In an embodiment of the invention, one or more tangible non-transitory computer-readable storage media may store the following instructions. Defining representation type spaces R1 and R2 and correctness type spaces C1 and C2 over the representation type spaces R1 and R2, respectively. Defining a representation type space R and a correctness type space C over the representation type space R, such that a semilattice associated with the correctness type space C is a function semilattice over respective semilattices associated with the correctness type spaces C1 and C2.

Abstract: A computer implemented method includes receiving a client programming language input and a server programming language input, processing the client and server programming language inputs, and translating the client programming language input into an executable client application and the server programming language input into an executable server application, the executable client and server applications operable to communicate with each other. Processing the client and server programming language inputs includes identifying any invocations of server procedures of the server programming language input in the client programming language input, producing a combined server procedure in the server programming language input for identified server procedures invoked by the client programming language input, and replacing invocations of the identified server procedures in the client programming language input with an invocation of the combined server procedure.

Abstract: A system and method of retrieving a module in a JavaScript language application includes receiving a called module name, examining a table of executed modules to determine if the called module name is included in the table of executed modules, executing the called module if the called module name is included in the table of executed modules and defining a search path, wherein if the called module name is not included in the table of executed modules, then determining if the called module name is found in the search path. If the called module name is found in the search path, then loading the found module and updating the table of executed modules. Loading the found module includes automatically loading the found module without requiring an import statement.

Abstract: A system and method for automatic invocation of object initializers, or constructors, for superclasses featuring the ability to modify the contents of classes of existing applications at runtime, which includes adding new superclasses to the class inheritance hierarchy of the existing classes. The system redefines the content of classes of the existing classes and the new superclasses during the loading of the classes to additionally include code statements that invoke constructors of the redefined classes and the new superclasses. The invocation of the constructors at runtime performs the initialization of the objects.

Abstract: A computer-implemented method of generating output computer code, for an application executable via a server running application logic in communication with a client running a presentation layer for the application, from input computer code of a synchronous application in which logic and presentation layers run locally on a single computer. The output code runs asynchronously.

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

Abstract: Mashup creation, through the reuse and combination of existing networking or Web applications, are presented. For example, a method for forming a networked software application on a first computer resource coupled by a network to a client computer of a user includes accessing, within a repository that is part of the first computer resource, a first networked software application part, forming, within the first computer resource, a second networked software application part, and providing the second networked software application part to the repository. The second networked software application part comprises a first element of the first networked software application part. The steps of accessing, forming and providing are performed using the first computer resource comprising the repository. The first and the second networked software application parts remain on the first computer resource, and separate from the client computer, during the forming of the second networked software application part.

Abstract: Systems and methods for visually representing scripted behaviors are provided. A system is disclosed that includes an authoring program executable on a computing device and configured to display a visual scripting interface. The visual scripting interface may be configured to display a plurality of user-selectable graphical building blocks. Each graphical building block may represent a respective component of a script, and may be spatially arrangable within the visual scripting interface to visually represent a script for a target scripted object. Input selectors may be provided on the graphical building blocks to enable users to input script information, and status indicators and messages may also be displayed on the graphical building blocks to inform users whether script information has been properly inputted. Propagation tools may be provided to enable users to successively add new graphical building blocks to build a tree that represents a script sentence.

Abstract: Provided is an apparatus for executing a robot task using a robot model definition. A task execution apparatus include: a storage unit to store at least one robot model, at least one robot behavior, and at least one robot task; and a task execution unit to generate at least one execution object from the stored at least one robot model, at least one robot behavior, and at least one robot task, and to execute a task of a robot from a corresponding execution object among the generated at least one execution object in response to an execution command input from a user.

Abstract: A method for generating a library of materials that can be applied to geometry in a graphics scene when performing rendering operations. The method includes generating a class file that includes material parameters representing rendering characteristics of a material class and generating a library root file that includes a reference to the class file. The method further includes generating a rendering implementation file for translating values of the material parameters into a format recognized by a particular rendering engine and generating a user interface file that includes at least one user interface configured to allow a user to modify the values of the material parameters. The method also includes linking the class file to the library root file, and linking the rendering implementation file and the user interface file to the class file. Advantageously, the library can be organized and updated more effectively when compared to prior art techniques.

Abstract: A device includes: a storage storing second logical expressions; an storage storing an essential condition which indicates a set of one or more second logical expressions selected such that a proposition is not satisfied that the post-condition is satisfied immediately after a program is executed when a logical product of other second logical expressions obtained by excluding the set indicated by the essential condition from the storage is satisfied; a generator generating a candidate condition represented by a logical product of one or more second logical expressions to include a common second logical expression with the set indicated by the essential condition; a judging unit judging whether satisfied is a proposition that the post-condition is satisfied immediately after the program is executed when the candidate condition is satisfied, and an output unit configured to output the candidate condition determined to satisfy the proposition as representing a pre-condition of the program.

Abstract: A computer-implementable method includes providing an instruction set architecture that comprises features to generate diverse copies of a program, using the instruction set architecture to generate diverse copies of a program and providing a virtual machine for execution of one of the diverse copies of the program. Various exemplary methods, devices, systems, etc., use virtualization for diversifying code and/or virtual machines to thereby enhance software security.

Abstract: The disclosed embodiments provide a system that facilitates the development and compilation of a software program. During operation, the system provides, in a programming language platform associated with source code for the software program, an indicator for a resource with a close method that does not complete erroneously. Next, the system enables use of the indicator with a resource-management statement in the source code, wherein the indicator facilitates omission of an exception-handling construct for the resource-management statement.

Abstract: The disclosed embodiments provide a system that facilitates the development and compilation of a software program. During operation, the system provides, in a programming language platform associated with source code for the software program, an indicator for a resource with an idempotent close method. Next, the system enables use of the indicator with a resource-management statement in the source code, wherein the indicator facilitates the use of a wrapped resource in the resource-management statement.

Abstract: In one embodiment of the invention code (e.g., compiler, tool) may generate information so a first code portion, which includes a pointer value in a first endian format (e.g., big endian), can be properly initialized and executed on a platform having a second endian format (e.g., little endian). Also, various embodiments of the invention may identify problematic regions of code (e.g., source code) where a particular byte order is cast away through void pointers.

Abstract: In a host system, a method for using instruction scheduling to efficiently emulate the operation of a target computing system includes preparing, on the host system, an instruction sequence to interpret an instruction written for execution on the target computing system. An instruction scheduling on the instruction sequence is performed, to achieve an efficient instruction level parallelism, for the host system. A separate and independent instruction sequence is inserted, which, when executed simultaneously with the instruction sequence, performs to copy to a separate location a minimum instruction sequence necessary to execute an intent of an interpreted target instruction, the interpreted target instruction being a translation; and modifies the interpreter code such that a next interpretation of the target instruction results in execution of the translated version, thereby removing execution of interpreter overhead.

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: The automated identification of open types of a multi-function input program. The automated identification of open types is performed without annotations in the input program, but rather by identifying a set of invading types of the program, with each of the invading types being an open type. The identification of invading types may be performed iteratively until the set of invading types no longer grows. The set of open types may be used for any purpose such as perhaps the de-virtualization of an input program during compilation.

Abstract: Techniques for generating concurrent static single assignment (CSSA) are provided. The techniques include generating a clocked control flow graph of a program, for each thread of the program created through async instruction, determining each part of the program that can execute concurrently with each thread to create a pair comprising a thread and a parallel program part, for each pair that can execute concurrently, using one or more flow equations to perform node-by-node matching, and using the node-by-node matching to generate CSSA form for the program.

Abstract: The present disclosure involves computer-implemented methods, software, and systems for managing a transition between business process models. A computer-implemented method includes in parallel with a first business process model, instantiating, using at least one hardware processor, a second business process model, instantiating a temporary exit process step of a set of temporary exit process steps associated with the first business process model and a temporary entry process step of a set of temporary entry process steps associated with the second business process model, coupling an exit transition rule of a set of exit transition rules associated with the first business process model to the first business process model, and activating the exit transition rule after activating the second business process model.

Abstract: An apparatus, system, and method for the improved validation of information across a communications network provide a common validation rules library that may be accessed and executed either by a client or server. The provision of a minimal amount of logic either to the client or the server is achieved by generating only a requisite amount of validation logic. Furthermore, developers are enabled to reuse and build upon validation logic by subsequent validation logic inheriting validation logic from a parent rule.

Abstract: A system includes a processor, a storage medium, an extensible markup language (XML) schema stored on the storage medium, and a script for manipulating an XML document stored on the storage medium. The script includes an import function to import the XML schema such that the definitions of the XML schema are used to interpret the script.

Abstract: The present invention includes a method of providing users with formatted access to XML and similar documents received from trading partners using a general purpose viewer or browser. Particular aspects of the present invention are described in the claims, specification and drawings.

Abstract: A test environment may include qualitative evaluations of the test code used to test application code. Several qualitative evaluations may be determined from analysis of test code in compiled or source form, including evaluating descriptive assertions made by the test code, dependency evaluations, cyclomatic complexity evaluations, return value assertions, mutable parameter assertions, and test effectiveness history. The qualitative evaluations may also include analysis of the test code in relation to the application code, including exception capturing, boundary conditions, assertions for returned values, and other evaluations. The test code evaluations may be presented in a user interface along with the test code and may be used to manage testing progress of an application. The test code evaluations may be integrated into a code development application with a graphical user interface.

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: In one embodiment, an integrated circuit design tool is provided that includes a main window graphical user interface (GUI) and several tool GUIs. Cross probing of features from a source tool GUI to a target tool GUI occurs by the source tool GUI transmitting a probe request to the main window GUI; wherein the probe request identifies one or more cross-probed features for the target tool GUI. In response, the main window GUI commands a plug-in installation of the target tool GUI if the target tool GUI has not yet been instantiated. The main window GUI transmits a notification of the probe request to the target tool GUI. In response, the target tool GUI displays the cross-probed features.

Abstract: Analyzing dynamic source code. A method includes accessing a specific metadata format data structure. The data structure was created by obtaining one or more first data structures defining constructs in a body of dynamic language source code. From the one or more first data structures, identifier information is extracted for one or more of the defined constructs. Knowledge about the constructs is augmented. The metadata format data structure is parsed to compute metrics about the metadata format data structure. The metrics about the metadata format data structure are provided to a user.

Abstract: A method and system for implementing WS-Policy is described. In one embodiment, the system includes an API that may be used to call one or more methods for processing a WS policy file. These methods are associated with one or more classes.

Abstract: A test script editor that easily can be used by anybody in the development team, including non-programmer business analyst testers. The test script editor enables building maintainable and stable test scripts by simple selecting from a set of accessible actions (a combination of the test object and the associated test method). The accessible actions can be calculated by application state engine by calculating all state transitions of preceding actions and subsequent actions in the script. The test script editor can provide context sensitive navigation help for appending steps at the end of the script, inserting steps within the script, changing existing steps and deleting steps.

Abstract: A communications protocol interface is configured as being divisible into a core portion and an extensible portion. The extensible portion of the communications protocol interface is further configured to be customized in scope so that each network element can communicate a unique and optionally small, subset of actual interoperable data that corresponds to at least a portion of a larger defined data set. A software generator program is configured to generate a set of extensible source code that operates upon the subset of actual data and that directs the execution of the extensible portion of the communications protocol interface for a particular network element.

Abstract: Software testers can generate test scripts for validating and verifying software without navigating all possible actions or keywords. The current application state is described with one or more test objects. Each test object has one or more associated test methods and each test method can describe one or more state transitions. Only test methods accessible through test objects in the current application state are displayed to the software tester. The current state changes only if the state transition described by the test method selected by the software tester indicates a change from the current state.

Abstract: Traditional programming environments that support event-driven programming typically expose a model where the developer chooses an event to handle on a given object, and then writes the code for that event handler. In contrast, as described herein, the traditional flow of program development is reversed. A (configurable) event-handler (“behavior”) is selected. Upon selection of one of the behaviors, the event triggering the behavior is selected. This is a “what-then-when” approach rather than the traditional “when-then-what” approach for event-driven programming.

Abstract: A software application includes work order resources, each of which defines an atomic operation for the software application, and a construction service resource, which processes the work order resources in response to all interaction requests for the software application. Each interaction request is received from a client and identifies a corresponding work order, which the construction service processes to dynamically construct a set of deliverables, which can include a custom representation of the work order. While processing the interaction request, the construction service, as directed by the work order, can make one or more requests to context resources for context information corresponding to an activity for which the interaction was requested to construct the set of deliverables.

Abstract: To enable language-level integration of multiple programming languages into a single programming framework, one or more domain specific languages (DSLs) are specified as incremental extensions to a host programming language. An application created in this framework may include program code written in the host language as well as DSL inset code that is written in any of the DSLs. The extensions to the host language are described in DSL specifications, which define how the DSL inset code is processed. At runtime, DSL inset code in the source code is detected and passed to a DSL inset processor for execution according to an appropriate DSL specification, whereas source code in the host language is executed by a host language processor.

Abstract: To enable language-level integration of multiple programming languages into a single programming framework, one or more domain specific languages (DSLs) are specified as incremental extensions to a host programming language. An application created in this framework may include program code written in the host language as well as DSL inset code that is written in any of the DSLs. The extensions to the host language are described in DSL specifications, which define how the DSL inset code is processed. At runtime, DSL inset code in the source code is detected and passed to a DSL inset processor for execution according to an appropriate DSL specification, whereas source code in the host language is executed by a host language processor.

Abstract: An architecture that that extends conventional computer programming languages that compile into an instance of an extensible markup language (XML) document object model (DOM) to provide support for XML literals in the underlying programming language. This architecture facilitates a convenient short cut by replacing the complex explicit construction required by conventional systems to create an instance of a DOM with a concise XML literal for which conventional compilers can translate into the appropriate code. The architecture allows these XML literals to be embedded with expressions, statement blocks or namespaces to further enrich the power and versatility. In accordance therewith, context information describing the position and data types that an XML DOM can accept can be provided to the programmer via, for example, an integrated development environment.

Abstract: The present invention provides a programming model based on a relational view of the heap which defines identity declaratively, obviating the need for equals( ) and hashcode( ) methods. Each element in the heap (called a tuple) belongs to a relation type and relates an immutable identity to mutable state. The model entails a stricter contract: identity never changes during an execution. Objects, values, and singletons arise as special cases of tuples.

Abstract: A method and apparatus for converting a method call to a function call. In one embodiment, the method comprises receiving an argument list from a function that has been called by a subroutine call. The method further comprises determining whether the subroutine call is a method call from the argument list. In response to a determination that the subroutine call is the method call, the method comprises converting the method call into a function call.

Abstract: An aspect container being operable to generate an instance of itself at run time is provided. The aspect container comprises logic operable to create an instance of the aspect container by reading configuration information specifying a sequence of one or more aspects from an aspect container configuration file corresponding to the aspect container. The logic is also operable to generate instances of the aspects in the sequence, configure each aspect instance with its configuration information from an aspect configuration file corresponding to the aspect, and chain the aspect instances according to the specified sequence, such that the chain of aspect instances preamble and postamble activities of a class or method.