Canada Spends Logo

Explorez notre analyse du budget 2026

Grant: Discovery Grants Program - Individual

University of Ottawa

$24,000.00

Combinatorial and algorithmic aspects of covering arrays for software and network testing

EF 2012-13

Résumé
Software implementation errors are responsible for most vulnerabilities in the security of information systems. Combinatorial testing methods can help minimize the cost and increase the effectiveness of software and network testing. A recent publication by the National Institute of Standards and Technology (NIST) of the US Department of Commerce on ""Practical Combinatorial Testing'' (October 2010) provides a thorough report on its effectiveness and its complementary relationship to other software testing methods. Research papers discussing combinatorial testing have been increasing rapidly from a few papers in 1995 to more than 70 in 2009 alone. In the past decade, a number of advances in combinatorial theory and combinatorial testing algorithms yielded effective methods for building compact test suites that guarantee excellent fault detection capability based on combinatorial coverage. However, several publications point to desired or even essential features that need to be incorporated into the basic combinatorial testing model to make it more useful in practical software testing. Our research focuses on incorporating these requirements into the models enabling rigorous studies and providing efficient algorithms for the construction of effective test suites for a variety of applications. The proposed research will produce substantial advances on the theory and algorithms for the construction of efficient combinatorial test suites that are flexible enough to be used on an increasing variety of testing situations. This research is based on combinatorial theory and design and analysis of algorithms for the construction of generalized covering arrays, which forms the basis for combinatorial testing. We also propose to make these methods more accessible by developing tools and collaborating on applications in software and network testing. In the long term, this approach is likely to benefit many areas such as software testing, network security, network vulnerability testing, configuration testing and interaction testing.
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-2011
Name nom
Moura, Lucia
Department département
Electrical Engineering and Computer Science , 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
2012
Competition year année de concours
2011
Award amount
24000
Program id
RGPIN
Program name 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
1507
Committee name en
Computer Science
Committee name fr
Sciences informatiques
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
2
Nb partie
5
Application title
Combinatorial and algorithmic aspects of covering arrays for software and network testing
Keyword
NSERC
Application summary
Software implementation errors are responsible for most vulnerabilities in the security of information systems. Combinatorial testing methods can help minimize the cost and increase the effectiveness of software and network testing. A recent publication by the National Institute of Standards and Technology (NIST) of the US Department of Commerce on ""Practical Combinatorial Testing'' (October 2010) provides a thorough report on its effectiveness and its complementary relationship to other software testing methods. Research papers discussing combinatorial testing have been increasing rapidly from a few papers in 1995 to more than 70 in 2009 alone. In the past decade, a number of advances in combinatorial theory and combinatorial testing algorithms yielded effective methods for building compact test suites that guarantee excellent fault detection capability based on combinatorial coverage. However, several publications point to desired or even essential features that need to be incorporated into the basic combinatorial testing model to make it more useful in practical software testing. Our research focuses on incorporating these requirements into the models enabling rigorous studies and providing efficient algorithms for the construction of effective test suites for a variety of applications. The proposed research will produce substantial advances on the theory and algorithms for the construction of efficient combinatorial test suites that are flexible enough to be used on an increasing variety of testing situations. This research is based on combinatorial theory and design and analysis of algorithms for the construction of generalized covering arrays, which forms the basis for combinatorial testing. We also propose to make these methods more accessible by developing tools and collaborating on applications in software and network testing. In the long term, this approach is likely to benefit many areas such as software testing, network security, network vulnerability testing, configuration testing and interaction testing.