License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CSL.2013.129
URN: urn:nbn:de:0030-drops-41941
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2013/4194/
Go to the corresponding LIPIcs Volume Portal

Broadbent, Christopher ; Kobayashi, Naoki

Saturation-Based Model Checking of Higher-Order Recursion Schemes

pdf-format:
14.pdf (0.7 MB)

Abstract

Model checking of higher-order recursion schemes (HORS) has recently been studied extensively and applied to higher-order program verification. Despite recent efforts, obtaining a scalable model checker for HORS remains a big challenge. We propose a new model checking algorithm for HORS, which combines two previous, independent approaches to higher-order model checking. Like previous type-based algorithms for HORS, it directly analyzes HORS and outputs intersection types as a certificate, but like Broadbent et al.'s saturation algorithm for collapsible pushdown systems (CPDS), it propagates information backward, in the sense that it starts with target configurations and iteratively computes their pre-images. We have implemented the new algorithm and confirmed that the prototype often outperforms TRECS and CSHORe, the state-of-the-art model checkers for HORS.

BibTeX - Entry

@InProceedings{broadbent_et_al:LIPIcs:2013:4194,
  author =	{Christopher Broadbent and Naoki Kobayashi},
  title =	{{Saturation-Based Model Checking of Higher-Order Recursion Schemes}},
  booktitle =	{Computer Science Logic 2013 (CSL 2013)},
  pages =	{129--148},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-60-6},
  ISSN =	{1868-8969},
  year =	{2013},
  volume =	{23},
  editor =	{Simona Ronchi Della Rocca},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2013/4194},
  URN =		{urn:nbn:de:0030-drops-41941},
  doi =		{10.4230/LIPIcs.CSL.2013.129},
  annote =	{Keywords: Model checking, higher-order recursion schemes, intersection types}
}

Keywords: Model checking, higher-order recursion schemes, intersection types
Collection: Computer Science Logic 2013 (CSL 2013)
Issue Date: 2013
Date of publication: 02.09.2013

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI