Like the Decker algorithm, the LT algorithm needs stopping conditions and
interleaving to increase the likelihood of detecting a violation of integrity.
One of the inefficiencies of the LT method is that some of the information
obtained during the computation of the sets POS and NEG may be thrown
away and have to be recomputed when evaluating the instantiated constraints.
This redundancy is avoided in our simulation of their algorithm. The search
space shown in Figure 17 is obtained with our method when using the secon ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month, and much more.