Grant: Discovery Grants Program - Individual
University of Waterloo
$25,000.00
Next-generation Constraint Solvers for Software Engineering and Security
FY 2015-16
Summary
Constraint solvers, programs that automatically solve mathematical constraints, are used in myriad applications in engineering and science. Solvers can be likened to swiss-army knives, used in applications such as planning a robot's movement, configuring a car or automatically finding bugs in software. Engineers model their problem using mathematical constraints, and then use solvers to automatically solve them. As little as a decade ago, scalable automatic bug-finding of commercial software like word processors and operating systems was considered practically infeasible. Thanks to impressive gains in solver performance (due to many researchers including myself), not only has automatic bug-finding become feasible but is mandatory in companies like Microsoft. While the gains to-date are important, the demand for ever-more powerful and expressive solvers continues to grow unabated as engineers tackle even harder applications such as software synthesis. Hence, I propose a long-term research program to develop new solver techniques that are orders of magnitude faster and more expressive than today's, aimed at software engineering tools for software reliability and security.
More precisely, my research program has the following three thrusts: i) I will explore new techniques based on machine learning (ML). There has been a veritable revolution in ML theory and techniques. We can use ML and stochastic inference techniques to learn subtle meta-level patterns in large constraints that enable faster solving (similar to how humans identify deep concepts from data), ii) techniques that leverage ubiquitous and cheap multi-core processors to build scalable parallel solvers, and iii) solver techniques that leverage domain-specific knowledge as keys to unlock solutions to constraints. The proposed research will have deep fundamental scientific, technical, and commercial impact. The foundational results will provide theoretical underpinning for solver heuristics through ideas from parametric complexity and ML. The technical and commercial impact will be a set of new scalable and extensible solvers which have the potential to transform software reliability and security.
Program
Discovery Grants Program - Individual
Recipient
Location
Ontario, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data
As published
Application id
435967-2013
Name nom
Ganesh, Vijay
Department département
Electrical & Computer Engineering
Organization id
33
Institution établissement
University of Waterloo
Province en
Ontario
Province fr
Ontario
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2015
Competition year année de concours
2013
Award amount
25000
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
2706
Research subject group en
Information technology
Research subject group fr
Technologie de l'information
Research subject en
Software engineering
Research subject fr
Génie logiciel
Partie
3
Nb partie
5
Application title
Next-generation Constraint Solvers for Software Engineering and Security
Keyword
NSERC
Application summary
Constraint solvers, programs that automatically solve mathematical constraints, are used in myriad applications in engineering and science. Solvers can be likened to swiss-army knives, used in applications such as planning a robot's movement, configuring a car or automatically finding bugs in software. Engineers model their problem using mathematical constraints, and then use solvers to automatically solve them. As little as a decade ago, scalable automatic bug-finding of commercial software like word processors and operating systems was considered practically infeasible. Thanks to impressive gains in solver performance (due to many researchers including myself), not only has automatic bug-finding become feasible but is mandatory in companies like Microsoft. While the gains to-date are important, the demand for ever-more powerful and expressive solvers continues to grow unabated as engineers tackle even harder applications such as software synthesis. Hence, I propose a long-term research program to develop new solver techniques that are orders of magnitude faster and more expressive than today's, aimed at software engineering tools for software reliability and security.
More precisely, my research program has the following three thrusts: i) I will explore new techniques based on machine learning (ML). There has been a veritable revolution in ML theory and techniques. We can use ML and stochastic inference techniques to learn subtle meta-level patterns in large constraints that enable faster solving (similar to how humans identify deep concepts from data), ii) techniques that leverage ubiquitous and cheap multi-core processors to build scalable parallel solvers, and iii) solver techniques that leverage domain-specific knowledge as keys to unlock solutions to constraints. The proposed research will have deep fundamental scientific, technical, and commercial impact. The foundational results will provide theoretical underpinning for solver heuristics through ideas from parametric complexity and ML. The technical and commercial impact will be a set of new scalable and extensible solvers which have the potential to transform software reliability and security.