Grant: Discovery Grants Program - Individual
University of Ottawa
$35,000.00
Machine-assisted theorem proving: Proof techniques and applications
FY 2011-12
Summary
The principle objective of the proposed research is to advance techniques in formal proof of properties of programs, programming languages, and policies. For individual programs, proving that they meet certain properties contributes to a very high level of assurance that they will behave as expected. For properties of programming languages, it is well-known that those that are formally proven to be sound can better provide a solid basis for building software systems that are reliable and secure. Examples where policies play an increasingly important role include assuring that software that processes health or other personal data respects privacy requirements, and assuring that software that is used in the administration of businesses respects government financial and security regulations.
The techniques I will focus on to meet this objective include the use of higher-order abstract syntax as a representation technique for languages and programs, and the automation of proof search. These techniques will be developed in the context of targeted applications. In particular, I will focus on applications where it is most likely to be possible to scale such techniques and apply them in practice to industrial software systems, and on applications where it is most crucial that policy constraints are met with a high degree of assurance.
To meet my objectives, the work will be broken down into four projects, each with subprojects that will vary from shorter term to more speculative longer term research: (1) reasoning using higher-order abstract syntax, (2) foundational proof-carrying code, (3) a theorem proving approach to privacy-sensitive information flow, and (4) analysis and verification of policies.
Program
Discovery Grants Program - Individual
Recipient
Location
Ontario, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data
As published
Application id
227798-2009
Name nom
Felty, Amy
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
2011
Competition year année de concours
2009
Award amount
35000
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
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
2712
Research subject group en
Information technology
Research subject group fr
Technologie de l'information
Research subject en
Theory of computation
Research subject fr
Théorie de calcul
Partie
3
Nb partie
5
Application title
Machine-assisted theorem proving: Proof techniques and applications
Keyword
NSERC
Application summary
The principle objective of the proposed research is to advance techniques in formal proof of properties of programs, programming languages, and policies. For individual programs, proving that they meet certain properties contributes to a very high level of assurance that they will behave as expected. For properties of programming languages, it is well-known that those that are formally proven to be sound can better provide a solid basis for building software systems that are reliable and secure. Examples where policies play an increasingly important role include assuring that software that processes health or other personal data respects privacy requirements, and assuring that software that is used in the administration of businesses respects government financial and security regulations.
The techniques I will focus on to meet this objective include the use of higher-order abstract syntax as a representation technique for languages and programs, and the automation of proof search. These techniques will be developed in the context of targeted applications. In particular, I will focus on applications where it is most likely to be possible to scale such techniques and apply them in practice to industrial software systems, and on applications where it is most crucial that policy constraints are met with a high degree of assurance.
To meet my objectives, the work will be broken down into four projects, each with subprojects that will vary from shorter term to more speculative longer term research: (1) reasoning using higher-order abstract syntax, (2) foundational proof-carrying code, (3) a theorem proving approach to privacy-sensitive information flow, and (4) analysis and verification of policies.