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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science s. 713 - 724
Hlavní autoři: Kobayashi, Naoki, Xin Li
Médium: Konferenční příspěvek
Jazyk:angličtina
japonština
Vydáno: IEEE 01.07.2015
Témata:
abstraction refinement
Automata
Context
Grammar
higher-order model checking
Model checking
Object oriented modeling
Syntactics
Transforms
tree automata
ISSN:1043-6871
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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. Kobayashi and Igarashi studied an extension of higher-order model checking called muHORS model checking, where HORS has been extended with recursive types, so that a wider range of programs, including object-oriented programs and multi-threaded programs, can be precisely modeled and verified. Although the muHORS model checking is undecidable in general, they developed a sound but incomplete procedure for muHORS model checking. Unfortunately, however, their procedure was not scalable enough. Inspired by recent progress of (ordinary) HORS model checking, we propose a new procedure for muHORS model checking, based on automata-based abstraction refinement. We have implemented the new procedure and confirmed that it often outperforms the previous procedure.
ISSN:1043-6871
DOI:10.1109/LICS.2015.71