On data flow guided program testing
Janusz W. Laski · ACM SIGPLAN Notices · 1982
A structural approach to testing employing properties of data flow in a program is proposed. The basic notion introduced is that of data context of a program block. It represents the set of all tuples of definitions of the block arguments that are simultaneously live when the control reaches the block. Two testing strategies have been proposed: block testing, exercising every block for all its elementary contexts and d-tree testing exercising the definition tree rooted at an elementary context of the stop/exit instruction.