Sciweavers

108 search results - page 3 / 22
» Constructing interaction test suites with greedy algorithms
Sort
View
SAC
2009
ACM
14 years 2 months ago
An empirical study of incorporating cost into test suite reduction and prioritization
Software developers use testing to gain and maintain confidence in the correctness of a software system. Automated reduction and prioritization techniques attempt to decrease the...
Adam M. Smith, Gregory M. Kapfhammer
JSS
2010
104views more  JSS 2010»
13 years 2 months ago
Using hybrid algorithm for Pareto efficient multi-objective test suite minimisation
Test suite minimisation techniques seek to reduce the effort required for regression testing by selecting a subset of test suites. In previous work, the problem has been considere...
Shin Yoo, Mark Harman
COMPSAC
2006
IEEE
14 years 1 months ago
Backtracking Algorithms and Search Heuristics to Generate Test Suites for Combinatorial Testing
Combinatorial covering arrays have been used in several testing approaches. This paper first discusses some existing methods for finding such arrays. Then a SAT-based approach a...
Jun Yan, Jian Zhang
INFSOF
2006
151views more  INFSOF 2006»
13 years 7 months ago
Prioritized interaction testing for pair-wise coverage with seeding and constraints
Interaction testing is widely used in screening for faults. In software testing, it provides a natural mechanism for testing systems to be deployed on a variety of hardware and so...
Renée C. Bryce, Charles J. Colbourn
SCAM
2008
IEEE
14 years 1 months ago
Constructing Subtle Faults Using Higher Order Mutation Testing
Traditional mutation testing considers only first order mutants, created by the injection of a single fault. Often these first order mutants denote trivial faults that are easil...
Yue Jia, Mark Harman