Variable computational use

De Software testing
Ir para: navegação, pesquisa

Concepts


Facts

  • Let z be a node in definition-computational use pair set of the variable x defined at the node q. Suppose that program P is executed against test case t and the complete path transversed is <math>p = (n_{1}, n_{i_{1}}, ..., n_{i_{l}}, n_{i_{l}+1}, ..., n_{i_{m}}, n_{i_{m}+1}, ..., n_{k})</math>, where <math>2 <= i_{j} < k for 1 <= j <= k</math>. This computational use of the variable x is considered covered if <math>q = n_{i_{1}}<math> and <math>s = n_{i_{m}}</math>, and the path <math>(n_{i_{j}}, n_{i_{j} + 1}, ..., n_{i_{m}})</math> is a definition-clear path from node q to node z. <bib>mathur:2008, 468</bib>