Canada Spends Logo

Explorez notre analyse du budget 2026

Grant: Discovery Grants Program - Individual

University of Ottawa

$17,000.00

Covering arrays and combinatorial algorithms

EF 2008-09

Résumé
This project centers around constructing covering arrays, which are used in component testing of software and hardware. In fact, covering arrays can be used for testing any system for which the following problem arises: select scenarios that specify the level of various factors in such a way that interactions among factors are identified. Components of a software system may have been individually tested, but faults often result from the interaction of certain components. To avoid this problem, we could test every possible combination of components. However, this results in test suits of enourmous sizes even for small number of components. Instead, we can use a covering array, which produces reasonable sized test suits while guaranteeing to test a specified degree of interaction (pairwise, 3-wise, 4-wise, etc). This is a compromise that has been very successfull in fault detection for software interaction. It has been verified in several experimental studies that a large number of errors can be detected by testing  pairwise or 3-wise interaction of components. This project aims at the development of mathematical and computational constructions of optimal covering arrays. The project also covers other topics in the general area of combinatorial algorithms.
Programme
Discovery Grants Program - Individual
Bénéficiaire
Emplacement
Ontario, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data

Tel que publié

Application id
238734-2006
Name nom
Moura, Lucia
Department département
Information Technology and Engineering, School of
Organization id
28
Institution établissement
University of Ottawa
Province en
Ontario
Province fr
Ontario
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2008
Competition year année de concours
2006
Award amount
17000
Program id
RGPIN
Program nane en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
Group en
Discovery grants programs
Group fr
Programmes de subventions à la découverte
Committee code
331
Committee name en
Computing and Information Sciences - B
Committee name fr
Informatique - B
Area of application code
801
Area of application group en
Information and communication services
Area of application group fr
Services d'information et de télécommunications
Area of application en
Computer software
Area of application fr
Logiciel
Research subject code
2713
Research subject group en
Information technology
Research subject group fr
Technologie de l'information
Research subject en
Algorithms
Research subject fr
Algorithmes
Partie
3
Nb partie
5
Application title
Covering arrays and combinatorial algorithms
Keyword
NA
Application summary
This project centers around constructing covering arrays, which are used in component testing of software and hardware. In fact, covering arrays can be used for testing any system for which the following problem arises: select scenarios that specify the level of various factors in such a way that interactions among factors are identified. Components of a software system may have been individually tested, but faults often result from the interaction of certain components. To avoid this problem, we could test every possible combination of components. However, this results in test suits of enourmous sizes even for small number of components. Instead, we can use a covering array, which produces reasonable sized test suits while guaranteeing to test a specified degree of interaction (pairwise, 3-wise, 4-wise, etc). This is a compromise that has been very successfull in fault detection for software interaction. It has been verified in several experimental studies that a large number of errors can be detected by testing  pairwise or 3-wise interaction of components. This project aims at the development of mathematical and computational constructions of optimal covering arrays. The project also covers other topics in the general area of combinatorial algorithms.