Grant: Discovery Grants Program - Individual
University of Ottawa
$20,000.00
Combinatorial arrays, algorithms and applications
FY 2018-19
Summary
The security of information systems depends on the identification of software vulnerabilities and on the design of secure protocols for maintaining secrecy and integrity of information. Combinatorial testing methods can help minimize the cost and increase the effectiveness of software and network testing. In the past decades, a number of research studies have pointed to combinatorial testing as one of the most effective methods for black-box software testing. Advances in combinatorial testing have yielded effective methods for building compact test suites that guarantee excellent fault detection capability based on combinatorial coverage. However, several publications point to some essential features that need to be incorporated to 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. Another aspect of our research is to contribute to methods in the areas of combinatorial cryptography to provide effective techniques for maintaining secrecy and integrity of data. *The proposed research focuses on combinatorial arrays and combinatorial methods to produce advances on combinatorial testing and combinatorial cryptography. This research is based on combinatorial theory and design and analysis of algorithms for the construction of generalized covering arrays and generalized orthogonal arrays, which form the basis for specific application problems in these areas. There are common features about testing for failures in software and guaranteeing security of data, which will be explored by developing and applying methods of combinatorial group testing, combinatorial designs and combinatorial algorithms. We also propose to develop software that implements combinatorial constructions to make them more accessible to applications. In the long term, this approach is likely to benefit many areas such as software testing, network security, network vulnerability testing, interaction testing, data integrity and computing security.
Program
Discovery Grants Program - Individual
Recipient
Location
Ontario, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data
As published
Application id
RGPIN-2017-05212
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
2018
Competition year année de concours
2017
Award amount
20000
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 arrays, algorithms and applications
Keyword
NSERC
Application summary
The security of information systems depends on the identification of software vulnerabilities and on the design of secure protocols for maintaining secrecy and integrity of information. Combinatorial testing methods can help minimize the cost and increase the effectiveness of software and network testing. In the past decades, a number of research studies have pointed to combinatorial testing as one of the most effective methods for black-box software testing. Advances in combinatorial testing have yielded effective methods for building compact test suites that guarantee excellent fault detection capability based on combinatorial coverage. However, several publications point to some essential features that need to be incorporated to 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. Another aspect of our research is to contribute to methods in the areas of combinatorial cryptography to provide effective techniques for maintaining secrecy and integrity of data. *The proposed research focuses on combinatorial arrays and combinatorial methods to produce advances on combinatorial testing and combinatorial cryptography. This research is based on combinatorial theory and design and analysis of algorithms for the construction of generalized covering arrays and generalized orthogonal arrays, which form the basis for specific application problems in these areas. There are common features about testing for failures in software and guaranteeing security of data, which will be explored by developing and applying methods of combinatorial group testing, combinatorial designs and combinatorial algorithms. We also propose to develop software that implements combinatorial constructions to make them more accessible to applications. In the long term, this approach is likely to benefit many areas such as software testing, network security, network vulnerability testing, interaction testing, data integrity and computing security.