<?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-01788798</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-17T20:04:43+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">On Symbolic Heaps Modulo Permission Theories</title>
            <author role="aut">
              <persName>
                <forename type="first">S</forename>
                <surname>Demri</surname>
              </persName>
              <email type="md5">66a9b0d70773929aee63fee388faadbb</email>
              <email type="domain">lmf.cnrs.fr</email>
              <idno type="idhal" notation="string">stephane-demri</idno>
              <idno type="idhal" notation="numeric">184540</idno>
              <idno type="halauthorid" notation="string">1365358-184540</idno>
              <idno type="ORCID">https://orcid.org/0000-0002-3493-2610</idno>
              <affiliation ref="#struct-2571"/>
              <affiliation ref="#struct-441569"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">E</forename>
                <surname>Lozes</surname>
              </persName>
              <email type="md5">294fcd4b589dbf19461cc421c5958acb</email>
              <email type="domain">i3s.unice.fr</email>
              <idno type="idhal" notation="string">etienne-lozes</idno>
              <idno type="idhal" notation="numeric">169875</idno>
              <idno type="halauthorid" notation="string">1365359-169875</idno>
              <idno type="ORCID">https://orcid.org/0000-0001-8505-585X</idno>
              <affiliation ref="#struct-2571"/>
              <affiliation ref="#struct-451999"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Denis</forename>
                <surname>Lugiez</surname>
              </persName>
              <email type="md5">4392cfc498977135a0868f5a6bf87a77</email>
              <email type="domain">univ-amu.fr</email>
              <idno type="idhal" notation="numeric">1098496</idno>
              <idno type="halauthorid" notation="string">143693-1098496</idno>
              <affiliation ref="#struct-527033"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>DENIS</forename>
                <surname>LUGIEZ</surname>
              </persName>
              <email type="md5">4392cfc498977135a0868f5a6bf87a77</email>
              <email type="domain">univ-amu.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2018-05-09 14:08:10</date>
              <date type="whenModified">2025-10-07 15:32:03</date>
              <date type="whenReleased">2018-05-09 15:22:44</date>
              <date type="whenProduced">2017-12-15</date>
              <date type="whenEndEmbargoed">2018-05-09</date>
              <ref type="file" target="https://amu.hal.science/hal-01788798v1/document">
                <date notBefore="2018-05-09"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://amu.hal.science/hal-01788798v1/file/dll-final-fsttcs17.pdf" id="file-1788798-1815870">
                <date notBefore="2018-05-09"/>
              </ref>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="460654">
                <persName>
                  <forename>DENIS</forename>
                  <surname>LUGIEZ</surname>
                </persName>
                <email type="md5">4392cfc498977135a0868f5a6bf87a77</email>
                <email type="domain">univ-amu.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-01788798</idno>
            <idno type="halUri">https://amu.hal.science/hal-01788798</idno>
            <idno type="halBibtex">demri:hal-01788798</idno>
            <idno type="halRefHtml">&lt;i&gt;37th IARCS Foundation on Software Technology and Theoretical Computer Science&lt;/i&gt;, Dec 2017, Kanpur, India. &lt;a target="_blank" href="https://dx.doi.org/10.4230/LIPIcs.FSTTCS.2017.25"&gt;&amp;#x27E8;10.4230/LIPIcs.FSTTCS.2017.25&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">37th IARCS Foundation on Software Technology and Theoretical Computer Science, Dec 2017, Kanpur, India. &amp;#x27E8;10.4230/LIPIcs.FSTTCS.2017.25&amp;#x27E9;</idno>
            <availability status="restricted">
              <licence target="https://about.hal.science/hal-authorisation-v1/">HAL Authorization<ref corresp="#file-1788798-1815870"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="UNICE">Université Nice Sophia Antipolis</idno>
            <idno type="stamp" n="UNIV-TLN">Université de Toulon</idno>
            <idno type="stamp" n="LIF">Laboratoire d'informatique fondamentale de Marseille</idno>
            <idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
            <idno type="stamp" n="UNIV-AMU">Aix Marseille Université</idno>
            <idno type="stamp" n="ENS-CACHAN">Ecole Normale Supérieure de Cachan</idno>
            <idno type="stamp" n="I3S">Laboratoire d'Informatique, Signaux et Systèmes de Sophia-Antipolis</idno>
            <idno type="stamp" n="UNIV-PARIS-SACLAY">Université Paris-Saclay</idno>
            <idno type="stamp" n="ENS-CACHAN-SACLAY" corresp="UNIV-PARIS-SACLAY">ENS-CACHAN-SACLAY</idno>
            <idno type="stamp" n="UNIV-COTEDAZUR">Université Côte d'Azur</idno>
            <idno type="stamp" n="LIS-LAB">Laboratoire d'Informatique et Systèmes</idno>
            <idno type="stamp" n="MOVE" corresp="LIS-LAB">MOVE Modélisation et Vérification - LIS Laboratoire d'Informatique et Systèmes de Marseille (UMR 7020)</idno>
            <idno type="stamp" n="LSV-AUTO">Laboratoire Spécification et Vérification</idno>
            <idno type="stamp" n="FARMAN">Institut Farman</idno>
            <idno type="stamp" n="ENS-PARIS-SACLAY">Ecole Normale Supérieure paris-Saclay</idno>
            <idno type="stamp" n="GS-COMPUTER-SCIENCE">Graduate School Computer Science</idno>
            <idno type="stamp" n="LMF">Laboratoire Méthodes Formelles</idno>
            <idno type="stamp" n="LMF-PP">Preuve de programmes</idno>
            <idno type="stamp" n="UNIV-COTEDAZUR_COLLECTION_DEFAUT">UNIV-COTEDAZUR_COLLECTION_DEFAUT</idno>
            <idno type="stamp" n="TEST-NICE">test nice</idno>
          </seriesStmt>
          <notesStmt>
            <note type="audience" n="2">International</note>
            <note type="invited" n="0">No</note>
            <note type="popular" n="0">No</note>
            <note type="peer" n="1">Yes</note>
            <note type="proceedings" n="0">No</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">On Symbolic Heaps Modulo Permission Theories</title>
                <author role="aut">
                  <persName>
                    <forename type="first">S</forename>
                    <surname>Demri</surname>
                  </persName>
                  <email type="md5">66a9b0d70773929aee63fee388faadbb</email>
                  <email type="domain">lmf.cnrs.fr</email>
                  <idno type="idhal" notation="string">stephane-demri</idno>
                  <idno type="idhal" notation="numeric">184540</idno>
                  <idno type="halauthorid" notation="string">1365358-184540</idno>
                  <idno type="ORCID">https://orcid.org/0000-0002-3493-2610</idno>
                  <affiliation ref="#struct-2571"/>
                  <affiliation ref="#struct-441569"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">E</forename>
                    <surname>Lozes</surname>
                  </persName>
                  <email type="md5">294fcd4b589dbf19461cc421c5958acb</email>
                  <email type="domain">i3s.unice.fr</email>
                  <idno type="idhal" notation="string">etienne-lozes</idno>
                  <idno type="idhal" notation="numeric">169875</idno>
                  <idno type="halauthorid" notation="string">1365359-169875</idno>
                  <idno type="ORCID">https://orcid.org/0000-0001-8505-585X</idno>
                  <affiliation ref="#struct-2571"/>
                  <affiliation ref="#struct-451999"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Denis</forename>
                    <surname>Lugiez</surname>
                  </persName>
                  <email type="md5">4392cfc498977135a0868f5a6bf87a77</email>
                  <email type="domain">univ-amu.fr</email>
                  <idno type="idhal" notation="numeric">1098496</idno>
                  <idno type="halauthorid" notation="string">143693-1098496</idno>
                  <affiliation ref="#struct-527033"/>
                </author>
              </analytic>
              <monogr>
                <meeting>
                  <title>37th IARCS Foundation on Software Technology and Theoretical Computer Science</title>
                  <date type="start">2017-12-15</date>
                  <settlement>Kanpur</settlement>
                  <country key="IN">India</country>
                </meeting>
                <imprint/>
              </monogr>
              <idno type="doi">10.4230/LIPIcs.FSTTCS.2017.25</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">reasoning modulo theories</term>
                <term xml:lang="en">permission</term>
                <term xml:lang="en">entailment</term>
                <term xml:lang="en">separation logic</term>
              </keywords>
              <classCode scheme="acm" n="D">D.: Software</classCode>
              <classCode scheme="halDomain" n="info">Computer Science [cs]</classCode>
              <classCode scheme="halDomain" n="info.info-lo">Computer Science [cs]/Logic in Computer Science [cs.LO]</classCode>
              <classCode scheme="halTypology" n="COMM">Conference papers</classCode>
              <classCode scheme="halOldTypology" n="COMM">Conference papers</classCode>
              <classCode scheme="halTreeTypology" n="COMM">Conference papers</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>We address the entailment problem for separation logic with symbolic heaps admitting list predicates and permissions for memory cells that are essential to express ownership of a heap region. In the permission-free case, the entailment problem is known to be in P. Herein, we design new decision procedures for solving the satisfiability and entailment problems that are parameterised by the permission theories. This permits the use of solvers dealing with the permission theory at hand, independently of the shape analysis. We also show that the entailment problem without list predicates is coNP-complete for several permission models, such as counting permissions and binary tree shares but the problem is in P for fractional permissions. Furthermore, when list predicates are added, we prove that the entailment problem is coNP-complete when the entail-ment problem for permission formulae is in coNP, assuming the write permission can be split into as many read permissions as desired. Finally, we show that the entailment problem for any Boolean permission model with infinite width is coNP-complete. 1 Introduction Separation logics with permissions. In program verification, proving properties of the memory is one of the most difficult tasks and separation logic has been devised for this goal [14]. Separation logic with permissions [4] can express that the ownership of a given heap region is shared with other threads. A permission can be thought of as a "quantity of ownership" associated to each cell of the heap. This quantity prescribes whether write accesses are allowed or not on this cell and how such a write access may be restored in the future. This abstract notion has lead to many permission theories and separation logics, including fractional permissions [5], token-based permissions [4], combinations of the two, binary tree shares [7], and yet some other models. Separation logic with permissions is supported by several tools like VeriFast [12], Hip/Sleek [11], or Heap-Hop [16]. Usually, these tools support only one permission model and demand that permissions are explicit values. For instance, in a tool that supports fractional permissions, to express that a cell x is shared by two threads for read access, one may write x 0.3 → y and x 0.7 → y making an arbitrary choice for permissions (0.3 and 0.7) when a better approach would use x α → y and x β → y and the constraint 1 = α + β (as it is done in the paper). This hides the logical structure of the proof and ties it to a specific arbitrary permission model. Our motivations. We wish to get rid of the use of explicit permission models and to provide a separation logic with permissions which can use symbolic permission expressions</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="laboratory" xml:id="struct-2571" status="OLD">
          <orgName>Laboratoire Spécification et Vérification [Cachan]</orgName>
          <orgName type="acronym">LSV</orgName>
          <date type="end">2019-12-31</date>
          <desc>
            <address>
              <addrLine>Bâtiment d'Alembert 61 Avenue du Président Wilson 94235 CACHAN CEDEX</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.lsv.ens-cachan.fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-6862" type="direct"/>
            <relation name="UMR8643" active="#struct-441569" type="direct"/>
          </listRelation>
        </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="department" xml:id="struct-451999" status="VALID">
          <orgName>COMmunications, Réseaux, systèmes Embarqués et Distribués</orgName>
          <orgName type="acronym">Laboratoire I3S - COMRED</orgName>
          <date type="start">2016-03-02</date>
          <desc>
            <address>
              <addrLine>Laboratoire I3SCS 4012106903 Sophia Antipolis Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.i3s.unice.fr/comred</ref>
          </desc>
          <listRelation>
            <relation active="#struct-13009" type="direct"/>
            <relation active="#struct-117617" type="indirect"/>
            <relation name="UMR7271" active="#struct-441569" type="indirect"/>
            <relation active="#struct-1039632" type="indirect"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-527033" status="VALID">
          <idno type="IdRef">234768002</idno>
          <idno type="RNSR">201822714R</idno>
          <idno type="ROR">https://ror.org/0257sgk90</idno>
          <idno type="Wikidata">Q52605252</idno>
          <orgName>Laboratoire d'Informatique et des Systèmes (LIS) (Marseille, Toulon)</orgName>
          <orgName type="acronym">LIS</orgName>
          <date type="start">2018-01-01</date>
          <desc>
            <address>
              <addrLine>Aix Marseille Université – Campus de Saint Jérôme – Bat. Polytech, 52 Av. Escadrille Normandie Niemen, 13397 Marseille Cedex 20</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.lis-lab.fr</ref>
          </desc>
          <listRelation>
            <relation name="UMR7020" active="#struct-198056" type="direct"/>
            <relation name="UMR7020" active="#struct-303091" type="direct"/>
            <relation name="UMR7020" active="#struct-441569" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-6862" status="VALID">
          <orgName>École normale supérieure - Cachan</orgName>
          <orgName type="acronym">ENS Cachan</orgName>
          <desc>
            <address>
              <addrLine>61, avenue du Président Wilson - 94230 Cachan</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.ens-cachan.fr/</ref>
          </desc>
        </org>
        <org type="laboratory" xml:id="struct-13009" status="VALID">
          <idno type="IdRef">050320491</idno>
          <idno type="ISNI">0000000105613840</idno>
          <idno type="RNSR">201220432L</idno>
          <idno type="ROR">https://ror.org/01215r597</idno>
          <orgName>Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis</orgName>
          <orgName type="acronym">I3S</orgName>
          <desc>
            <address>
              <addrLine>2000, route des Lucioles - Les Algorithmes - bât. Euclide B 06900 Sophia Antipolis</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.i3s.unice.fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-117617" type="direct"/>
            <relation name="UMR7271" active="#struct-441569" type="direct"/>
            <relation active="#struct-1039632" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-117617" status="VALID">
          <idno type="IdRef">026403498</idno>
          <idno type="ISNI">0000000123372892</idno>
          <idno type="ROR">https://ror.org/02k9vew78</idno>
          <orgName>Université Nice Sophia Antipolis (1965 - 2019)</orgName>
          <orgName type="acronym">UNS</orgName>
          <date type="start">1965-10-23</date>
          <date type="end">2019-12-31</date>
          <desc>
            <address>
              <addrLine>Parc Valrose, 06100 Nice</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://unice.fr/</ref>
          </desc>
        </org>
        <org type="regroupinstitution" xml:id="struct-1039632" status="VALID">
          <idno type="IdRef">241035694</idno>
          <idno type="ROR">https://ror.org/019tgvf94</idno>
          <orgName>Université Côte d'Azur</orgName>
          <orgName type="acronym">UniCA</orgName>
          <date type="start">2020-01-01</date>
          <desc>
            <address>
              <addrLine>Parc Valrose, 28, avenue Valrose 06108 Nice Cedex 2</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://univ-cotedazur.fr</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-198056" status="VALID">
          <idno type="IdRef">15863621X</idno>
          <idno type="ISNI">0000 0001 2176 4817</idno>
          <idno type="ROR">https://ror.org/035xkbk20</idno>
          <orgName>Aix Marseille Université</orgName>
          <orgName type="acronym">AMU</orgName>
          <date type="start">2012-01-01</date>
          <desc>
            <address>
              <addrLine>Aix-Marseille UniversitéJardins du Pharo58 Boulevard Charles Livon13284 Marseille cedex 7</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.univ-amu.fr/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-303091" status="VALID">
          <idno type="IdRef">031122337</idno>
          <idno type="ROR">https://ror.org/02m9kbe37</idno>
          <orgName>Université de Toulon</orgName>
          <orgName type="acronym">UTLN</orgName>
          <desc>
            <address>
              <addrLine>Avenue de l'Université - BP 20132 - 83957 La Garde Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.univ-tln.fr/</ref>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>