309 results about "Compile time" patented technology

The subject invention pertains to a compilation system and meta-object protocol to facilitate interaction with objects of various types including but not limited to XML documents. More specifically, a delineator or dot operator can be extended to hide idiosyncratic details of interacting with objects. Code details can be generated by a compiler behind the scenes. This enables a programmer to achieve the same results while writing much simpler and intuitive code.

A user interface for building a componentized workflow model. Each step of the workflow is modeled as an activity that has metadata to describe design time aspects, compile time aspects, and runtime aspects of the workflow step. A user selects and arranges the activities to create the workflow via the user interface. The metadata associated with each of the activities in the workflow is collected to create a persistent representation of the workflow. Users extend the workflow model by authoring custom activities.

Building a componentized workflow model via an application programming interface. Each step of the workflow is modeled as an activity that has metadata to describe design time aspects, compile time aspects, and runtime aspects of the workflow step. A user selects and arranges the activities to create the workflow via the application programming interfaces. The metadata associated with each of the activities in the workflow is collected to create a persistent representation of the workflow. Users extend the workflow model by authoring custom activities. Users also compile the workflow via the application programming interface.

A developer can express the logic offered by a Web service, or other network accessible service, using a standard programming language augmented with declarative annotations specifying preferences for exposing that logic as a Web service. At compile time, an enhanced compiler can analyze the annotated source file and automatically generate the mechanisms required to expose its functionality as a Web service or network accessible service. Because the annotations are declarative, they may be easily visualized, created, and modified such as by using a graphical user interface, further simplifying the developer's task. Thus, such an approach decreases the time, knowledge, skill and ultimately cost required to develop the complex support required to proved services in these environments. 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.

An ink-enabled user interface for building a componentized workflow model. A touch screen display device allows each step of the workflow to be modeled as an activity that has metadata to describe design time aspects, compile time aspects, and runtime aspects of the workflow step. A user selects and arranges the activities via the touch screen device to create the workflow via user interfaces or application programming interfaces. The metadata associated with each of the activities in the workflow is collected to create a persistent representation of the workflow. Users extend the workflow model by authoring custom activities.

Building a componentized workflow model. Each step of the workflow is modeled as an activity that has metadata to describe design time aspects, compile time aspects, and runtime aspects of the workflow step. A user selects and arranges the activities to create the workflow via user interfaces or application programming interfaces. The metadata associated with each of the activities in the workflow is collected to create a persistent representation of the workflow. Users extend the workflow model by authoring custom activities. The workflow may be compiled and executed.

Representing a componentized workflow model via a declarative markup language. Each step of the workflow is modeled as an activity that has metadata to describe design time aspects, compile time aspects, and runtime aspects of the workflow step. A user selects and arranges the activities to create the workflow via user interfaces or application programming interfaces. The metadata associated with each of the activities in the workflow is collected to create a persistent representation of the workflow. Users extend the workflow model by authoring custom activities.

Modifying a componentized workflow model during execution of the workflow. Each step of the workflow is modeled as an activity that has metadata to describe design time aspects, compile time aspects, and runtime aspects of the workflow step. A user selects and arranges the activities to create the workflow via user interfaces or application programming interfaces. Metadata is associated with each of the activities in the workflow. During execution of the workflow, the user modifies the metadata to affect execution of the workflow without recompiling the workflow.

A method (400) and system (106) is provided for run-time cache optimization. The method includes profiling (402) a performance of a program code during a run-time execution, logging (408) the performance for producing a cache log, and rearranging (410) a portion of program code in view of the cache log for producing a rearranged portion. The rearranged portion is supplied to a memory management unit (240) for managing at least one cache memory (110-140). The cache log can be collected during a real-time operation of a communication device and is fed back to a linking process (244) to maximize a cache locality compile-time. The method further includes loading a saved profile corresponding with a run-time operating mode, and reprogramming a new code image associated with the saved profile.

Modifying a componentized workflow model during execution of the workflow. Each step of the workflow is modeled as an activity that has metadata to describe design time aspects, compile time aspects, and runtime aspects of the workflow step. A user selects and arranges the activities to create the workflow via user interfaces or application programming interfaces. Metadata is associated with each of the activities in the workflow. During execution of the workflow, the user modifies the metadata to affect execution of the workflow without recompiling the workflow.

Building a componentized workflow model. Each step of the workflow is modeled as an activity that has metadata to describe design time aspects, compile time aspects, and runtime aspects of the workflow step. A user selects and arranges the activities to create the workflow via user interfaces or application programming interfaces. The metadata associated with each of the activities in the workflow is collected to create a persistent representation of the workflow. Users extend the workflow model by authoring custom activities. The workflow may be compiled and executed.

One embodiment provides a system that protects translated guest program code in a virtual machine that supports self-modifying program code. While executing a guest program in the virtual machine, the system uses a guest shadow page table associated with the guest program and the virtual machine to map a virtual memory page for the guest program to a physical memory page on the host computing device. The system then uses a dynamic compiler to translate guest program code in the virtual memory page into translated guest program code (e.g., native program instructions for the computing device). During compilation, the dynamic compiler stores in a compiler shadow page table and the guest shadow page table information that tracks whether the guest program code in the virtual memory page has been translated. The compiler subsequently uses the information stored in the guest shadow page table to detect attempts to modify the contents of the virtual memory page. Upon detecting such an attempt, the system invalidates the translated guest program code associated with the virtual memory page.

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

Representing a componentized workflow model via a declarative markup language. Each step of the workflow is modeled as an activity that has metadata to describe design time aspects, compile time aspects, and runtime aspects of the workflow step. A user selects and arranges the activities to create the workflow via user interfaces or application programming interfaces. The metadata associated with each of the activities in the workflow is collected to create a persistent representation of the workflow. Users extend the workflow model by authoring custom activities.

Building a componentized workflow model via an application programming interface. Each step of the workflow is modeled as an activity that has metadata to describe design time aspects, compile time aspects, and runtime aspects of the workflow step. A user selects and arranges the activities to create the workflow via the application programming interfaces. The metadata associated with each of the activities in the workflow is collected to create a persistent representation of the workflow. Users extend the workflow model by authoring custom activities. Users also compile the workflow via the application programming interface.

It is desirable for software developers to be able to conveniently obtain feedback from users of applications. It is known for developers and others to use code instrumentation for gathering various types of data relating to applications and their uses. The use of compile time instrumentation may be practical for some situations but it has significant drawbacks when used to provide indications of user interaction with applications. The present invention relates to the use of run time instrumentation for providing feedback from users of object oriented applications where the applications have unique object identifiers and support dynamic data exchange. The invention utilizes a setup software tool to create a monitor input file which indicates which objects of the application should be monitored when a user interacts with them.

An event-based scheduling method and system for providing automatic activity synchronization and automatic data exchange between workflows and between workflows and other applications. An automatic synchronization mechanism is provided for enabling workflows to interact with other workflows or other applications to automatically synchronize activity execution. An automatic data exchange mechanism is provided for enabling workflows to exchange data with other workflows or other applications. An event processing pre-compilation architecture receives a workflow definition having at least one event node and responsive thereto generates a workflow definition without event nodes at compile time. Each event node is replaced with a translated workflow node that conforms to the syntax supported by the underlying workflow engine. The translated workflow node is also assigned to an application that can implement the desired event node semantics. An event processing run-time architecture invokes the application assigned to the translated node when the translated node is encountered. The application employs a publication and subscription tool for automatically performing activity synchronization and / or data exchange at run time.

A universal format is used to create a type representation of XMLType instances that are generated in various ways from various sources. An XMLType Type Tree is represented as a hierarchy of nodes, including leaf item node, composite item node, operator node, aggregate node, referred to herein as an XMLType Type Tree. An XMLType Type Tree serves as a digest of the type structure of XMLType, no matter the source of the XMLType instance or its manner of its generation and it creates one uniform abstraction of the type structure of XMLType for the data-typing analysis of XPath and XQuery during query compile time.

A system and methods for versioning software components in connection with a computer programming language are provided. In exemplary aspects, the versioning system makes use of intelligent defaults, provides a vehicle for unambiguous specification of developer intent and implements conflict resolution rules in connection with the versioning of software components. In another aspect, the versioning system bounds names at run-time, but does not bound offsets at compile-time.

A method, an apparatus, and computer instructions for generating service frameworks are provided by aspects of the present invention. One aspect of the present invention provides a system library, which includes strongly typed classes that enterprise applications may use in order to obtain code assist and compile time checking from IDE tools typically used by enterprise application developers. Another aspect of the present invention provides the ability to define platform independent models that enable service use cases in order to determine what basic services are needed by the enterprise application. Yet another aspect of the present invention includes an integrated generator that generates the strongly typed components and skeleton code from the platform independent models by applying best practice pattern usage for the target platform currently used with the system library functions.

A method and several variants for optimizing the detection of out of bounds array references in computer programs are described, while preserving the semantics of the computer program. Depending on the variant implemented, the program is divided at run-time or compile-time into two or more regions. The regions are differentiated by the number of checks that need to be performed at run-time on the array accesses within the region. In particular, some regions of the program will not need any array bounds checks performed at run-time, which will increase the speed at which the computer program executes. As well, the state of program variables at the time any out of bounds access is detected is the same as the state of the program variables would have been had the transformation not been performed. Moreover, the regions not needing any checks at run-time will be known at compile-time, enabling further compiler optimizations on the region. The variants of the method are distinguished by the number of regions created, the number of checks needed at run-time, and the size of the program that results from the optimization.

A system and method for automatic data mapping of a source object to a target object. Field maps can be automatically determined from the source and target objects, database platform, ETL maps, user-defined and data conversion rules, default values, or other pre-defined parameters. Where a change occurs in the source or target data structure, the present invention ensures proper mapping between the source and target data structures occurs, thus reducing the burden of exception handling on the user and preventing oversight in correcting improper mapping. The present invention can also be used by a compiler to generate SQL steps during compile-time processes to design field maps that can be stored as an application class.

Described herein are optimizations and execution strategies for spreadsheet extensions to SQL. The partitioning of data, as specified in a spreadsheet clause, provides a way to parallelize the computation of spreadsheet and to provide and improve scalability. Even if the partitioning is not explicitly specified in the spreadsheet clause, the database optimizer can automatically infer the partitioning in some cases. Efficient hash based access structures on relations can be used for symbolic array addressing, enabling fast computation of formulas. When rewriting SQL statements, formulas whose results are not referenced in outer blocks can be removed from the spreadsheet clause, thus removing unnecessary computations. The predicates from other query blocks can be moved inside query blocks with spreadsheets clauses, thus considerably reducing the amount of data to be processed. Conditions for validity of this transformation are given.

A compiler that completes compilation upon identifying unresolvable input during compilation instead of aborting compilation. This can be accomplished by inserting an exception-throwing instruction, and / or handlers in place of the unresolvable input in the compiled code output. If the section of the compiled code containing the inserted exception throwing instruction is later executed, an exception is thrown and / or handled. Compilation of code from a trusted source can be completed without inserting an exception throwing instruction when the code has only suspected but unverifiable problems.

A computer system may recognize a busy-wait loop in program instructions at compile time and / or may recognize busy-wait looping behavior during execution of program instructions. The system may recognize that an exit condition for a busy-wait loop is specified by a conditional branch type instruction in the program instructions. In response to identifying the loop and the conditional branch type instruction that specifies its exit condition, the system may influence or override a prediction made by a dynamic branch predictor, resulting in a prediction that the exit condition will be met and that the loop will be exited regardless of any observed branch behavior for the conditional branch type instruction. The looping instructions may implement waiting for an inter-thread communication event to occur or for a lock to become available. When the exit condition is met, the loop may be exited without incurring a misprediction delay.

An annotation based development platform for asynchronous web services is described. In one embodiment, the developer expresses logic offered by the web service using a standard programming language augmented with declarative annotations specifying preferences for exposing that logic as an asynchronous web service. At compile time, an enhanced compiler analyzes the annotated source file and automatically generates the mechanisms required to expose its functionality as an asynchronous web service.

The invention discloses a software packaging and publishing management method. According to the method, after iterative content of a version is confirmed, a corresponding version number is selected during packaging, only a needed script is generated, the content needing to be published is precisely controlled, and codes which are not tested are prevented from being deployed into a formal environment; when script packaging is executed, components with source codes not updated are not recompiled, therefore, only changed parts are compiled, compiling time is shortened, and incremental compiling is realized; based on version tracing of historical version logs, a log directory is generated every time packaging is performed; and when a user needs to generate a historical version of a certain time, logs of the needed historical version are selected, a packaging script is selected from the logs, and a script command is executed to generate a needed package. In this way, it is not needed to back up generated packages every time packaging is performed, only the package generated this time is stored, therefore, storage space is reduced, and maintenance of the historical version is realized with little hard-disk space.

Memoization may be deployed using a configuration file or database that identifies functions to memorize, and in some cases, includes input and result values for those functions. At compile time, functions defined in the configuration file may be captured and memoized. During compilation or other pre-execution analysis, the executable code may be modified or otherwise decorated to include memoization code. The memoization code may store results from a function during the first execution, then merely look up the results when the function may be called again. The memoized value may be stored in the configuration file or in another data store. In some embodiments, the modified executable code may operate in conjunction with an execution environment, where the execution environment may optionally perform the memoization.

One embodiment of a computing system configured to manage divergent threads in a thread group includes a stack configured to store at least one token and a multithreaded processing unit. The multithreaded processing unit is configured to perform the steps of fetching a program instruction, determining that the program instruction is an indirect branch instruction, and processing the indirect branch instruction as a sequence of two-way branches to execute an indirect branch instruction with multiple branch addresses. Indirect branch instructions may be used to allow greater flexibility since the branch address or multiple branch addresses do not need to be determined at compile time.