Conference item icon

Conference item

A type system equivalent to the modal Mu-calculus model checking of higher-order recursion schemes

Abstract:

The model checking of higher-order recursion schemes has important applications in the verification of higher-order programs. Ong has previously shown that the modal mu-calculus model checking of trees generated by ordern recursion scheme is n-EXPTIME complete, but his algorithm and its correctness proof were rather complex. We give an alternative, type-based verification method: Given a modal mucalculus formula, we can construct a type system in which a recursion scheme is typable if, and on...

Expand abstract

Actions


Access Document


Publisher copy:
10.1109/LICS.2009.29
Host title:
Proceedings - Symposium on Logic in Computer Science
Pages:
179-188
Publication date:
2009-01-01
DOI:
ISSN:
1043-6871
ISBN:
9780769537467
Pubs id:
pubs:328297
UUID:
uuid:8b69d5fc-0a68-4392-af47-8cedf6585a96
Local pid:
pubs:328297
Source identifiers:
328297
Deposit date:
2012-12-19

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