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

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science S. 713 - 724
Hauptverfasser: Kobayashi, Naoki, Xin Li
Format: Tagungsbericht
Sprache:Englisch
Japanisch
Veröffentlicht: IEEE 01.07.2015
Schlagworte:
abstraction refinement
Automata
Context
Grammar
higher-order model checking
Model checking
Object oriented modeling
Syntactics
Transforms
tree automata
ISSN:1043-6871
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
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/eLvHCXMwlV1NTwIxEJ0g8eAJFYzf6cGjhe62u-2eDBIJJgQJqOFG2jKNJgYMgv_MP-Avs13W5eLF26aHze5s2vdmdt4bgCsVC20TTKmQsaUi0tyfg8JRk8y4Y5lJstxn-7kvBwM1mWTDClyXWhhEzJvPsBku83_5s4Vdh1JZy6cewUtvB3akTDdarbKeEgfnrUBlilPYA33hRMBp6rOCsuk9a_XvO-PQ1JU0c-H8dqhKjind2v-eZh8aW3EeGZawcwAVnB9C7Xc6Ayk2ax1u2uvVwvNRTW89Us1I24SqRi5jICN0nl2G-xNPWsn3V-9hNCZhLtob6bygDfXzBjx17x47PVqMS6Dag3BKtWSxjbRMDNcZZoxZx8IKGoNSaGWk1ko4FjmXcIuxUdxpExhBmljGBT-C6nwxx2MgPDU-aY4N-vcTkdKKedbiY64iplMxcydQD_GYvm8cMaZFKE7_Xj6DvRDtTZPrOVRXyzVewK79XL1-LC_zz_gDxA6aWA
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3PT8IwFH5BNNETKhp_24NHC2Vt1-1kkEggTiSAhhtpuzaaGDAI_mf-A_5ltmOOixdvSw_L9pb2-97b-74HcBUFTGpuQsxEoDFrSOrOQWax4im1JFY8zny2nxPR60XjcdwvwXWhhTHGZM1npuYvs3_56Uwvfams7lIP76W3AZucsYCs1FpFRSXw3luezOTnsIP63IuA4tDlBUXbe1xPuq2hb-vitUw6vx6rkqFKu_K_59mFg7U8D_UL4NmDkpnuQ-V3PgPKt2sVbprLxcwxUolvHValqKl8XSMTMqCBsY5f-vsjR1vR91fncTBEfjLaG2q9GO0r6Afw1L4btTo4H5iApYPhEEtBAt2QgisqYxMToi3xK0YpI5iMlJAyYpY0rOVUm0BF1ErlOUHINaGMHkJ5OpuaI0A0VC5tDpRx78cakYyI4y1CePcyGbLUHkPVx2PyvvLEmOShOPl7-RK2O6OHZJJ0e_ensOMjv2p5PYPyYr4057ClPxevH_OL7JP-AP9XnZ8
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