Thesis icon

Thesis

Verifying concurrent systems by approximation

Abstract:

Approximate verification frameworks are an approach to combat the well-known state-space explosion problem. For properties formulated as "no bad state can be reached", an approximate framework can be simply obtained by replacing exact reachability by some over-approximation. These frameworks look for a bad state in this over-approximation. If no bad states are found, the system satisfies the original property; the framework is sound. If a bad state is found, we have an inconclusive result...

Expand abstract

Actions


Access Document


Files:

Authors


More by this author
Department:
Department of Computer Science, University of Oxford
Role:
Author

Contributors

Department:
Department of Computer Science, University of Oxford
Role:
Supervisor
More from this funder
Grant:
Process no: 13201/13-1
Funding agency for:
Project
Type of award:
DPhil
Level of award:
Doctoral
Awarding institution:
University of Oxford

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