Thesis
Abstractions and independence
- Abstract:
-
Efficient state space exploration of a concurrent program is a fundamental problem in algorithmic verification because of the known state explosion problem. In the past decades, dynamic partial order reductions and Petri net unfoldings have been two promising approaches to address the state explosion problem. However, these techniques typically focus on the combinatorial explosion caused by the potential linearizations of partial orders and do not generally address multiple ...
Expand abstract
Actions
Funding
Bibliographic Details
- Type of award:
- DPhil
- Level of award:
- Doctoral
- Awarding institution:
- University of Oxford
Item Description
- Language:
- English
- Subjects:
- UUID:
-
uuid:9f8ece2c-4ed2-4bd2-b31c-f503e057545f
- Deposit date:
- 2019-05-21
Terms of use
- Copyright holder:
- Sousa, M
- Copyright date:
- 2018
If you are the owner of this record, you can report an update to it here: Report update to this record