2007 Australian Software Engineering Conference (ASWEC'07) 2007
DOI: 10.1109/aswec.2007.35
|View full text |Cite
|
Sign up to set email alerts
|

On the Learnability of Two Representations of Equivalence Partitioning and Boundary Value Analysis

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 experimen… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
7
0
2

Year Published

2012
2012
2020
2020

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 9 publications
(9 citation statements)
references
References 19 publications
(27 reference statements)
0
7
0
2
Order By: Relevance
“…It is important to point out that this paper does not focus on individual testing techniques that can be used within the testing process. For example, common testing techniques in ST for black‐box testing include, boundary value analysis , equivalence partitioning , and decision tables . For ST, the commonly used white‐box testing techniques include decision coverage , path coverage , multiple condition/decision coverage (MC/DC) , and data flow coverage .…”
Section: Introductionmentioning
confidence: 99%
“…It is important to point out that this paper does not focus on individual testing techniques that can be used within the testing process. For example, common testing techniques in ST for black‐box testing include, boundary value analysis , equivalence partitioning , and decision tables . For ST, the commonly used white‐box testing techniques include decision coverage , path coverage , multiple condition/decision coverage (MC/DC) , and data flow coverage .…”
Section: Introductionmentioning
confidence: 99%
“…As for the model library  , we may set the library as an open frame and firstly put some typical models into the library, such as the linear regression model, the non-linear model, the time series model [5] (AR, MA, ARMA, ARX, ARXMA, etc), the polynomial model and the dynamicmeasurement model [8] for continuous variable dynamic system and the Petri net model, the automaton model, and Markov chain model for discrete event dynamic model. When the library being used, open frame can be helpful to update and to add new models into the library  on-line.…”
Section: Fig2 Network Modelmentioning
confidence: 99%
“…maximum, minimum, just inside/outside boundaries, typical values, and error values [3] . It is similar to equivalence partitioning but focuses on "corner cases" [4,5] . In this paper, we investigate how to design a practical boundary test approach.…”
Section: Introductionmentioning
confidence: 99%
“…Equivalence class testing is based upon the assumption that a program's input and output domains can be partitioned into a finite number of (valid and invalid) classes such that all cases in a single partition exercise the same functionality or exhibit the same behaviour[20] [29]. The partitioning is done such that the program behaves in a similar way to every input value belonging to an equivalence class.…”
mentioning
confidence: 99%
“…Equivalence class is determined by examining and analysing the input data range. Only one test case from each partition is required, which reduces the number of test cases necessary to achieve functional coverage[20] [29]. The success of this approach depends upon the tester being able to identify partitions of the input and output spaces for which, in reality, cause distinct sequences of program source code to be executed[l].…”
mentioning
confidence: 99%