Condition-based software testing strategies

Author

Tai, K.-C.

Author_Institution

Dept. of Comput. Sci., North Carolina State Univ., Raleigh, NC, USA

fYear

1990

fDate

31 Oct-2 Nov 1990

Firstpage

564

Lastpage

569

Abstract

The author defines two condition testing strategies, BRO (Boolean and relational operator) and BRE (Boolean and relational expression) testing. These two testing strategies are different from existing condition testing strategies in that they are based on the detection of both Boolean and relational expression errors in a condition. For a condition with n operands, the number of tests required by BRO or BRE testing is at most 2(n+1). Based on empirical studies of the algorithms SBEMIN and SBEMINSEN and the theoretical properties of BRO and BRE testing, it is believed that BRO and BRE testing is practical and effective for testing programs containing complicated conditions

Keywords

program testing; programming theory; BRE; BRO; Boolean and relational expression; Boolean and relational operator; SBEMIN; SBEMINSEN; condition testing strategies; Arithmetic; Bismuth; Computer science; Electronic mail; Software testing;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer Software and Applications Conference, 1990. COMPSAC 90. Proceedings., Fourteenth Annual International

Conference_Location

Chicago, IL

Print_ISBN

0-8186-2054-4

Type

conf

DOI

10.1109/CMPSAC.1990.139432

Filename

139432

Link To Document

https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2570734