Canada Spends Logo

Explorez notre analyse du budget 2026

Grant: Discovery Grants Program - Individual

Université du Québec à Montréal

$19,000.00

Logics, structures and verification

EF 2011-12

Résumé
This research program addresses applications of logic to computer science. Logic is the formal study of properties; how they can be stated and verified. In computer science, logic allows to formally state properties of computer systems and gives algorithmic methods to efficiently find errors in systems' design. This research program will consider both new verification tasks and new ways of reducing verification time. In networks such as the Internet, equipments such as routers, switches, firewall etc. must be properly configured in order to exchange information in a secure and efficient way. Maintaining a properly configured network is an expensive and complex task, which takes a great part of network engineers' time. This research program extends logical verification methods to network equipments' configuration. Automating as many configuration tasks as possible, this will allow simplifying and speeding up network configuration tasks. Propositional logic has been introduced in the 19th century as a calculus for thoughts and has lead to fruitful applications such as in electronic circuits design. Recently fast algorithms for solving propositional formulas have been effectively applied to find errors in computational systems such as network protocols and processors. While being effective, these methods are limited in many cases by the formula's size. This research program considers methods for breaking down these formulas in smaller parts, in order to solve them more rapidly. This will allow error detection in bigger and more realistic computer systems.
Programme
Discovery Grants Program - Individual
Emplacement
Quebec, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data

Tel que publié

Application id
155576-2009
Name nom
Villemaire, Roger
Department département
Informatique
Organization id
57
Institution établissement
Université du Québec à Montréal
Province en
Québec
Province fr
Québec
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2011
Competition year année de concours
2009
Award amount
19000
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
330
Committee name en
Computing and Information Sciences - A
Committee name fr
Informatique - A
Area of application code
803
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 communications
Area of application fr
Téléinformatique
Research subject code
2709
Research subject group en
Information technology
Research subject group fr
Technologie de l'information
Research subject en
Other computing methods
Research subject fr
Autres méthodes informatiques
Partie
3
Nb partie
5
Application title
Logics, structures and verification
Keyword
NSERC
Application summary
This research program addresses applications of logic to computer science. Logic is the formal study of properties; how they can be stated and verified. In computer science, logic allows to formally state properties of computer systems and gives algorithmic methods to efficiently find errors in systems' design. This research program will consider both new verification tasks and new ways of reducing verification time. In networks such as the Internet, equipments such as routers, switches, firewall etc. must be properly configured in order to exchange information in a secure and efficient way. Maintaining a properly configured network is an expensive and complex task, which takes a great part of network engineers' time. This research program extends logical verification methods to network equipments' configuration. Automating as many configuration tasks as possible, this will allow simplifying and speeding up network configuration tasks. Propositional logic has been introduced in the 19th century as a calculus for thoughts and has lead to fruitful applications such as in electronic circuits design. Recently fast algorithms for solving propositional formulas have been effectively applied to find errors in computational systems such as network protocols and processors. While being effective, these methods are limited in many cases by the formula's size. This research program considers methods for breaking down these formulas in smaller parts, in order to solve them more rapidly. This will allow error detection in bigger and more realistic computer systems.