Automatic test case generation from relational algebra queries

W. T. Tsai, D. Volovik, T. F. Keefe, M. E. Fayad

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

The authors: (1) develop mapping rules from the relational algebra to linear predicates defining relations in the (output) domain; (2) describe how these predicates can be interpreted in the (input) domain using fQ, a specified query relation; (3) describe a translation from these predicates to sets of systems of linear inequalities; and (4) discuss the use of a set of systems of linear inequalities to generate complete test cases, inputs, and expected outputs from the queries using the domain testing theory. The proposed techniques support software development based on specification testing, specification-directed testing, and rapid prototyping.

Original languageEnglish (US)
Title of host publicationProceedings - IEEE Computer Society's International Computer Software & Applications Conference
EditorsGeorge J. Knafl
PublisherPubl by IEEE
Pages252-258
Number of pages7
ISBN (Print)0818608730
StatePublished - Dec 1 1988

Publication series

NameProceedings - IEEE Computer Society's International Computer Software & Applications Conference

ASJC Scopus subject areas

  • Software
  • Computer Science Applications

Fingerprint Dive into the research topics of 'Automatic test case generation from relational algebra queries'. Together they form a unique fingerprint.

  • Cite this

    Tsai, W. T., Volovik, D., Keefe, T. F., & Fayad, M. E. (1988). Automatic test case generation from relational algebra queries. In G. J. Knafl (Ed.), Proceedings - IEEE Computer Society's International Computer Software & Applications Conference (pp. 252-258). (Proceedings - IEEE Computer Society's International Computer Software & Applications Conference). Publ by IEEE.