A2Q2v2 - d d d d d d d d d d WW Wdddddddddd W WW  h...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: / d d d d d d d d d d WW Wdddddddddd W WW /  / h / hW  applyFactorToTextSize, since there only exist one big nested if-statement instead of many if statements. The choice for paths are limited, thus to cover ADC, AUC and ADUPC are simple(because you cant have a cycle inside du-paths). In this case PPC is stronger than ADC, AUC and ADUPC, because it covered more paths thus, creating more possible / test cases. (ex. ADC, AUC, ADUPC does not cover 1,2,3,16 because there are no def-use path exist for node 1 and 16, but it is an important and most have test case for this method. ...
View Full Document

This note was uploaded on 03/19/2010 for the course CS 447 taught by Professor Lam during the Winter '10 term at Waterloo.

Ask a homework question - tutors are online