loading...
On the Learnability of Two Representations of Equivalence Partitioning and Boundary Value Analysis
Melbourne, Australia April 10-April 13
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ASWEC.2007.352007 Australian Software Engineering ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Tafline Murnane, La Trobe University, Australia
Karl Reed, La Trobe University, Australia
Richard Hall, La Trobe University, Australia
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.
Citation:
Tafline Murnane, Karl Reed, Richard Hall, "On the Learnability of Two Representations of Equivalence Partitioning and Boundary Value Analysis," aswec, pp.274-283, 2007 Australian Software Engineering Conference (ASWEC'07), 2007
Usage of this product signifies your acceptance of the Terms of Use.