Thesis icon

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


Access Document


Files:

Authors


Contributors

Role:
Supervisor
Role:
Supervisor
More from this funder
Funding agency for:
Marcelo Sousa
Type of award:
DPhil
Level of award:
Doctoral
Awarding institution:
University of Oxford
Language:
English
Subjects:

Terms of use


Metrics


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