This Article 
 Bibliographic References 
 Add to: 
Automated Test Case Generation for Programs Specified by Relational Algebra Queries
March 1990 (vol. 16 no. 3)
pp. 316-324

Black-box software testing requires test cases to be generated from specifications alone. However, it is impossible to automate the process completely for arbitrary specifications. Specifications are thus restricted to being written entirely in terms of relational algebra expressions. An automated test case generation method is developed for such specifications.

[1] R. Yeh, P. Zave, A. P. Conn, and G. E. Cole, "Software requirements: new directions and perspectives," inHandbook of Software Engineering. New York: Van Norstrand Reinhold, 1984.
[2] G. J. Myers,The Art of Software Testing. New York: Wiley, 1979.
[3] L. J. White, E. I. Cohen, and B. Chandrasekaran, "A domain strategy for computer program testing," Comput. Inform. Sci. Res. Center, Ohio State Univ., Columbus, Tech. Rep. OSU-CISRC-TR-78-4, 1978.
[4] L. J. White and E. I. Cohen, "A domain strategy for computer program testing,"IEEE Trans. Software Testing, vol. SE-6, pp. 247-257, May 1980.
[5] E. J. Weyuker and T. J. Ostrand, "Theories of program testing and the application of revealing subdomains,"IEEE Trans. Software Eng., vol. SE-6, pp. 236-246, 1980.
[6] L. A. Clarke, J. Hassell, and D. J. Richardson, "A close look at domain testing,"IEEE Trans. Software Eng., vol. SE-8, no. 4, pp. 380-390, July 1982.
[7] L. A. Clarke, "A system to generate test data and symbolically execute programs,"IEEE Trans. Software Eng., vol. SE-2, no. 3, pp. 215-222, Sept. 1976.
[8] L. A. Clarke and D. J. Richardson, "Validation by symbolic evaluation of symbolic execution," inSoftware ValidationH.-L. Hausen, Ed. Amsterdam, The Netherlands: North-Holland, 1984.
[9] J.E. Hopcroft and J.D. Ullman,Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, Reading, Mass., 1979.
[10] J. D. Ullman,Principles of Databases Systems. Rockville, MD: Computer Science Press, 1982.
[11] P. M. D. Gray, "Prototyping batch data processing application in Prolog," Dept. Comput. Sci. Aberdeen Univ.. Aberdeen, Scotland, 1985.
[12] E. Horowitz, A. Kemper, and B. Narasimhan, "An analysis of application generators,"IEEE Software, vol. 2, no. 1, pp. 40-54, Jan. 1985.
[13] J. Martin,Fourth-Generation Languages, Vol. 1, Prentice-Hall, Englewood Cliffs, N.J., 1985, pp. 1-20.
[14] R. A. Kemmerer, "Testing formal specifications to detect design errors,"IEEE Trans. Software Eng., vol. SE-11, no. 1, pp. 32-43, Jan. 1985.
[15] B. Boehm, "Verifying and validating software requirements and design specifications,"IEEE Software, vol. 1, no. 1, pp. 75-88, Jan. 1984.
[16] T. Anderson, Ed.,Software Requirements, Specification and Testing, Proc. CSR Workshop, Univ. East Anglia, Apr. 10-12, 1984, Oxford, England: Blackwell, 1985.
[17] M. Chandraksekharanet al., "Requirements-based testing of real-time systems: Modeling for testability,"Computer, vol. 18, no. 4, pp. 71-79, Apr. 1985.
[18] I. J. Hayes, "Specification-directed module testing,"IEEE Trans. Software Eng., vol. SE-12, pp. 124-133, Jan. 1986.
[19] F. Bazzichi and I. Spadafora, "An automatic generator for compiler testing,"IEEE Trans. Software Eng., vol. SE-8, no. 4, pp. 343-353, July 1982.
[20] S. V. Jablonski,Introduction in Discrete Mathematic. Moscow: Nauka, 1979.
[21] D. G. Luenberger,Introduction to Linear and Nonlinear Programming, 2nd ed. Reading, MA: Addison-Wesley, 1984.

Index Terms:
black-box software testing; relational algebra queries; arbitrary specifications; relational algebra expressions; automated test case generation method; automatic programming; formal specification; program testing; relational databases.
W.T. Tsai, D. Volovik, T.F. Keefe, "Automated Test Case Generation for Programs Specified by Relational Algebra Queries," IEEE Transactions on Software Engineering, vol. 16, no. 3, pp. 316-324, March 1990, doi:10.1109/32.48939
Usage of this product signifies your acceptance of the Terms of Use.