| Patent application number | Description | Published |
|---|
| 20080222189 | Associating multidimensional data models - A source multidimensional data model is associated with a target multidimensional data model, for purposes of, for example, copying or linking data between the source and the target. Individual dimensions are mapped from the source to the target. Within each mapped dimension, individual dimension members are mapped from the source to the target. The resulting association may be stored and utilized to generate executable statements for copying or linking data between the source and the target. | 09-11-2008 |
| 20090006448 | AUTOMATED MODEL GENERATOR - A model generation system is provided. The system includes a monitor component to determine user actions and gestures during computer operations. A model component automatically infers a model from the user actions and gestures, where the model is employed to generate a schema in order to provide context for an application or data structure. | 01-01-2009 |
| 20090119324 | INTELLIGENT AND PAPERLESS OFFICE - The claimed subject matter provides a system and/or a method that facilitates collecting and organizing electronic documents. An interface component can receive a document. A manager component can automatically file the document into a category based at least in part upon a portion of static metadata associated with the document and a portion of metadata dynamically generated from an inference related to the portion of static metadata associated with the document. | 05-07-2009 |
| 20090327322 | INFORMATION WORKER CREATING COMPONENT APPLICATION WITHOUT WRITING CODE TO CREATE THE APPLICATIONS - A data processing system for data exchange across application boundaries is provided. The system includes a canvas memory in which to open multiple applications. A transform component generates data structures across the canvas memory in at least one application form and automatically transforms the data structures to at least one other application form to mitigate application boundaries between disparate applications. | 12-31-2009 |
| 20090327896 | DYNAMIC MEDIA AUGMENTATION FOR PRESENTATIONS - A presentation system is provided. The presentation system includes a presentation component that provides an electronic data sequence for one or more members of an audience. A monitor component analyzes one or more media streams associated with the electronic data sequence, where a processing component automatically generates a media stream index or a media stream augmentation for the electronic data sequence. | 12-31-2009 |
| Patent application number | Description | Published |
|---|
| 20090171649 | USER-DEFINED APPLICATION MODELS - A system (and corresponding method) that employs wiki-type models to consider authoring rather than composition in an application environment is provided. The innovation enables collaborative information and templates to be used to enhance quality, productivity, etc. within a software application environment. These wiki-type models can provide features, functions and benefits related to, but not limited to, general information, auto-fills, formats, schema, conversions, preferences, etc. | 07-02-2009 |
| 20090171938 | CONTEXT-BASED DOCUMENT SEARCH - Systems and corresponding methodologies are disclosed that employ ‘context’ of a document upon searching for relevant or desired references/results. The innovation establishes ‘context’ of a document thereby increasing relevance upon returning results to search queries. Context-based searching establishes relationships between terms of a document in order to focus more upon an interpretation of a document rather than merely considering a topic of a document based upon word occurrences, as used by traditional searching mechanisms. | 07-02-2009 |
| 20090300030 | LARGE CAPACITY DATA PROCESSING MODELS - Data is processed with respect to large or practically infinite storage capacity. A cumulative data model is employed to organize accumulation of considerable amounts of data as well as facilitate interaction with the data. Accumulated data can be further processed to aid efficient location of relevant information. For instance, correlation and versioning operations, among others, can be performed to identify relationships amongst data and initiate removal of outdated data, respectively. | 12-03-2009 |
| 20090327230 | STRUCTURED AND UNSTRUCTURED DATA MODELS - Structured and/or unstructured data is processed with the aid of a data model. The data model provides a conceptual description of source content that can be generated or otherwise modified automatically as a function of data, models, and/or structure associated with the data. Both structured and unstructured data can be viewed in terms of high-level content rather than a lower level physical model. Among other things, this view can be employed to aid search as well as data sharing. | 12-31-2009 |
| Patent application number | Description | Published |
|---|
| 20080258865 | BINARY VERIFICATION SERVICE - A binary is received at a binary verification service from a binary verification client agent. The binary verification service performs binary verification of the binary, wherein binary verification includes determining whether the binary is complicit with a set of usage rules. The binary verification service sends a binary verification result to the binary verification client agent. | 10-23-2008 |
| 20090319997 | PRECONDITION RULES FOR STATIC VERIFICATION OF CODE - A verification engine for verifying compliance of a module of computer-executable instructions to various specifications or guidelines can utilize precondition rules to obtain information about the module so as to select appropriate rules with which the module will be verified. The precondition rules can inform an evaluation tool, which can obtain the specified information about the module. A preprocessor can then evaluate conditional statements and select one or more rules or environment modules based on the results of the evaluation of the precondition rules. Multiple levels of dependent precondition rules can be evaluated with a drill-down approach, where each dependency chain is evaluated until a terminal level, or with a layered approach, where all terminal level precondition rules are evaluated followed by precondition rules of increasingly higher levels. | 12-24-2009 |
| 20100186003 | Per Group Verification - Various embodiments provide per group verification techniques in which code may be verified against one or more rules on a group by group basis. In one or more embodiments relationships between portions of a module to be verified can be defined. By being aware of relationships between various code portions, various embodiments can divide a module into related groups and perform verification on the basis of the groups. Multiple groups can be derived based at least in part upon the relationships. Each group can then be verified separately for compliance with one or more rules. Verification results can be output for each of the groups. | 07-22-2010 |
| 20100275186 | SEGMENTATION FOR STATIC ANALYSIS - Various embodiments provide techniques to segment program code that may be the subject of static analysis. In one or more embodiments, an algorithm is applied to an abstract representation of the program code to derive segments for the program code. In at least some embodiments, multiple segments can be derived based at least in part upon of one or more “boxed” portions of the program code that are designated to remain intact within the segments. Each segment can then be subjected individually to static analysis to verify compliance with one or more prescribed behaviors. Verification results can be output for each individual segment and the individual results can be combined to obtain results for the program code overall. | 10-28-2010 |
| 20110088016 | PROGRAM ANALYSIS THROUGH PREDICATE ABSTRACTION AND REFINEMENT - An analysis engine is described for performing static analysis using CEGAR loop functionality, using a combination of forward and backward validation-phase trace analyses. The analysis engine includes a number of features. For example: (1) the analysis engine can operate on blocks of program statements of different adjustable sizes; (2) the analysis engine can identify a subtrace of the trace and perform analysis on that subtrace (rather than the full trace); (3) the analysis engine can form a pyramid of state conditions and extract predicates based on the pyramid and/or from auxiliary source(s); (4) the analysis engine can generate predicates using an increasingly-aggressive series of available discovery techniques; (5) the analysis engine can selectively concretize procedure calls associated with the trace on an as-needed basis and perform other refinements; and (6) the analysis engine can add additional verification targets in the course of its analysis, etc. | 04-14-2011 |
| 20110161937 | PROCESSING PREDICATES INCLUDING POINTER INFORMATION - A system is described for processing predicates in the course of analyzing a program, based on a general-purpose theory of pointers. The system converts location expressions in the predicates into logical formulae that are interpretable by a theorem prover module, producing converted predicates. This conversion associates the location expressions with location objects. More specifically, the conversion represents variables as explicitly-specified location objects, and location terms (such as a field-type access terms and dereference-type terms) as constructor-specified location objects. The theory of pointers is also expressed by a set of axioms which constrain the operation of the theorem prover module. | 06-30-2011 |
