Thesis icon

Thesis

On the complexity of model checking counter automata

Abstract:

Theoretical and practical aspects of the verification of infinite-state systems have attracted a lot of interest in the verification community throughout the last 30 years. One goal is to identify classes of infinite-state systems that admit decidable decision problems on the one hand, and which are sufficiently general to model systems, programs or protocols with unbounded data or recursion depth on the other hand.

The first part of this thesis is concerned with the computational c...

Expand abstract

Actions


Access Document


Files:

Authors


More by this author
Institution:
University of Oxford
Oxford college:
St Catherine's College
Department:
Mathematical,Physical & Life Sciences Division - Computer Science,Department of

Contributors

Role:
Supervisor
Publication date:
2012
Type of award:
DPhil
Level of award:
Doctoral

Terms of use


Metrics



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

TO TOP