Sentence examples for dynamic verification from inspiring English sources

In this paper dynamic verification studies of 2D and 3D-DDA performed by the rock mechanics research group at the Ben-Gurion Universitheof the Negev, Israel (BGU), are reviewed.

A number of strategies are proposed for the approach, including strategies for design variables reduction, variable dependency graph development, constraint propagation, and dynamic verification of a design over an assigned set of attributes (variables).

Rewriting-logic environments such as ELAN, the one we use here, are sufficiently versatile to allow for adequate specifications and simulations which through easy modifications of the strategies enable a dynamic verification of aspects intrinsically related to hardware properties such as the size and control of reorder buffers and the method of predictions used by speculative processors.

Assertion checking is one of the dynamic verification techniques for simulation model.

Unlike the static techniques which analyze the program to determine if it is correct (syntax analysis), dynamic verification deals with checking the correctness of the values which are obtained after executing the program [38, 42].

An assessment of age dependency of biometric dynamic signature verification systems is presented.

We shall use a converse result, namely a dynamic programming verification theorem, which takes the following formulation in our context.

In [5] the use of different styluses in dynamic signature verification on an iPad was studied reaching interesting outcomes regarding ergonomics.

Fig. 3 Alignment calibration of SHPB Fig. 4 Measured strain waves at pressure bars with specimen Fig. 5 Dynamic equilibrium verification at both sides of specimen.

"Preliminaries" section gives some key preliminaries: we reformulate the LQCMKV problem into a problem involving the conditional law of the state process as state variable for which a dynamic programming verification theorem is stated and time consistency holds.

Finally, from (19) we see that (D^{alpha ^ =) 0, which gives the ((mathbb {P},mathbb {F}^{0}))-local martingale property of (S^{alpha ^), and we conclude by the dynamic programming verification Lemma 2.1.