@prefix dcat: <http://www.w3.org/ns/dcat#> .
@prefix dct: <http://purl.org/dc/terms/> .
@prefix foaf: <http://xmlns.com/foaf/0.1/> .
@prefix vcard: <http://www.w3.org/2006/vcard/ns#> .
@prefix xsd: <http://www.w3.org/2001/XMLSchema#> .

<https://rec.harvest-normandie.data4citizen.com/dataset/oai-hal-inria-00501487v2> a dcat:Dataset ;
    dct:description """
              Tree Regular Model Checking (TRMC) is the name of a family of techniques for analyzing in nite-state systems in which states are represented by trees and sets of states by tree automata. The central problem is to decide whether a set of bad states belongs to the set of reachable states. An obstacle is that this set is in general neither regular nor computable in nite time. This paper proposes a new CounterExample Guided Abstraction Re- nement (CEGAR) algorithm for TRMC. Our approach relies on a new equational-abstraction based completion algorithm to compute a regular overapproximation of the set of reachable states in nite time. This set is represented by R=E-automata, a new extended tree automaton formalism whose structure can be exploited to detect and remove false positives in an e cient manner. Our approach has been implemented in TimbukCEGAR, a new toolset that is capable of analyzing Java programs by exploiting an elegant translation from the Java byte code to term rewriting systems. Experiments show that TimbukCEGAR outperforms existing CEGAR-based completion algorithms. Contrary to existing TRMC toolsets, the answers provided by TimbukCEGAR are certi- ed by Coq, which means that they are formally proved correct.
            """ ;
    dct:identifier "inria-00501487" ;
    dct:issued "2026-05-19T09:13:15.434233"^^xsd:dateTime ;
    dct:language "en" ;
    dct:modified "2026-05-19T09:13:15.434238"^^xsd:dateTime ;
    dct:publisher <https://rec.harvest-normandie.data4citizen.com/organization/cce9db95-46d9-4dc2-84b6-764215d0a002> ;
    dct:title "Equational Abstraction Refinement for Certified Tree Regular Model Checking" ;
    dcat:contactPoint [ a vcard:Organization ;
            vcard:fn "CCSD" ] ;
    dcat:distribution <https://rec.harvest-normandie.data4citizen.com/dataset/oai-hal-inria-00501487v2/resource/62f604cc-6b1f-410e-944f-26f7bb7638f1> ;
    dcat:keyword "infoeu-reposemanticsreport",
        "infoinfo-secomputer-science-cssoftware-engineering-csse",
        "model-checking",
        "refinement",
        "reports",
        "tree-automaton" ;
    dcat:landingPage <https://inria.hal.science/inria-00501487> .

<https://rec.harvest-normandie.data4citizen.com/dataset/oai-hal-inria-00501487v2/resource/62f604cc-6b1f-410e-944f-26f7bb7638f1> a dcat:Distribution ;
    dct:format "HTML" ;
    dct:issued "2026-05-19T09:13:15.444776"^^xsd:dateTime ;
    dct:modified "2026-05-19T09:13:15.416271"^^xsd:dateTime ;
    dct:title "Equational Abstraction Refinement for Certified Tree Regular Model Checking" ;
    dcat:accessURL <https://inria.hal.science/inria-00501487> .

<https://rec.harvest-normandie.data4citizen.com/organization/cce9db95-46d9-4dc2-84b6-764215d0a002> a foaf:Agent ;
    foaf:name "test_moissonnage_selune" .

<https://inria.hal.science/inria-00501487> a foaf:Document .