摘要:
A return request processing engine automatically approves or denies requests for authorization to return a purchased item to the seller of the item. The return request processing engine utilizes return request rules to determine whether a particular return request can be approved or denied without input from the seller. When a request is received from a buyer to return an item, the return request processing engine utilizes the return request rules to determine if the request to return the item can be automatically approved or denied without input from the seller. If the return request processing engine cannot automatically approve or deny a return request, the return request processing engine causes a message to be transmitted to the seller of the item that provides a user interface through which the seller can indicate whether the return request is approved or denied by way of a single user input.
摘要:
A system and method is disclosed for formal verification of software programs that advantageously bounds the ranges of values that a variable in the software can take during runtime.
摘要:
A symbolic disjunctive image computation method for software models which exploits a number of characteristics unique to software models. More particularly, and according to our inventive method, the entire software model is decomposed into a disjunctive set of submodules and a separate set of transition relations are constructed. An image/reachability analysis is performed wherein an original image computation is divided into a set of image computation steps that may be performed on individual submodules, independently from any others. Advantageously, our inventive method exploits variable locality during the decomposition of the original model into the submodules. By formulating this decomposition as a multi-way hypergraph partition problem, we advantageously produce a small set of submodules while simultaneously minimizing the number of live variable in each individual submodule. Our inventive method produces a set of disjunctive transition relations directly from the software model, without producing a conjunctive transition relation—as is necessary in the prior art. In addition, our inventive method exploits the exclusive use of live variables in addition to novel search strategies which provide still further benefit to our method.
摘要:
There is provided a method of solving a SAT problem comprising partitioning SAT-formula clauses in the SAT problem into a plurality of partitions. Each of said plurality of partitions is solved as a separate process each, thereby constituting a plurality of processes where each of said process communicates only with a subset of the plurality of processes.
摘要:
FIG. 1 is an isometric view of a rotatable wall-mount rack assembly showing my new design; FIG. 2 is a front elevation view thereof. FIG. 3 is a rear elevation view thereof. FIG. 4 is a right side elevation view thereof. FIG. 5 is a left side elevation view thereof. FIG. 6 is a top plan view thereof; and, FIG. 7 is a bottom plan view thereof. The broken lines are for environmental purposes only and form no part of the claimed design.
摘要:
FIG. 1 is a front isometric view of the combination panels for horizontal wall mount rack according to our design; FIG. 2 is a front isometric view shown in use; FIG. 3 is a rear isometric view of the combination panels for horizontal wall mount rack shown in FIG. 1; FIG. 4 is an isometric view of the combination panels for horizontal wall mount rack shown in use in FIG. 2; FIG. 5 is a front elevation view of the combination panels for horizontal wall mount rack shown in FIG. 1; FIG. 6 is rear elevation view thereof; FIG. 7 is a top plan view thereof, with the opposite side being a mirror of that shown; and, FIG. 8 is a side elevation view thereof, with the opposite side being a mirror of that shown. The broken lines shown represent unclaimed rails and form no part of the claimed design.
摘要:
An improved method for automatically improving the precision of an extrapolation operator used, for example, in software program verification in connection with the static analysis and model checking of the software programs which rely on fix-point computation. In particular, a new extrapolation-with-care-set operator, together with a method for gradually increasing the precision of this operation by tightening the care set.
摘要:
A method of obtaining a resolution-based proof of unsatisfiability using a SAT procedure for a hybrid Boolean constraint problem comprising representing constraints as a combination of clauses and interconnected gates. The proof is obtained as a combination of clauses, circuit gates and gate connectivity constraints sufficient for unsatisfiability.