DocumentCode :
2412973
Title :
On the Learnability of Two Representations of Equivalence Partitioning and Boundary Value Analysis
Author :
Murnane, Tafline ; Reed, Karl ; Hall, Richard
Author_Institution :
Dept. of Comput. Sci. & Comput. Eng., La Trobe Univ.
fYear :
2007
fDate :
10-13 April 2007
Firstpage :
274
Lastpage :
283
Abstract :
Currently, equivalence partitioning and boundary value analysis are taught at La Trobe University using Myers´ original representation of these black-box testing methods. We previously proposed an alternative representation called atomic rules. In this paper we present the statistical results of two similar experiments that examine which of these approaches enable students to write more complete and correct black-box test sets and which approach students prefer to use. We compare the results of these experiments and discuss how the results could change the teaching of black-box testing methods at La Trobe University and in industry.
Keywords :
computer science education; program testing; teaching; La Trobe University; atomic rules; black-box testing; boundary value analysis; equivalence partitioning; teaching; Australia; Computer science; Education; Equal opportunities; Software engineering; Software testing; System testing; Usability;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Software Engineering Conference, 2007. ASWEC 2007. 18th Australian
Conference_Location :
Melbourne, Vic.
ISSN :
1530-0803
Print_ISBN :
0-7695-2778-7
Type :
conf
DOI :
10.1109/ASWEC.2007.35
Filename :
4159680
Link To Document :
بازگشت