Grant: Discovery Grants Program - Individual
McMaster University
$23,900.00
Languages and tools for the construction of verifiable programs
FY 2006-07
Summary
As we become more dependent on software, the reliability of software is of increasing concern to society. In the US alone, the Department of Commerce in 2002 estimated that the cost to the economy of avoidable software errors is between 20 and 60 billion dollars every year. Over half the cost is incurred by the users. The long-term goal is to contribute to the ideal of "correct software". The focus is on making the design phase of software development more reliable. The thesis of this project is that further groundbreaking progress can only be achieved by an integration of several techniques for improving reliability. The techniques that we consider are object-oriented programming, specification techniques, concurrency, exception handling, theorem proving, and documentation techniques. The approach is to integrate an automatic theorem prover (a decision procedure for first-order logic) in the compiler and allow programs to contain specifications. This allows the compiler to check if an implementation meets its specification. It also allows the compiler to detect where errors (specification violations) can occur and make the programmer write exception handlers in those cases. Action-based concurrency is easier to express and verify than thread-based concurrency. On the other hand, action-based concurrency is difficult to implement efficiently. The integrated decision procedure allows for optimizations, like avoiding evaluations of action guards. Thus, the approach gives programmers multiple benefits for writing specifications: checking the correctness, better exception handling, and more efficient code.
Program
Discovery Grants Program - Individual
Recipient
Location
Ontario, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data
As published
Application id
203416-2006
Name nom
Sekerinski, Emil
Department département
Computing and Software
Organization id
27
Institution établissement
McMaster University
Province en
Ontario
Province fr
Ontario
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2006
Competition year année de concours
2006
Award amount
23900
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
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
2705
Research subject group en
Information technology
Research subject group fr
Technologie de l'information
Research subject en
Software and development
Research subject fr
Logiciels et développement
Partie
1
Nb partie
5
Application title
Languages and tools for the construction of verifiable programs
Keyword
NA
Application summary
As we become more dependent on software, the reliability of software is of increasing concern to society. In the US alone, the Department of Commerce in 2002 estimated that the cost to the economy of avoidable software errors is between 20 and 60 billion dollars every year. Over half the cost is incurred by the users. The long-term goal is to contribute to the ideal of "correct software". The focus is on making the design phase of software development more reliable. The thesis of this project is that further groundbreaking progress can only be achieved by an integration of several techniques for improving reliability. The techniques that we consider are object-oriented programming, specification techniques, concurrency, exception handling, theorem proving, and documentation techniques. The approach is to integrate an automatic theorem prover (a decision procedure for first-order logic) in the compiler and allow programs to contain specifications. This allows the compiler to check if an implementation meets its specification. It also allows the compiler to detect where errors (specification violations) can occur and make the programmer write exception handlers in those cases. Action-based concurrency is easier to express and verify than thread-based concurrency. On the other hand, action-based concurrency is difficult to implement efficiently. The integrated decision procedure allows for optimizations, like avoiding evaluations of action guards. Thus, the approach gives programmers multiple benefits for writing specifications: checking the correctness, better exception handling, and more efficient code.