Dynamic analysis methods for the year 2000 problem

✍ Scribed by Wilde, Norman; Justice, Randy; Blackwell, Kristin; Wong, W. Eric

• Publisher: John Wiley and Sons
• Year: 1999
• Tongue: English
• Weight: 175 KB
• Volume: 11
• Category: Article
• ISSN: 1040-550X
• DOI: 10.1002/(sici)1096-908x(199905/06)11:3<167::aid-smr190>3.0.co;2-n

✦ Synopsis

Programmers working on the year 2000 problem need to locate and understand date sensitive code, that is, code whose execution depends on date inputs. This paper presents several dynamic analysis methods for addressing this problem. Date sensitive code can be located by running many test cases that are identical except for a change in one date value. An advanced test coverage tool can recover each test's execution count vector giving the number of times that each basic block was executed. Comparison of the vectors reveals the blocks whose execution is affected by the input date values. We present several methods of analysing the execution count data to locate date algorithms. One method identifies subdomains, that is, ranges of dates that are processed similarly. Another method involves graphical or Fourier analysis to identify common programming patterns such as leap-year computations. The last method exploits the 28-year regularity in dates to look for anomalies in processing. The methods are illustrated using Bellcore's ATAC testing tool on five C programs that use some of the date encodings that year 2000 maintainers may need to locate and understand.