Thesis icon

Thesis

Repairing strings and trees

Abstract:

What do you do if a computational object fails a specification? An obvious approach is to repair it, namely, to modify the object minimally to get something that satisfies the constraints. In this thesis we study foundational problems of repairing regular specifications over strings and trees. Given two regular specifications R and T we aim to understand how difficult it is to transform an object satisfying R into an object satisfying T. The setting is motivated by considering R to be a

Expand abstract

Actions


Access Document


Files:

Authors


More by this author
Institution:
University of Oxford
Research group:
Information Systems
Oxford college:
Wolfson College
Department:
Mathematical,Physical & Life Sciences Division - Computer Science,Department of

Contributors

Role:
Supervisor
Publication date:
2013
Type of award:
DPhil
Level of award:
Doctoral
Awarding institution:
Oxford University, UK
URN:
uuid:012d384f-d1d0-471b-ae6e-bbf337892680
Local pid:
ora:7057

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