An Exact Array Reference Analysis for Data Flow Testing
Abstract
Data flow testing is a well-known technique, and it is proved to be better than the
commercially used branch testing. The problem with data flow testing is that except
scalar variables only approximate information is available. This paper presents an
algorithm that determines the definition use pairs for arrays precisely within a
large domain. There are numerous methods addressing array data flow problem, however,
requires at least one real solution of the problem for which the necessary program
path is executed. On the contrary to former precise methods, we avoid negation in
formulae, which seems to be the biggest problem in all previous methods.
Address
P.O Box 63 XI. Kende u. 13-17. H-1502 Budapest, Hungary
Institution
Computer and Automation Insititute Hungarian Academy of Science
Journal
IEEE Proceedings of ICSE-18
Publication Date
0000-00-00
Location
A hard-copy of this is in the Papers Cabinet