Automata-Based Abstraction Refinement for µHORS Model Checking

The model checking of higher-order recursion schemes (HORS), aka. Higher-order model checking, is the problem of checking whether the tree generated by a given HORS satisfies a given property. It has recently been studied actively and applied to automated verification of higher-order programs. Kobay...

Full description

Bibliographic Details

Published in:	2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science pp. 713 - 724
Main Authors:	Kobayashi, Naoki, Xin Li
Format:	Conference Proceeding
Language:	English Japanese
Published:	IEEE 01.07.2015
Subjects:	abstraction refinement Automata Context Grammar higher-order model checking Model checking Object oriented modeling Syntactics Transforms tree automata
ISSN:	1043-6871
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!