Publication Date



Technical Report: UTEP-CS-97-37a

Published in Bulletin of the European Association for Theoretical Computer Science (EATCS), 1998, Vol. 66, pp. 150-154.


The "clean bill of health" produced by such a technique does not guarantee that the program is actually correct. In this paper, we show that several heuristic techniques for software testing that have been developed in software engineering can be rigorously justified. In this justification, we use Kolmogorov complexity to formalize the terms "simple" and "random" that these techniques use. The successful formalization of simple heuristics is a good indication that Kolmogorov complexity may be useful in formalizing more complicated heuristics as well.