Title :
An exact array reference analysis for data flow testing
Author_Institution :
Comput. & Autom. Inst., Hungarian Acad. of Sci., Budapest, Hungary
Abstract :
Data-flow testing is a well-known technique, and it has proved to be better than the commercially-used branch testing. The problem with data-flow testing is that, apart from scalar variables, only approximate information is available. This paper presents an algorithm that precisely determines the definition-use pairs for arrays within a large domain. There are numerous methods addressing the array data-flow problem; however, these methods are only used in the optimization or parallelization of programs. Data-flow testing, however, requires at least one real solution of the problem for which the necessary program path is executed. Contrary to former precise methods, we avoid negation in formulae, which seems to be the biggest problem in all previous methods
Keywords :
arrays; data flow analysis; program testing; approximate information; data flow testing; definition-use pairs; exact array reference analysis; formulae negation avoidance; precise method; program optimization; program parallelization; program path execution; Data analysis; Input variables; Optimizing compilers; Testing;
Conference_Titel :
Software Engineering, 1996., Proceedings of the 18th International Conference on
Conference_Location :
Berlin
Print_ISBN :
0-8186-7247-1
DOI :
10.1109/ICSE.1996.493450