{"@context":{"@vocab":"https://cir.nii.ac.jp/schema/1.0/","rdfs":"http://www.w3.org/2000/01/rdf-schema#","dc":"http://purl.org/dc/elements/1.1/","dcterms":"http://purl.org/dc/terms/","foaf":"http://xmlns.com/foaf/0.1/","prism":"http://prismstandard.org/namespaces/basic/2.0/","cinii":"http://ci.nii.ac.jp/ns/1.0/","datacite":"https://schema.datacite.org/meta/kernel-4/","ndl":"http://ndl.go.jp/dcndl/terms/","jpcoar":"https://github.com/JPCOAR/schema/blob/master/2.0/"},"@id":"https://cir.nii.ac.jp/crid/1360848655498787200.json","@type":"Article","productIdentifier":[{"identifier":{"@type":"DOI","@value":"10.1007/978-3-319-46520-3_20"}},{"identifier":{"@type":"URI","@value":"http://link.springer.com/content/pdf/10.1007/978-3-319-46520-3_20"}}],"resourceType":"学術雑誌論文(journal article)","dc:title":[{"@value":"Equivalence-Based Abstraction Refinement for $$\\mu $$ HORS Model Checking"}],"description":[{"notation":[{"@value":"Kobayashi and Igarashi proposed model checking of \\(\\mu \\)HORS (recursively-typed higher-order recursion schemes), by which a wide range of programs such as object-oriented programs and multi-threaded programs can be precisely modeled and verified. In this work, we present a procedure for \\(\\mu \\)HORS model checking that improves the procedure based on automata-based abstraction refinement proposed by Kobayashi and Li. The new procedure optimizes each step of the abstract-check-refine paradigm of the previous procedure. Specially, it combines the strengths of automata-based and type-based abstraction refinement as equivalence-based abstraction refinement. We have implemented the new procedure, and confirmed that it always outperformed the original automata-based procedure on runtime efficiency, and successfully verified all benchmarks which were previously impossible."}]}],"creator":[{"@id":"https://cir.nii.ac.jp/crid/1380848655498787201","@type":"Researcher","foaf:name":[{"@value":"Xin Li"}]},{"@id":"https://cir.nii.ac.jp/crid/1420282801203709312","@type":"Researcher","personIdentifier":[{"@type":"KAKEN_RESEARCHERS","@value":"00262155"},{"@type":"NRID","@value":"1000000262155"},{"@type":"NRID","@value":"9000258559604"},{"@type":"NRID","@value":"9000258237537"},{"@type":"NRID","@value":"9000413525779"},{"@type":"NRID","@value":"9000347535979"},{"@type":"NRID","@value":"9000347540440"},{"@type":"NRID","@value":"9000410022751"},{"@type":"NRID","@value":"9000408420511"},{"@type":"NRID","@value":"9000283468493"},{"@type":"NRID","@value":"9000409519535"},{"@type":"NRID","@value":"9000241842882"},{"@type":"NRID","@value":"9000020871446"},{"@type":"NRID","@value":"9000022143911"},{"@type":"RESEARCHMAP","@value":"https://researchmap.jp/naokikob"}],"foaf:name":[{"@value":"Naoki Kobayashi"}]}],"publication":{"publicationIdentifier":[{"@type":"PISSN","@value":"03029743"},{"@type":"EISSN","@value":"16113349"},{"@type":"ISBN","@value":"9783319465197"},{"@type":"ISBN","@value":"9783319465203"}],"prism:publicationName":[{"@value":"Lecture Notes in Computer Science"}],"dc:publisher":[{"@value":"Springer International Publishing"}],"prism:publicationDate":"2016","prism:startingPage":"304","prism:endingPage":"320"},"reviewed":"false","dc:rights":["http://www.springer.com/tdm"],"url":[{"@id":"http://link.springer.com/content/pdf/10.1007/978-3-319-46520-3_20"}],"createdAt":"2016-09-21","modifiedAt":"2019-09-13","project":[{"@id":"https://cir.nii.ac.jp/crid/1040282257410869376","@type":"Project","projectIdentifier":[{"@type":"KAKEN","@value":"15H05706"},{"@type":"JGN","@value":"JP15H05706"},{"@type":"URI","@value":"https://kaken.nii.ac.jp/grant/KAKENHI-PROJECT-15H05706/"}],"notation":[{"@language":"ja","@value":"高階モデル検査の深化と発展"},{"@language":"en","@value":"Refinement and Extension of Higher-Order Model Checking"}]}],"relatedProduct":[{"@id":"https://cir.nii.ac.jp/crid/1360004236269616896","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Model Checking Higher-Order Programs"}]},{"@id":"https://cir.nii.ac.jp/crid/1360292619055726848","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"A type-directed abstraction refinement approach to higher-order model checking"}]},{"@id":"https://cir.nii.ac.jp/crid/1360565168569942912","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Predicate abstraction and CEGAR for higher-order model checking"}]},{"@id":"https://cir.nii.ac.jp/crid/1360848655624576128","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Model-Checking Higher-Order Programs with Recursive Types"}]},{"@id":"https://cir.nii.ac.jp/crid/1361137043625759616","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Higher-Order Pushdown Trees Are Easy"}]},{"@id":"https://cir.nii.ac.jp/crid/1361418518443933824","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"On Model-Checking Trees Generated by Higher-Order Recursion Schemes"}]},{"@id":"https://cir.nii.ac.jp/crid/1361981469801968896","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Automata-Based Abstraction Refinement for µHORS Model Checking"}]},{"@id":"https://cir.nii.ac.jp/crid/1362544420121755136","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Verifying higher-order functional programs with pattern-matching algebraic data types"}]},{"@id":"https://cir.nii.ac.jp/crid/1363107370993183744","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of Automata"}]},{"@id":"https://cir.nii.ac.jp/crid/1363388843633133696","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Subtyping recursive types"}]},{"@id":"https://cir.nii.ac.jp/crid/1363951795942777600","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"A Type System Equivalent to the Modal Mu-Calculus Model Checking of Higher-Order Recursion Schemes"}]}],"dataSourceIdentifier":[{"@type":"CROSSREF","@value":"10.1007/978-3-319-46520-3_20"},{"@type":"KAKEN","@value":"PRODUCT-21568874"},{"@type":"OPENAIRE","@value":"doi_dedup___::8716d337a01004f8db4e298b67b5cd4b"},{"@type":"CROSSREF","@value":"10.1007/978-3-319-46520-3_20_references_DOI_9Oalsl9knOGFLaaXdxM3SGcxr6O"}]}