Abstract: A system and method provides turn-by-turn directions by identifying placemarks, such as businesses or other landmarks that appear along a traveled route. The system may determine whether signage is associated with each placemark along the route and whether the signage is visible from the route. The system may also determine how prominent the signage is from the route. The system selects the placemark by determining how easily the placemark may be identified from the route, based on the signage's visibility and prominence. The selected placemark may then be identified in connection with the turn-by-turn directions.

Abstract: Techniques are provided for modeling memory operations when generating test cases to verify multi-processor designs. Each memory operation has associated therewith a set of transfer attributes that can be referenced by a test generator. Using the transfer attributes, it is possible to generate a variety of interesting scenarios that handle read-write collisions and generally avoid reloading or resources. The model provides accurate result prediction, and allows write access restrictions to be removed from sensitive memory areas, such as control areas.

Abstract: The invention provides a computer-implemented method for generating a solution to a constraint satisfaction problem (CSP). The method operates to implement various steps that include defining the CSP problem by a set of variable having finite domains, and constraints defined over the variables, solving the CSP by assigning values to said variables that are consistent with the constraints and debugging the CSP solution. The debugging of the CSP solution is carried out by iteratively executing a propagator to reduce the variable domain. Augmenting the constraints is carried out to supply an explanation for particular values assigned to the variables, and constraints defined over the variable utilized in the solution.

Abstract: Systems and methods for determining whether a first system model is consistent with a second system model in a verification system are provide. The method comprises generating a first constraint satisfaction problem (CSP) from a first system model; solving the first CSP to generate a first solution; generating a second CSP from a second system model; determining that the first and second system models are inconsistent, in response to the first solution failing to validate against the second CSP; solving the second CSP to generate a second solution; and determining that the first and second system models are inconsistent, in response to the second solution failing to validate against the first CSP.

Abstract: Techniques are provided for modeling memory operations when generating test cases to verify multi-processor designs. Each memory operation has associated therewith a set of transfer attributes that can be referenced by a test generator. Using the transfer attributes, it is possible to generate a variety of interesting scenarios that handle read-write collisions and generally avoid reloading or resources. The model provides accurate result prediction, and allows write access restrictions to be removed from sensitive memory areas, such as control areas.

Abstract: A computer-implemented method for modeling a target system includes defining a conditional constraint satisfaction problem (CondCSP) that characterizes the target system in terms of problem variables and constraints applicable to the problem variables. The constraints include conditional constraints, such that the variables associated with the conditional constraints each have a respective activity status. Existence variables are defined to represent the respective activity status of the variables associated with each of the one or more conditional constraints. A solution to the CondCSP is found by determining an assignment of the problem variables and the existence variables that satisfies the constraints.

Abstract: A computer-implemented method for modeling a target system includes defining a conditional constraint satisfaction problem (CondCSP) that characterizes the target system in terms of problem variables and constraints applicable to the problem variables. The constraints include conditional constraints, such that the variables associated with the conditional constraints each have a respective activity status. Existence variables are defined to represent the respective activity status of the variables associated with each of the one or more conditional constraints. A solution to the CondCSP is found by determining an assignment of the problem variables and the existence variables that satisfies the constraints.