Thesis icon

Thesis

Higher-order model checking with traversals

Abstract:

Higher-order recursion schemes are a powerful model of functional computation that grew out of traditional recursive program schemes and generalisations of grammars. It is common to view recursion schemes as generators of possibly-infinite trees, which Ong showed to have a decidable monadic second order theory and opened the door to applications in verification. Kobayashi later presented an intersection type characterisation of the model checking problem, on which most subsequent applied w...

Expand abstract

Actions


Access Document


Files:

Authors


More by this author
Institution:
University of Oxford
Division:
MPLS
Department:
Computer Science
Oxford college:
Merton College
Role:
Author

Contributors

Division:
MPLS
Department:
Computer Science
Role:
Supervisor
More from this funder
Funding agency for:
Neatherway, R
Grant:
EP/F036361/1
Publication date:
2014
Type of award:
DPhil
Level of award:
Doctoral
Awarding institution:
Oxford University, UK
Language:
English
Keywords:
Subjects:
UUID:
uuid:240bd517-1582-45f9-86c3-eb30f85757de
Local pid:
ora:10234
Deposit date:
2015-02-27

Terms of use


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