Canada Spends Logo

Explore our Budget 2026 analysis

Grant: Discovery Grants Program - Individual

York University

$27,000.00

Concurrency: semantics and verification

FY 2011-12

Summary
Probabilistic transition systems can be exploited to model randomized algorithms, systems that interact with physical devices, etc. I plan to study probabilistic transition systems and variations thereof. In particular, I plan to develop quantitative models of these systems. Such quantitative models are more robust than qualitative models, since minor variations in the probabilities have little effect on the former type of model whereas they may have drastic effects on the latter type. Also, I aim to develop verification algorithms for these systems based on the developed models. Java is the most used programming language these days. Numerous verification tools have been developed for Java. Java PathFinder, JPF for short, is such a tool. JPF can check numerous properties of Java programs, like uncaught exceptions, integer overflow and deadlocks. JPF has been designed in such a way that it can easily be extended. I plan to improve and extend JPF. The business process execution language for web services, BPEL for short, is the de-facto standard to program web service compositions. Various verification tools have been developed for BPEL. With my students, I also developed some. All existing tools work with models of the business process, rather than the BPEL code itself. My plan is to develop a verification tool, along the lines of JPF, that works directly with the BPEL code and, hence, will detect different errors than all existing tools.
Program
Discovery Grants Program - Individual
Location
Ontario, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data

As published

Application id
218030-2008
Name nom
VanBreugel, Franck
Department département
Computer Science and Engineering
Organization id
38
Institution établissement
York University
Province en
Ontario
Province fr
Ontario
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2011
Competition year année de concours
2008
Award amount
27000
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
2704
Research subject group en
Information technology
Research subject group fr
Technologie de l'information
Research subject en
Distributed and parallel processing
Research subject fr
Traitement réparti et simultané
Partie
4
Nb partie
5
Application title
Concurrency: semantics and verification
Keyword
NSERC
Application summary
Probabilistic transition systems can be exploited to model randomized algorithms, systems that interact with physical devices, etc. I plan to study probabilistic transition systems and variations thereof. In particular, I plan to develop quantitative models of these systems. Such quantitative models are more robust than qualitative models, since minor variations in the probabilities have little effect on the former type of model whereas they may have drastic effects on the latter type. Also, I aim to develop verification algorithms for these systems based on the developed models. Java is the most used programming language these days. Numerous verification tools have been developed for Java. Java PathFinder, JPF for short, is such a tool. JPF can check numerous properties of Java programs, like uncaught exceptions, integer overflow and deadlocks. JPF has been designed in such a way that it can easily be extended. I plan to improve and extend JPF. The business process execution language for web services, BPEL for short, is the de-facto standard to program web service compositions. Various verification tools have been developed for BPEL. With my students, I also developed some. All existing tools work with models of the business process, rather than the BPEL code itself. My plan is to develop a verification tool, along the lines of JPF, that works directly with the BPEL code and, hence, will detect different errors than all existing tools.
York University - $27,000 Grant (2011-12) | Canada Spends