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

Saved in:
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!
Abstract 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.
AbstractList 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.
Author Xin Li
Kobayashi, Naoki
Author_xml – sequence: 1
  givenname: Naoki
  surname: Kobayashi
  fullname: Kobayashi, Naoki
  email: koba@is.s.u-tokyo.ac.jp
– sequence: 2
  surname: Xin Li
  fullname: Xin Li
  email: li-xin@kb.is.s.u-tokyo.ac.jp
BookMark eNotzLFOwzAQgGEjFYm2dGNjyQsk3MV2bE-oREArBVVqYa7O7hkCTYKSMPBgvABPhhBMv_QN_0xM2q5lIS4QMkRwV9W63GU5oM4MnoiFMxaVcc5ao9VETBGUTAtr8EzMhuEVAPJCwVRcLz_GrqGR0hsa-JAs_TD2FMa6a5Mtx7rlhtsxiV2ffH-tNttd8tAd-JiULxze6vb5XJxGOg68-O9cPN3dPpartNrcr8tllRLqvEjJQB6QjPaSHDuAEOFX2Hs2iqw3RFZFwBi1DJx7KyN5iw4KHUAqOReXf9-amffvfd1Q_7k3aJTLtfwBTmdJ8Q
CODEN IEEPAD
ContentType Conference Proceeding
DBID 6IE
6IH
CBEJK
RIE
RIO
DOI 10.1109/LICS.2015.71
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan (POP) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP) 1998-present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISBN 9781479988754
1479988758
EndPage 724
ExternalDocumentID 7174925
Genre orig-research
GroupedDBID --Z
23M
29P
6IE
6IF
6IH
6IK
6IL
6IM
6IN
AAJGR
AAWTH
ADZIZ
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
CHZPO
IEGSK
IJVOP
IPLJI
M43
OCL
RIE
RIL
RIO
RNS
ID FETCH-LOGICAL-a1526-a702c1a75b3a9e900cf002c1ebbe74a8b7aa84f01ff53ce2b83fab819065c0343
IEDL.DBID RIE
ISSN 1043-6871
IngestDate Wed Aug 27 02:33:32 EDT 2025
IsPeerReviewed false
IsScholarly true
Language English
Japanese
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-a1526-a702c1a75b3a9e900cf002c1ebbe74a8b7aa84f01ff53ce2b83fab819065c0343
PageCount 12
ParticipantIDs ieee_primary_7174925
PublicationCentury 2000
PublicationDate 2015-07
PublicationDateYYYYMMDD 2015-07-01
PublicationDate_xml – month: 07
  year: 2015
  text: 2015-07
PublicationDecade 2010
PublicationTitle 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science
PublicationTitleAbbrev LICS
PublicationYear 2015
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0002640
ssj0002179874
Score 1.9148363
Snippet 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...
SourceID ieee
SourceType Publisher
StartPage 713
SubjectTerms abstraction refinement
Automata
Context
Grammar
higher-order model checking
Model checking
Object oriented modeling
Syntactics
Transforms
tree automata
Title Automata-Based Abstraction Refinement for µHORS Model Checking
URI https://ieeexplore.ieee.org/document/7174925
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1NTwIxEJ0A8eAJFYzf6cGjhV3abbcng0SCiUECmnAjbXcaTQwQBP-Zf8BfZrusy8WLt6aHZjOT9r2ZnTcDcM1dlkZa-YvEUqTcCkGN4khjZlHKONYic_mwCTkcptOpGlXgptTCIGJefIatsMz_5WcLuwmpsrYPPUIvvSpUpRRbrVaZT-mEzluByhSvsAf6ohMBo8JHBWXRu2o_PvQmoagraeXC-d1QlRxT-vX_fc0BNHfiPDIqYecQKjg_gvrvdAZSXNYG3HY364Xno5reeaTKSNeErEYuYyBjdJ5dhvOJJ63k-2vwNJ6QMBftnfRe0Yb8eRNe-vfPvQEtxiVQ7UFYUC2jjo21TAzTClUUWReFHTQGJdepkVqn3EWxc4n3RMekzGkTGIFIbMQ4O4bafDHHEyA880-gE6kxieRG-5AsYypDH_xw672bnEIj2GO23HbEmBWmOPt7-xz2g7W3Ra4XUFuvNngJe_Zz_faxusrd-AMOhZu5
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1NTwIxEJ0gmugJFYzf9uDRwu62u909GSQSiIgEMOFG2u40mhgwCP4z_4C_zHZZl4sXb00PzWYm7XszO28G4JqbNPZkYi8Si5FyHUVUJRypzzQK4fsySk02bEL0-_FkkgxKcFNoYRAxKz7Dultm__LTuV65VFnDhh6ul94WbIecB95arVVkVALXe8uRmfwdtlCf9yJgNLJxQVH2njR63dbIlXWF9Uw6vxmrkqFKu_K_79mH2kaeRwYF8BxACWeHUPmdz0Dy61qF2-ZqObeMVNI7i1UpaSqX18iEDGSIxvJLdz6xtJV8f3WehiPiJqO9kdYLapdBr8Fz-37c6tB8YAKVFoYjKoUXaF-KUDGZYOJ52nhuB5VCwWWshJQxN55vTGh9EaiYGakcJ4hC7THOjqA8m8_wGAhP7SNoolipUHAlbVCWsiRFG_5wbf0bnkDV2WP6vu6JMc1Ncfr39hXsdsaPvWmv2384gz1n-XXJ6zmUl4sVXsCO_ly-fiwuM5f-AFs-nwA
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=2015+30th+Annual+ACM%2FIEEE+Symposium+on+Logic+in+Computer+Science&rft.atitle=Automata-Based+Abstraction+Refinement+for+%C2%B5HORS+Model+Checking&rft.au=Kobayashi%2C+Naoki&rft.au=Xin+Li&rft.date=2015-07-01&rft.pub=IEEE&rft.issn=1043-6871&rft.spage=713&rft.epage=724&rft_id=info:doi/10.1109%2FLICS.2015.71&rft.externalDocID=7174925
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1043-6871&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1043-6871&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1043-6871&client=summon