Thesis
Formal verification meets stochastic analysis
- Abstract:
-
The thesis goal is to explore the relations between Formal Verification techniques in Computer Science and Stochastic Analysis in Mathematics. They both deal with probabilistic dynamical systems, implying that the number of connections is significant. The Formal Verification studies dynamical systems' properties, which are specified in terms of logic statements. This discipline has been successfully applied to multiple industry problems, such as ``verification of'' Software, Microprocessor...
Expand abstract
Actions
Authors
Contributors
+ Oberhauser, H
Institution:
University of Oxford
Division:
MPLS
Department:
Mathematical Institute
Sub department:
Mathematical Institute
Role:
Supervisor
+ Abate, A
Institution:
University of Oxford
Division:
MPLS
Department:
Computer Science
Sub department:
Computer Science
Role:
Supervisor
+ Lyons, T
Institution:
University of Oxford
Division:
MPLS
Department:
Mathematical Institute
Role:
Examiner
+ Bayer, C
Institution:
Weierstrass Institute for Applied Analysis and Stochastics
Role:
Examiner
Funding
+ The Alan Turing Institute
More from this funder
Funding agency for:
Cosentino, F
Grant:
TU/C/000021
Bibliographic Details
- Type of award:
- DPhil
- Level of award:
- Doctoral
- Awarding institution:
- University of Oxford
Item Description
- Language:
- English
- Keywords:
- Subjects:
- Deposit date:
- 2021-11-27
Related Items
Terms of use
- Copyright holder:
- Cosentino, F
- Copyright date:
- 2021
Metrics
If you are the owner of this record, you can report an update to it here: Report update to this record