<?xml version="1.0" encoding="utf-8"?>
<TEI xmlns="http://www.tei-c.org/ns/1.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:hal="http://hal.archives-ouvertes.fr/" xmlns:gml="http://www.opengis.net/gml/3.3/" xmlns:gmlce="http://www.opengis.net/gml/3.3/ce" version="1.1" xsi:schemaLocation="http://www.tei-c.org/ns/1.0 http://api.archives-ouvertes.fr/documents/aofr-sword.xsd">
  <teiHeader>
    <fileDesc>
      <titleStmt>
        <title>HAL TEI export of hal-01685945</title>
      </titleStmt>
      <publicationStmt>
        <distributor>CCSD</distributor>
        <availability status="restricted">
          <licence target="https://creativecommons.org/publicdomain/zero/1.0/">CC0 1.0 - Universal</licence>
        </availability>
        <date when="2026-05-13T20:58:51+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Just-Right Consistency: reconciling availability and safety</title>
            <title xml:lang="fr">La juste cohérence pour reconcilier disponibilité et sûreté</title>
            <author role="aut">
              <persName>
                <forename type="first">Marc</forename>
                <surname>Shapiro</surname>
              </persName>
              <email type="md5">3a9fba80fb97fa40366e556d67d48b36</email>
              <email type="domain">acm.org</email>
              <idno type="idhal" notation="string">shapiro</idno>
              <idno type="idhal" notation="numeric">2384</idno>
              <idno type="halauthorid" notation="string">2120-2384</idno>
              <idno type="IDREF">https://www.idref.fr/068666128</idno>
              <idno type="ORCID">https://orcid.org/0000-0002-8953-9322</idno>
              <idno type="VIAF">https://viaf.org/viaf/200932310</idno>
              <idno type="RESEARCHERID">http://www.researcherid.com/rid/AAO-3785-2021</idno>
              <idno type="RESEARCHERID">http://www.researcherid.com/rid/http://www.researcherid.com/rid/AAO-3785-2021</idno>
              <orgName ref="#struct-300009"/>
              <affiliation ref="#struct-541722"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Annette</forename>
                <surname>Bieniusa</surname>
              </persName>
              <email type="md5">f4f26be0d8e27c7817b94fcd66806e3b</email>
              <email type="domain">cs.uni-kl.de</email>
              <idno type="idhal" notation="numeric">946508</idno>
              <idno type="halauthorid" notation="string">665217-946508</idno>
              <orgName ref="#struct-358321"/>
              <affiliation ref="#struct-358321"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Nuno</forename>
                <surname>Preguiça</surname>
              </persName>
              <email type="md5">135ee343a18e76e9f7d91c2b686c2743</email>
              <email type="domain">di.fct.unl.pt</email>
              <idno type="idhal" notation="numeric">843240</idno>
              <idno type="halauthorid" notation="string">233272-843240</idno>
              <orgName ref="#struct-0"/>
              <affiliation ref="#struct-420636"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Valter</forename>
                <surname>Balegas</surname>
              </persName>
              <email type="md5">69719c6c65ec48bf406feec26ddc96a4</email>
              <email type="domain">live.com</email>
              <idno type="idhal" notation="numeric">930962</idno>
              <idno type="halauthorid" notation="string">663898-930962</idno>
              <orgName ref="#struct-1114557"/>
              <affiliation ref="#struct-420636"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Christopher</forename>
                <surname>Meiklejohn</surname>
              </persName>
              <email type="md5">3e09fee7b359be847ed5fa48f524a3d3</email>
              <email type="domain">gmail.com</email>
              <idno type="idhal" notation="numeric">1026758</idno>
              <idno type="halauthorid" notation="string">1299218-1026758</idno>
              <orgName ref="#struct-92863"/>
              <affiliation ref="#struct-92863"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Marc</forename>
                <surname>Shapiro</surname>
              </persName>
              <email type="md5">3a9fba80fb97fa40366e556d67d48b36</email>
              <email type="domain">acm.org</email>
            </editor>
            <funder ref="#projeurop-98828"/>
            <funder ref="#projeurop-712038"/>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2018-01-18 09:33:51</date>
              <date type="whenModified">2026-04-10 14:18:03</date>
              <date type="whenReleased">2018-01-24 10:21:47</date>
              <date type="whenProduced">2018-01-16</date>
              <date type="whenEndEmbargoed">2018-01-18</date>
              <ref type="file" target="https://inria.hal.science/hal-01685945v1/document">
                <date notBefore="2018-01-18"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://inria.hal.science/hal-01685945v1/file/RR-9145.pdf" id="file-1685945-1728807">
                <date notBefore="2018-01-18"/>
              </ref>
              <ref type="externalLink" target="http://arxiv.org/pdf/1801.06340"/>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="121276">
                <persName>
                  <forename>Marc</forename>
                  <surname>Shapiro</surname>
                </persName>
                <email type="md5">3a9fba80fb97fa40366e556d67d48b36</email>
                <email type="domain">acm.org</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-01685945</idno>
            <idno type="halUri">https://inria.hal.science/hal-01685945</idno>
            <idno type="halBibtex">shapiro:hal-01685945</idno>
            <idno type="halRefHtml">[Research Report] RR-9145, Inria Paris; UPMC - Paris 6 Sorbonne Universités; Tech. U. Kaiserslautern; U. Nova de Lisboa; U. Catholique de Louvain. 2018, pp.1-15</idno>
            <idno type="halRef">[Research Report] RR-9145, Inria Paris; UPMC - Paris 6 Sorbonne Universités; Tech. U. Kaiserslautern; U. Nova de Lisboa; U. Catholique de Louvain. 2018, pp.1-15</idno>
            <availability status="restricted">
              <licence target="https://creativecommons.org/licenses/by/4.0/">CC BY 4.0 - Attribution<ref corresp="#file-1685945-1728807"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
            <idno type="stamp" n="INRIA">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
            <idno type="stamp" n="INRIA-ROCQ">INRIA Paris - Rocquencourt</idno>
            <idno type="stamp" n="INRIA-RRRT">Rapports de recherche et Technique de l'Inria</idno>
            <idno type="stamp" n="OPENAIRE">OpenAIRE</idno>
            <idno type="stamp" n="TESTALAIN1">TESTALAIN1</idno>
            <idno type="stamp" n="LIP6" corresp="SORBONNE-UNIVERSITE">Laboratoire d'Informatique de Paris 6</idno>
            <idno type="stamp" n="INRIA2">INRIA 2</idno>
            <idno type="stamp" n="LARA">LARA</idno>
            <idno type="stamp" n="INRIA-300009">Inria 300009</idno>
            <idno type="stamp" n="SORBONNE-UNIVERSITE">Sorbonne Université</idno>
            <idno type="stamp" n="SORBONNE-UNIV" corresp="SORBONNE-UNIVERSITE">Sorbonne Université 01/01/2018</idno>
            <idno type="stamp" n="SU-SCIENCES" corresp="SORBONNE-UNIVERSITE">Faculté des Sciences de Sorbonne Université</idno>
            <idno type="stamp" n="TEST-HALCNRS">Collection test HAL CNRS</idno>
            <idno type="stamp" n="SU-TI">Sorbonne Université - Texte Intégral</idno>
            <idno type="stamp" n="ALLIANCE-SU"> Alliance Sorbonne Université</idno>
            <idno type="stamp" n="INRIA-ALLEMAGNE">INRIA-ALLEMAGNE</idno>
            <idno type="stamp" n="SUPRA_MATHS_INFO">Mathématiques + Informatique</idno>
          </seriesStmt>
          <notesStmt>
            <note type="report" n="6">Research Report</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">Just-Right Consistency: reconciling availability and safety</title>
                <title xml:lang="fr">La juste cohérence pour reconcilier disponibilité et sûreté</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Marc</forename>
                    <surname>Shapiro</surname>
                  </persName>
                  <email type="md5">3a9fba80fb97fa40366e556d67d48b36</email>
                  <email type="domain">acm.org</email>
                  <idno type="idhal" notation="string">shapiro</idno>
                  <idno type="idhal" notation="numeric">2384</idno>
                  <idno type="halauthorid" notation="string">2120-2384</idno>
                  <idno type="IDREF">https://www.idref.fr/068666128</idno>
                  <idno type="ORCID">https://orcid.org/0000-0002-8953-9322</idno>
                  <idno type="VIAF">https://viaf.org/viaf/200932310</idno>
                  <idno type="RESEARCHERID">http://www.researcherid.com/rid/AAO-3785-2021</idno>
                  <idno type="RESEARCHERID">http://www.researcherid.com/rid/http://www.researcherid.com/rid/AAO-3785-2021</idno>
                  <orgName ref="#struct-300009"/>
                  <affiliation ref="#struct-541722"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Annette</forename>
                    <surname>Bieniusa</surname>
                  </persName>
                  <email type="md5">f4f26be0d8e27c7817b94fcd66806e3b</email>
                  <email type="domain">cs.uni-kl.de</email>
                  <idno type="idhal" notation="numeric">946508</idno>
                  <idno type="halauthorid" notation="string">665217-946508</idno>
                  <orgName ref="#struct-358321"/>
                  <affiliation ref="#struct-358321"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Nuno</forename>
                    <surname>Preguiça</surname>
                  </persName>
                  <email type="md5">135ee343a18e76e9f7d91c2b686c2743</email>
                  <email type="domain">di.fct.unl.pt</email>
                  <idno type="idhal" notation="numeric">843240</idno>
                  <idno type="halauthorid" notation="string">233272-843240</idno>
                  <orgName ref="#struct-0"/>
                  <affiliation ref="#struct-420636"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Valter</forename>
                    <surname>Balegas</surname>
                  </persName>
                  <email type="md5">69719c6c65ec48bf406feec26ddc96a4</email>
                  <email type="domain">live.com</email>
                  <idno type="idhal" notation="numeric">930962</idno>
                  <idno type="halauthorid" notation="string">663898-930962</idno>
                  <orgName ref="#struct-1114557"/>
                  <affiliation ref="#struct-420636"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Christopher</forename>
                    <surname>Meiklejohn</surname>
                  </persName>
                  <email type="md5">3e09fee7b359be847ed5fa48f524a3d3</email>
                  <email type="domain">gmail.com</email>
                  <idno type="idhal" notation="numeric">1026758</idno>
                  <idno type="halauthorid" notation="string">1299218-1026758</idno>
                  <orgName ref="#struct-92863"/>
                  <affiliation ref="#struct-92863"/>
                </author>
              </analytic>
              <monogr>
                <idno type="reportNumber">RR-9145</idno>
                <imprint>
                  <biblScope unit="pp">1-15</biblScope>
                  <date type="datePub">2018-01-16</date>
                </imprint>
                <authority type="institution">Inria Paris</authority>
                <authority type="institution">UPMC  - Paris 6 Sorbonne Universités</authority>
                <authority type="institution">Tech. U. Kaiserslautern</authority>
                <authority type="institution">U. Nova de Lisboa</authority>
                <authority type="institution">U. Catholique de Louvain</authority>
              </monogr>
              <idno type="arxiv">1801.06340</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">CAP Theorem</term>
                <term xml:lang="en">Distributed systems</term>
                <term xml:lang="en">Availability</term>
                <term xml:lang="en">Consistency</term>
                <term xml:lang="en">Distributed programming</term>
                <term xml:lang="en">Iinvariants</term>
                <term xml:lang="fr">Disponibilité</term>
                <term xml:lang="fr">Programmation répartie</term>
                <term xml:lang="fr">Invariants</term>
                <term xml:lang="fr">Théorème CAP</term>
                <term xml:lang="fr">Système distribué</term>
                <term xml:lang="fr">Cohérence</term>
              </keywords>
              <classCode scheme="acm" n="C.2.4">C.: Computer Systems Organization/C.2: COMPUTER-COMMUNICATION NETWORKS/C.2.4: Distributed Systems</classCode>
              <classCode scheme="acm" n="D.2.2">D.: Software/D.2: SOFTWARE ENGINEERING/D.2.2: Design Tools and Techniques</classCode>
              <classCode scheme="acm" n="F.3.1">F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.1: Specifying and Verifying and Reasoning about Programs</classCode>
              <classCode scheme="halDomain" n="info.info-dc">Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC]</classCode>
              <classCode scheme="halDomain" n="info.info-db">Computer Science [cs]/Databases [cs.DB]</classCode>
              <classCode scheme="halTypology" n="REPORT">Reports</classCode>
              <classCode scheme="halOldTypology" n="REPORT">Reports</classCode>
              <classCode scheme="halTreeTypology" n="REPORT.RESREPORT">Reports - Research report</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>By the CAP Theorem, a distributed data storage system can ensure either Consistency under Partition (CP) or Availability under Partition (AP), but not both.  This has led to a split between CP databases, in which updates are synchronous, and AP databases, where they are asynchronous.  However, there is no inherent reason to treat all updates identically: simply, the system should be as available as possible, and synchronised just enough for the application to be correct.  We offer a principled \emph{Just-Right Consistency} approach to designing such applications, reconciling correctness with availability and performance, based on the following insights:(i) The Conflict-Free Replicated Data Type (CRDTs) data model supports asynchronous updates in an intuitive and principled way.(ii) Invariants involving joint or mutually-ordered updates are compatible with AP and can be guaranteed by Transactional Causal Consistency, the strongest consistency model that does not compromise availability.  Regarding the remaining, ``CAP-sensitive'' invariants:(iii) For the common pattern of Bounded Counters, we provide encapsulated data type that is proven correct and is efficient; (iv) in the general case, static analysis can identify when synchronisation is not necessary for correctness.Our Antidote cloud database system supports CRDTs, Transactional Causal Consistency and the Bounded Counter data type.  Support tools help design applications by static analysis and proof of CAP-sensitive invariants.  This system supports industrial-grade applications and has been tested experimentally with hundreds of servers across several geo-distributed data centres.</p>
            </abstract>
            <abstract xml:lang="fr">
              <p>Le théorème CAP, un système de stockage réparti peut être, en cas de partition, soit cohérent (CP), soit disponible (AP), mais pas les deux. Il y a donc des bases de données CP, où les mises à jour sont synchrones, et les bases AP, où elles sont asynchrones. Cependant, il n'y a pas de raison essentielle de traiter toutes les mises à jour de façon identique. L'objectif est que le système reste aussi disponible que possible, mais suffisamment synchronisé pour que l'application reste correcte. Nous proposons un nouveau principe, la juste cohérence, afin de concevoir de telles applications, réconciliant la sûreté avec la disponibilité et l'efficacité, à partir des constatations suivantes : (i) Le modèle de données des CRDT (Conict-Free Replicated Data Type) permet les mises à jour concurrentes de façon à la fois théoriquement fondée et intuitive. (ii) Les invariants basés sur la simultanéité ou l'ordre partiel des mises à jour sont compatibles avec AP, et peuvent être garanties par la Cohérence Causale Transactionelle (TCC), le modèle de cohérence le plus fort qui ne compromet pas la disponibilité.En ce qui concerne les autres invariants, dits CAP-sensibles : (iii) Le cas courant du compteur borné peut être géré par un type de données encapsulé, correct et cohérent, appelé Bounded Counter ; et (iv) dans le cas général, une analyse statique permet d'indentifier les cas où la sûreté ne nécessite pas de synchronisation. Notre base de données \nuage" Antidote offre les CRDT, le modèle TCC, et le type de données Bounded Counter. Des outils d'analyse statique et de preuve des invariants CAP-sensibles aident à  la conception des applications. Notre système est mûrpour des applications d'échelle industrielle, et à été testé expérimentallement sur des centaines de serveurs répartis entre plusieurs centres de données géo-distribués.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="researchteam" xml:id="struct-541722" status="OLD">
          <idno type="RNSR">201822643N</idno>
          <orgName>DistributEd aLgorithms and sYStems</orgName>
          <orgName type="acronym">DELYS</orgName>
          <date type="start">2018-01-01</date>
          <date type="end">2022-12-31</date>
          <desc>
            <address>
              <addrLine>2 rue Simone Iff -CS 42112 -75589 Paris Cedex 12</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.inria.fr/equipes/delys</ref>
          </desc>
          <listRelation>
            <relation active="#struct-454310" type="direct"/>
            <relation active="#struct-300009" type="indirect"/>
            <relation active="#struct-541703" type="direct"/>
            <relation active="#struct-413221" type="indirect"/>
            <relation name="UMR7606" active="#struct-441569" type="indirect"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-358321" status="VALID">
          <idno type="ROR">https://ror.org/04zrf7b53</idno>
          <orgName>Technische Universität Kaiserslautern</orgName>
          <orgName type="acronym">TU Kaiserslautern</orgName>
          <date type="start">1970-01-01</date>
          <desc>
            <address>
              <addrLine>Erwin-Schrödinger-Straße 52, 67663 Kaiserslautern</addrLine>
              <country key="DE"/>
            </address>
            <ref type="url">https://www.uni-kl.de/en/home/</ref>
          </desc>
        </org>
        <org type="department" xml:id="struct-420636" status="VALID">
          <orgName>NOVA Laboratory for Computer Science and Informatics</orgName>
          <orgName type="acronym">NOVA-LINCS</orgName>
          <desc>
            <address>
              <addrLine>Departamento de InformáticaFaculdade de Ciências e TecnologiaUniversidade Nova de LisboaCampus da Caparica2829-516 Caparica</addrLine>
              <country key="PT"/>
            </address>
            <ref type="url">http://nova-lincs.di.fct.unl.pt/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-502001" type="direct"/>
            <relation active="#struct-450840" type="indirect"/>
            <relation active="#struct-327246" type="indirect"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-92863" status="VALID">
          <idno type="IdRef">026431297</idno>
          <idno type="ROR">https://ror.org/02495e989</idno>
          <orgName>Université Catholique de Louvain = Catholic University of Louvain</orgName>
          <orgName type="acronym">UCLouvain</orgName>
          <desc>
            <address>
              <addrLine>Place de l'Université 1, B-1348 Louvain-La-Neuve</addrLine>
              <country key="BE"/>
            </address>
            <ref type="url">https://www.uclouvain.be/fr</ref>
          </desc>
        </org>
        <org type="laboratory" xml:id="struct-454310" status="VALID">
          <idno type="IdRef">241614864</idno>
          <idno type="RNSR">196718247G</idno>
          <idno type="ROR">https://ror.org/05eyd5d35</idno>
          <orgName>Centre Inria de Paris</orgName>
          <date type="start">2016-03-10</date>
          <desc>
            <address>
              <addrLine>48 Rue Barrault, 75013 Paris</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/centre/paris</ref>
          </desc>
          <listRelation>
            <relation active="#struct-300009" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-300009" status="VALID">
          <idno type="ROR">https://ror.org/02kvxyf05</idno>
          <orgName>Institut National de Recherche en Informatique et en Automatique</orgName>
          <orgName type="acronym">Inria</orgName>
          <desc>
            <address>
              <addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/en/</ref>
          </desc>
        </org>
        <org type="laboratory" xml:id="struct-541703" status="VALID">
          <idno type="IdRef">13558292X</idno>
          <idno type="RNSR">199712651U</idno>
          <idno type="ROR">https://ror.org/05krcen59</idno>
          <orgName>LIP6</orgName>
          <date type="start">2018-01-01</date>
          <desc>
            <address>
              <addrLine>4 Place JUSSIEU 75252 PARIS CEDEX 05</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.lip6.fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-413221" type="direct"/>
            <relation name="UMR7606" active="#struct-441569" type="direct"/>
          </listRelation>
        </org>
        <org type="regroupinstitution" xml:id="struct-413221" status="VALID">
          <idno type="IdRef">221333754</idno>
          <idno type="ROR">https://ror.org/02en5vm52</idno>
          <orgName>Sorbonne Université</orgName>
          <orgName type="acronym">SU</orgName>
          <date type="start">2018-01-01</date>
          <desc>
            <address>
              <addrLine>21 rue de l’École de médecine - 75006 Paris</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.sorbonne-universite.fr/</ref>
          </desc>
        </org>
        <org type="regroupinstitution" xml:id="struct-441569" status="VALID">
          <idno type="IdRef">02636817X</idno>
          <idno type="ISNI">0000000122597504</idno>
          <idno type="ROR">https://ror.org/02feahw73</idno>
          <orgName>Centre National de la Recherche Scientifique</orgName>
          <orgName type="acronym">CNRS</orgName>
          <date type="start">1939-10-19</date>
          <desc>
            <address>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.cnrs.fr/</ref>
          </desc>
        </org>
        <org type="laboratory" xml:id="struct-502001" status="VALID">
          <orgName>Departamento de Informática</orgName>
          <orgName type="acronym">DI</orgName>
          <date type="start">2017-07-21</date>
          <desc>
            <address>
              <addrLine>Faculdade de Ciências e TecnologiaUniversidade Nova de LisboaQuinta da Torre, 2829 -516 CAPARICA, PORTUGAL</addrLine>
              <country key="PT"/>
            </address>
            <ref type="url">http://www.di.fct.unl.pt/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-450840" type="direct"/>
            <relation active="#struct-327246" type="indirect"/>
          </listRelation>
        </org>
        <org type="regrouplaboratory" xml:id="struct-450840" status="VALID">
          <orgName>Faculdade de Ciências e Tecnologia = School of Science &amp; Technology</orgName>
          <orgName type="acronym">FCT NOVA</orgName>
          <date type="start">1977-01-01</date>
          <desc>
            <address>
              <addrLine>Quinta da Torre, Campus Universitário, 2829-516 Caparica</addrLine>
              <country key="PT"/>
            </address>
            <ref type="url">http://www.fct.unl.pt/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-327246" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-327246" status="VALID">
          <orgName>Universidade Nova de Lisboa = NOVA University Lisbon</orgName>
          <orgName type="acronym">NOVA</orgName>
          <desc>
            <address>
              <addrLine>Campus de Campolide1099-085 Lisboa</addrLine>
              <country key="PT"/>
            </address>
            <ref type="url">http://www.unl.pt/</ref>
          </desc>
        </org>
      </listOrg>
      <listOrg type="projects">
        <org type="europeanProject" xml:id="projeurop-98828" status="VALID">
          <idno type="number">609551</idno>
          <idno type="program">FP7-ICT-2013-10</idno>
          <idno type="call">FP7-ICT-2013-10</idno>
          <orgName>SyncFree</orgName>
          <desc>Large-scale computation without synchronisation</desc>
          <date type="start">2013-01-10</date>
          <date type="end">2016-12-31</date>
        </org>
        <org type="europeanProject" xml:id="projeurop-712038" status="VALID">
          <idno type="number">732505</idno>
          <idno type="program">H2020-ICT-2016-2017</idno>
          <idno type="call">H2020-ICT-2016-1</idno>
          <orgName>LightKone</orgName>
          <desc>Lightweight Computation for Networks at the Edge</desc>
          <date type="start">2017-01-01</date>
          <date type="end">2019-12-31</date>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>