@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-hal-00993400v1> a dcat:Dataset ;
    dct:description """
              This paper is on the construction and the use of a shared memory abstraction on top of an asynchronous message-passing system in which up to t processes may commit Byzantine failures. This abstraction consists of arrays of n single-writer/multi-reader atomic registers, where n is the number of processes. A distributed algorithm building such a shared memory abstraction it first presented. This algorithm assumes t < n/3, which is shown to be a necessary and sufficient condition for such a construction. Hence, the algorithm is resilient-optimal. Then the paper presents distributed algorithms built on top of this shared memory abstraction, which cope with up to t Byzantine processes. The simplicity of these algorithms constitutes a strong motivation for such a shared memory abstraction in the presence of Byzantine processes. For a lot of problems, algorithms are more difficult to design and prove correct in a message-passing system than in a shared memory system. Using a protocol stacking methodology, the aim of the proposed abstraction is to allow an easier design (and proof) of distributed algorithm, when one has the underlying system is an asynchronous message-passing system prone to Byzantine failures.
            """ ;
    dct:identifier "Report N°: PI-2018" ;
    dct:issued "2026-05-05T10:48:19.643014"^^xsd:dateTime ;
    dct:language "en" ;
    dct:modified "2026-05-05T10:48:19.643022"^^xsd:dateTime ;
    dct:publisher <https://rec.harvest-normandie.data4citizen.com/organization/cce9db95-46d9-4dc2-84b6-764215d0a002> ;
    dct:title "Reliable Shared Memory Abstractions on Top of Asynchronous t-Resilient Byzantine Message-passing Systems" ;
    dcat:contactPoint [ a vcard:Organization ;
            vcard:fn "CCSD" ] ;
    dcat:distribution <https://rec.harvest-normandie.data4citizen.com/dataset/oai-hal-hal-00993400v1/resource/a8f14578-457b-4ed3-838a-1fc7e3c89ac3> ;
    dcat:keyword "infoeu-reposemanticsreport",
        "infoinfo-dccomputer-science-csdistributed-parallel-and-cluster-computing-csdc",
        "reports" ;
    dcat:landingPage <https://inria.hal.science/hal-00993400> .

<https://rec.harvest-normandie.data4citizen.com/dataset/oai-hal-hal-00993400v1/resource/a8f14578-457b-4ed3-838a-1fc7e3c89ac3> a dcat:Distribution ;
    dct:format "HTML" ;
    dct:issued "2026-05-05T10:48:19.645211"^^xsd:dateTime ;
    dct:modified "2026-05-05T10:48:19.624516"^^xsd:dateTime ;
    dct:title "Reliable Shared Memory Abstractions on Top of Asynchronous t-Resilient Byzantine Message-passing Systems" ;
    dcat:accessURL <https://inria.hal.science/hal-00993400> .

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

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