Patent application number | Description | Published |
20110041171 | TECHNIQUES FOR VIRTUAL REPRESENTATIONAL STATE TRANSFER (REST) INTERFACES - Techniques for virtual Representational State Transfer (REST) interfaces are provided. A proxy is interposed between a client and a REST service over a network. The proxy performs independent authentication of the client and provides credentials to the client and for the client to authenticate to the REST service using a REST service authentication mechanism. The proxy inspects requests and responses and translates the requests and responses into formats expected by the client and the REST service. Moreover, the proxy enforces policy and audits the requests and responses occurring between the client and the REST service over the network. | 02-17-2011 |
20120173728 | POLICY AND IDENTITY BASED WORKLOAD PROVISIONING - Techniques for policy and identity-based workload provisioning are presented. Identities for requestors or workloads and identities for workloads are tied to specific policies. The specific policies are evaluated based on a stage of readiness for resources within a resource pool and based on resource identities for the resources within the resource pool. Resources are then dynamically provisioned based on the identity-based policy evaluation to handle workloads from the resource pool. | 07-05-2012 |
20120198375 | MULTI-CONDITION RESOURCE PLANNING - Techniques for multi-condition resource planning are presented. A principal interactively establishes a resource plan for a workflow by making selections for the workflow. Impacts that are forecasted based on the selections are dynamically presented to the principal and the principal is permitted to make adjustments. The finalized resource plan results in the workflow that is subsequently processed according to policy. | 08-02-2012 |
20140359132 | POLICY AND IDENTITY BASED WORKLOAD PROVISIONING - Techniques for policy and identity-based workload provisioning are presented. Identities for requestors or workloads and identities for workloads are tied to specific policies. The specific policies are evaluated based on a stage of readiness for resources within a resource pool and based on resource identities for the resources within the resource pool. Resources are then dynamically provisioned based on the identity-based policy evaluation to handle workloads from the resource pool. | 12-04-2014 |
20150281286 | TECHNIQUES FOR VIRTUAL REPRESENTATIONAL STATE TRANSFER (REST) INTERFACES - Techniques for virtual Representational State Transfer (REST) interfaces are provided. A proxy is interposed between a client and a REST service over a network. The proxy performs independent authentication of the client and provides credentials to the client and for the client to authenticate to the REST service using a REST service authentication mechanism. The proxy inspects requests and responses and translates the requests and responses into formats expected by the client and the REST service. Moreover, the proxy enforces policy and audits the requests and responses occurring between the client and the REST service over the network. | 10-01-2015 |
Patent application number | Description | Published |
20080307264 | PARAMETERIZED TEST DRIVEN DEVELOPMENT - In one embodiment a computer system automatically generates unit tests. The computer system accesses a parameterized unit test that provides a base outline from which one or more unit tests are automatically generated, generates input parameter values for a unit of software code, automatically generates a unit test configured to assess the functionality of the unit of software code, and receives test results from a software testing program and provides feedback to a user. In other embodiments, a computer system automatically maintains a unit test database. The computer system receives a unit test at a unit test database, assigns a test identity to the received unit test, determines that the test identity assigned to the received unit test is unique when compared to other unit tests, determines that the received unit test has different functionality coverage characteristics, and adds the received unit test to the unit test database. | 12-11-2008 |
20080313602 | BOUNDED PROGRAM FAILURE ANALYSIS AND CORRECTION - In one embodiment, a computer system determines that a previously run test scenario configured to test a software program has failed to produce an expected result due to one or more semantic errors, generates error trace code configured to monitor the called component, processes the test scenario using the error trace code, and analyzes error trace information to determine the point at which the semantic error occurs in the called component. In an alternative embodiment, a computer system detects a semantic error in a software component of a software program, constructs an error condition that may include source code representing a minimum condition under which the error occurs, generates an object invariant based on the error condition that represents an opposite condition to that represented by the error condition, and automatically generates source code change recommendations using the object invariant that prevent the semantic error from reoccurring in subsequent test scenarios. | 12-18-2008 |
20100083233 | Symbolic Runtime Checking of Quantified Contracts - An extension of symbolic execution for programs involving contracts with quantifiers over large and potentially unbounded domains is described. Symbolic execution is used to generate, from a program, concrete test cases that exhibit mismatches between the program code and its contracts with quantifiers. Quantifiers are instantiated using symbolic values encountered during a set of exhibited runs. In this setting, quantifier instantiation is limited to values supplied to or produced by a symbolic execution. Quantifier instantiation is controlled by performing a matching algorithm that uses run-time values of input and program variables in order to guide and limit the set of quantifier instantiations. With a sufficient set of instances, test cases are derived that directly witness limitations of the auxiliary assertions. | 04-01-2010 |
20100281460 | Whitebox Trace Fuzzing - Disclosed is a process to generate and execute relevant, non-redundant test cases starting with an execution trace. An execution trace may be collected. A sequence of actions and the data involved in the actions may then be extracted from the execution trace and persisted separately from one another. Code for a non-deterministic program (“NDP”) may be generated, comprising the sequence of actions but without determining the data. A systematic program analysis of the NDP may be made, exploring possible execution paths and beginning from the path exercised by the persisted data. A new test case may be generated which fixes particular test inputs for the NDP. | 11-04-2010 |
20110055237 | Symbolic Query Exploration - A symbolic query exploration (QEX) module automatically produces output information that can be used to evaluate a database. The QEX module operates by converting an input query into a formula for processing by a satisfiability module theories (SMT) solver module. The SMT solver module generates a model that satisfies the formula. The model yields table information that is used to populate the database and, optionally, parameter information that is used to instantiate the query. A query evaluation module then submits the instantiated query to the populated database and evaluates whether an evaluation result produced thereby agrees with pre-specified condition information. The QEX module can preprocess the formula using either (or both) an eager expansion approach (in which the formula is expanded in an upfront manner) or a lazy expansion approach (in which axioms are identified for later possible expansion by the SMT solver module). | 03-03-2011 |
20110276943 | GENERATING TYPE-SAFE WRAPPERS FOR DYNAMIC DETOURING - An isolation system is described for converting original product code into corresponding modified code. The isolation system operates by identifying a subset of original methods to be converted. For each such original method, the isolation system generates a modified part having at least one property with a type-safe delegate type which matches a signature of the original method. Test code, which tests the product code, can then associate a delegate instance to the thus-defined property of the original method. This prompts an execution system to dynamically execute detour code associated with the delegate instance, rather than an instrumentation of the original method, thus avoiding dependency on potentially non-deterministic functionality which would be otherwise invoked by an instrumentation of the original method. | 11-10-2011 |
20120130932 | SYMBOLIC FINITE AUTOMATA - Described are symbolic finite automata for symbolically expressing and analyzing regular expression constraints, such as for use in program analysis and testing. A regular expression or pattern is transformed into a symbolic finite automaton having transitions that are labeled by formulas that denote sets of characters (rather than individual characters). Also described is composing two or more symbolic finite automata into a resulting symbolic finite automaton that is fully satisfiable. A constraint solver may be used to ensure satisfiability. | 05-24-2012 |
20130055138 | DYNAMICALLY CHANGING KEY SELECTION BASED ON CONTEXT - Editing functionality is described herein for creating a structured data item by dynamically presenting a key arrangement that is deemed suitable at each instance of an editing session. Each key is associated with a component of the structured data item. Upon activation of one of these keys, the editing functionality adds a corresponding component to the item being created. The editing functionality can be implemented on any user device, but is particularly suited for implementation on a handheld computing device having a limited input mechanism and a display mechanism. | 02-28-2013 |
20130151519 | Ranking Programs in a Marketplace System - A marketplace system is described herein for ranking programs based, at least in part, on the assessed distinctiveness of the programs. In one implementation, the marketplace operates by: (a) accessing a set of programs; (b) extracting feature information from each of the programs; (c) generating similarity information for each program, based on the feature information; (d) ranking the programs based at least on the similarity information, to provide ranking information; and (e) providing a user interface presentation that has an effect of promoting at least one distinctive program in the set of applications on the basis of the ranking information. | 06-13-2013 |
20130152154 | Controlling the Release of Private Information Using Static Flow Analysis - A privacy control system is described herein for controlling dissemination of private information by a program. The privacy control system operates by performing static analysis to determine at least one flow within the program of private information, from a source to a sink The static analysis is particularly configured to identify two types of flow, including: (a) an unvetted flow of untampered private information from the source to the sink; and (b) a flow of tampered private information from the source to the sink, whether vetted or unvetted. The privacy control system then prompts the user to provide a privacy control decision regarding the flow. The privacy control decision governs whether actual data or anonymized data is provided to the sink, or whether the program is terminated. A runtime system then runs the program in accordance with the privacy control decision. | 06-13-2013 |
20140282375 | Generating Program Fragments Using Keywords and Context Information - A program development framework (PDF) is described herein which allows a user to produce a program in piecemeal fashion by successively specifying program fragments. The PDF creates a new program fragment by receiving keyword information from the user that describes a new program fragment, and then identifies context information that pertains to a programmatic context in which the new program fragment appears within the overall program being created. The PDF then generates a set of candidate program fragments that satisfy the keyword information and the context information, and ranks those candidate program fragments based on ranking information. At least part of the ranking information may be based on statistical information that is produced by analyzing a corpus of previous programs produced by one or more users. The PDF then provides the ranked program fragments to the user using various user-friendly presentation strategies. | 09-18-2014 |
20140380205 | Interface Development and Operation - Some implementations provide techniques and arrangements for interactive user interface operation and development. For instance, some implementations may generate a user interface data structure representing a user interface, the user interface data structure being generated based at least in part on state data and imperative programming code. Then, in response to a change in one of the imperative programming code or the state data, some implementations may update the user interface data structure and render an updated interactive graphical user interface based on the updated user interface data structure. | 12-25-2014 |
Patent application number | Description | Published |
20160034891 | METHOD AND SYSTEM FOR ACTIVATING CREDENTIALS - Method and apparatus for activating credentials for transmission to a transaction processing system via a data communications network, the credentials being arranged in sets and a set including a unique identifier and verification data elements. Credentials are activated and are then available for use in at least one subsequent transaction. In the transaction, in response to receiving authorization from a user, the unique identifier and verification data elements from a set are transmitted to the transaction processing system on behalf of the user. Responsive to the user successfully authenticating, a plurality of options are transmitted to the user. This plurality of options corresponds to different set of credentials derived at least in part from data received via data communications from one or more trusted data processing systems remote from the user. The user selects one or more of the options resulting in one or more sets of credentials are activated. | 02-04-2016 |
20160034892 | METHOD AND SYSTEM FOR TRANSMITTING CREDENTIALS - Method and apparatus for transmitting credentials to a transaction processing system, the credentials arranged in sets and a set including a unique identifier and verification data elements. Credentials are activated and are then available for use in at least one subsequent transaction. In the transaction, in response to receiving authorization from a user, the unique identifier and verification data elements from a set are transmitted to the transaction processing system for the user. The credentials are activated using an activation mode selected from at least a first activation mode and a second activation mode. In the first activation mode, additional user input for the verification data elements associated with the unique identifier is received from the user. In the second activation mode, the user is authenticated, and verification data elements are received via a data communications network are received from a trusted data processing system remote from the user. | 02-04-2016 |
20160036800 | METHOD AND SYSTEM FOR CREATING A UNIQUE IDENTIFIER - Method and apparatus for creating a second unique identifier for a user in a second system based on a first unique identifier for a user in a first system. A first authentication process is initiated based on a first unique identifier associated with the user in the first system. Responsive to the user successfully authenticating during the first authentication process, the second unique identifier for a user in the second system is generated. The second unique identifier is based on user data associated with the first unique identifier in the first system, and the second unique identifier is different from the first unique identifier. | 02-04-2016 |
Patent application number | Description | Published |
20150130789 | IMAGE COMPOSITION BASED ON REMOTE OBJECT DATA - When a scene is generated, a content item may identify graphics object service requests associated with the scene. Each scene may have any number of associated graphics object service requests that may be sent to any number of different graphics object services. The graphics object services may be accessible over a network such as the Internet. By requesting object data from graphics object services, a content item may, for example, reduce at least part of the computational burden on a graphics processing unit of a client device. | 05-14-2015 |
20150133215 | SERVICE FOR GENERATING GRAPHICS OBJECT DATA - When a scene is generated, a content item may identify graphics object service requests associated with the scene. Each scene may have any number of associated graphics object service requests that may be sent to any number of different graphics object services. The graphics object services may be accessible over a network such as the Internet. By requesting object data from graphics object services, a content item may, for example, reduce at least part of the computational burden on a graphics processing unit of a client device. | 05-14-2015 |
20150134770 | ADAPTIVE SCENE COMPLEXITY BASED ON SERVICE QUALITY - Content, such as a video game, may be delivered by a content provider to a destination using, for example, streaming content delivery techniques. The transmission of the content may be monitored in order to determine transmission conditions such as a quality of the network connection from the content provider to the destination. The determined transmission conditions may then be used to determine adjustments to a complexity of various scenes associated with the content. For example, in some cases, when transmission conditions are unfavorable, scenes may be adjusted by reducing a complexity of the scenes. | 05-14-2015 |
20150134779 | LOCATION OF ACTOR RESOURCES - In an actor system, messages communicated to and from a first actor in a first location of an actor system can be monitored. A message frequency between the first actor and a second actor in a second location of the actor system can be determined. The message frequency can be compared to a threshold message frequency. A determination can be made whether to move the first actor from the first location based on comparison of the message frequency to the threshold message frequency. | 05-14-2015 |
20150134840 | APPLICATION STREAMING SERVICE - A method can include a node receiving a token redemption request from a client computing device. The node can determine a destination host management service based at least in part on a geographic proximity of the destination host management service to the client computing device. The destination host management service can be one of a plurality of host management systems distributed across a plurality of data centers. The node can route the token redemption request to the destination host management service. The destination host management service can determine a destination host running an application in one of the plurality of data centers and provision a session between the client computing device and the application running in the destination host. | 05-14-2015 |