Thesis icon

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


Access Document


Files:

Authors


More by this author
Division:
MPLS
Department:
Mathematical Institute
Oxford college:
Exeter College
Role:
Author

Contributors

Institution:
University of Oxford
Division:
MPLS
Department:
Mathematical Institute
Sub department:
Mathematical Institute
Role:
Supervisor
Institution:
University of Oxford
Division:
MPLS
Department:
Computer Science
Sub department:
Computer Science
Role:
Supervisor
Institution:
University of Oxford
Division:
MPLS
Department:
Mathematical Institute
Role:
Examiner
Institution:
Weierstrass Institute for Applied Analysis and Stochastics
Role:
Examiner
More from this funder
Name:
The Alan Turing Institute
Funding agency for:
Cosentino, F
Grant:
TU/C/000021
Programme:
The Alan Turing Institute, Doctoral Research Programme
Type of award:
DPhil
Level of award:
Doctoral
Awarding institution:
University of Oxford
Language:
English
Keywords:
Subjects:
Deposit date:
2021-11-27

Terms of use


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP