Computer Science and Engineering, Department of


Document Type


Date of this Version



Published in IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, VOL. 28, NO. 6, JUNE 2002. Copyright © 2002 IEEE. Used by permission.


Although there has been recent research into ways to design environments that enable end users to create their own programs, little attention has been given to helping these end users systematically test their programs. To help address this need in spreadsheet systems - the most widely used type of end-user programming language - we previously introduced a visual approach to systematically testing individual cells in spreadsheet systems. However, the previous approach did not scale well in the presence of largely homogeneous grids, which introduce problems somewhat analogous to the array-testing problems of imperative programs. In this paper, we present two approaches to spreadsheet testing that explicitly support such grids. We present the algorithms, time complexities, and performance data comparing the two approaches. This is part of our continuing work to bring to end users at least some of the benefits of formalized notions of testing without requiring knowledge of testing beyond a naive level.