Publication | Closed Access
On the Learnability of Two Representations of Equivalence Partitioning and Boundary Value Analysis
13
Citations
11
References
2007
Year
Unknown Venue
Mathematical ProgrammingEngineeringSymbolic Data AnalysisComparative TestVerificationEquivalence PartitioningSoftware AnalysisAtomic RulesUnsupervised Machine LearningFormal VerificationPattern RecognitionTest DerivationEquivalence CheckingLa Trobe UniversityTestabilityApproximation TheoryStatisticsComputational Learning TheoryTesting TechniqueComputer ScienceAutomated ReasoningProgram AnalysisSoftware TestingPartition (Database)Formal MethodsBoundary Value Analysis
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.
| Year | Citations | |
|---|---|---|
Page 1
Page 1