<?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 inria-00100047</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-23T00:25:05+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Proofs and countermodels in BI's pointer logic</title>
            <author role="aut">
              <persName>
                <forename type="first">Didier</forename>
                <surname>Galmiche</surname>
              </persName>
              <email type="md5">c77c5dadf00da14ec32229d4d389af57</email>
              <email type="domain">loria.fr</email>
              <idno type="idhal" notation="string">didier-galmiche</idno>
              <idno type="idhal" notation="numeric">746081</idno>
              <idno type="halauthorid" notation="string">12370-746081</idno>
              <orgName ref="#struct-0"/>
              <affiliation ref="#struct-2580"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Julien</forename>
                <surname>Gobillot</surname>
              </persName>
              <idno type="halauthorid">168353-0</idno>
              <orgName ref="#struct-0"/>
              <affiliation ref="#struct-2580"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Daniel</forename>
                <surname>Méry</surname>
              </persName>
              <email type="md5">ffab60fc49ab1af7402fda80d1343d82</email>
              <email type="domain">loria.fr</email>
              <idno type="idhal" notation="string">daniel-mery</idno>
              <idno type="idhal" notation="numeric">752381</idno>
              <idno type="halauthorid" notation="string">146250-752381</idno>
              <idno type="IDREF">https://www.idref.fr/08273349X</idno>
              <idno type="ORCID">https://orcid.org/0000-0002-1886-2106</idno>
              <orgName ref="#struct-0"/>
              <affiliation ref="#struct-2580"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Publications</forename>
                <surname>Loria</surname>
              </persName>
              <email type="md5">5ee6acd102a820bf4e187a1ec952273f</email>
              <email type="domain">loria.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2006-09-26 10:13:41</date>
              <date type="whenModified">2025-11-04 11:57:57</date>
              <date type="whenReleased">2006-09-28 15:22:47</date>
              <date type="whenProduced">2004</date>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="108626">
                <persName>
                  <forename>Publications</forename>
                  <surname>Loria</surname>
                </persName>
                <email type="md5">5ee6acd102a820bf4e187a1ec952273f</email>
                <email type="domain">loria.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">inria-00100047</idno>
            <idno type="halUri">https://inria.hal.science/inria-00100047</idno>
            <idno type="halBibtex">galmiche:inria-00100047</idno>
            <idno type="halRefHtml">&lt;i&gt;2nd APPSEM II Workshop - APPSEM'04&lt;/i&gt;, 2004, Tallinn/Estonia</idno>
            <idno type="halRef">2nd APPSEM II Workshop - APPSEM'04, 2004, Tallinn/Estonia</idno>
            <availability status="restricted"/>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
            <idno type="stamp" n="INPL">Institut National Polytechnique de Lorraine</idno>
            <idno type="stamp" n="LABO-LORIA-SET">LABO-LORIA-SET</idno>
            <idno type="stamp" n="LORIA2">Publications du LORIA</idno>
            <idno type="stamp" n="UNIV-LORRAINE">Université de Lorraine</idno>
            <idno type="stamp" n="LORIA">Laboratoire Lorrain de Recherche en Informatique et ses Applications</idno>
            <idno type="stamp" n="AM2I-UL">Pôle scientifique Automatique, Mathématiques, Informatique et leurs Intéractions de l'Université de Lorraine</idno>
          </seriesStmt>
          <notesStmt>
            <note type="commentary">Colloque avec actes et comité de lecture. internationale.</note>
            <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="1">Yes</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">Proofs and countermodels in BI's pointer logic</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Didier</forename>
                    <surname>Galmiche</surname>
                  </persName>
                  <email type="md5">c77c5dadf00da14ec32229d4d389af57</email>
                  <email type="domain">loria.fr</email>
                  <idno type="idhal" notation="string">didier-galmiche</idno>
                  <idno type="idhal" notation="numeric">746081</idno>
                  <idno type="halauthorid" notation="string">12370-746081</idno>
                  <orgName ref="#struct-0"/>
                  <affiliation ref="#struct-2580"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Julien</forename>
                    <surname>Gobillot</surname>
                  </persName>
                  <idno type="halauthorid">168353-0</idno>
                  <orgName ref="#struct-0"/>
                  <affiliation ref="#struct-2580"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Daniel</forename>
                    <surname>Méry</surname>
                  </persName>
                  <email type="md5">ffab60fc49ab1af7402fda80d1343d82</email>
                  <email type="domain">loria.fr</email>
                  <idno type="idhal" notation="string">daniel-mery</idno>
                  <idno type="idhal" notation="numeric">752381</idno>
                  <idno type="halauthorid" notation="string">146250-752381</idno>
                  <idno type="IDREF">https://www.idref.fr/08273349X</idno>
                  <idno type="ORCID">https://orcid.org/0000-0002-1886-2106</idno>
                  <orgName ref="#struct-0"/>
                  <affiliation ref="#struct-2580"/>
                </author>
              </analytic>
              <monogr>
                <idno type="localRef">A04-R-310 || galmiche04a</idno>
                <meeting>
                  <title>2nd APPSEM II Workshop - APPSEM'04</title>
                  <date type="start">2004</date>
                  <settlement>Tallinn/Estonia</settlement>
                </meeting>
                <imprint>
                  <date type="datePub">2004</date>
                </imprint>
              </monogr>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="fr">proofs</term>
                <term xml:lang="fr">countermodels</term>
                <term xml:lang="fr">resources</term>
                <term xml:lang="fr">contre-modèles</term>
                <term xml:lang="fr">ressources</term>
                <term xml:lang="fr">logique des pointeurs</term>
                <term xml:lang="fr">pointer logic</term>
                <term xml:lang="fr">preuves</term>
              </keywords>
              <classCode scheme="halDomain" n="info.info-oh">Computer Science [cs]/Other [cs.OH]</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>The question of defining an usable proof theory and proof-search methods for separation logics naturally arises and therefore our aim is to study this question firstly for BI`s pointer logic (PL). For that, we apply the same methodology than for proof search in BI logic, that consists in capturing the semantics of PL through rules with labels and constraints and then defining specific closure conditions for the corresponding tableaux method. We first define a calculus and a method for a fragment of PL with only the points-to relation and prove the correctness of the method and its completeness through the construction of countermodels from an open branch and a dependency graph. These results are extended to equality atomic predicate and to existential quantification in order to cover the PL`s formulae. Similar results are proposed for the intuitionistic version of PL that is based on affine BI in which weakening on the multiplicative conjunction holds.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="researchteam" xml:id="struct-2580" status="OLD">
          <orgName>Logic, proof Theory and Programming</orgName>
          <orgName type="acronym">TYPES</orgName>
          <desc>
            <address>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.loria.fr/la-recherche-en/equipes/types</ref>
          </desc>
          <listRelation>
            <relation active="#struct-466633" type="direct"/>
            <relation active="#struct-300009" type="indirect"/>
            <relation active="#struct-300291" type="indirect"/>
            <relation active="#struct-300292" type="indirect"/>
            <relation active="#struct-300293" type="indirect"/>
            <relation name="UMR7503" active="#struct-441569" type="indirect"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-466633" status="OLD">
          <orgName>Laboratoire Lorrain de Recherche en Informatique et ses Applications</orgName>
          <orgName type="acronym">LORIA</orgName>
          <date type="start">1997-01-01</date>
          <date type="end">2011-12-31</date>
          <desc>
            <address>
              <addrLine>Campus Scientifique BP 239 54506 Vandoeuvre-lès-Nancy Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.loria.fr</ref>
          </desc>
          <listRelation>
            <relation active="#struct-300009" type="direct"/>
            <relation active="#struct-300291" type="direct"/>
            <relation active="#struct-300292" type="direct"/>
            <relation active="#struct-300293" type="direct"/>
            <relation name="UMR7503" active="#struct-441569" 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="institution" xml:id="struct-300291" status="OLD">
          <orgName>Université Henri Poincaré - Nancy 1</orgName>
          <orgName type="acronym">UHP</orgName>
          <date type="end">2011-12-31</date>
          <desc>
            <address>
              <addrLine>24-30 rue Lionnois, BP 60120, 54 003 NANCY cedex, France</addrLine>
              <country key="FR"/>
            </address>
          </desc>
        </org>
        <org type="institution" xml:id="struct-300292" status="OLD">
          <orgName>Université Nancy 2</orgName>
          <date type="end">2011-12-31</date>
          <desc>
            <address>
              <addrLine>91 avenue de la Libération, BP 454, 54001 Nancy cedex</addrLine>
              <country key="FR"/>
            </address>
          </desc>
        </org>
        <org type="institution" xml:id="struct-300293" status="OLD">
          <orgName>Institut National Polytechnique de Lorraine</orgName>
          <orgName type="acronym">INPL</orgName>
          <date type="end">2011-12-31</date>
          <desc>
            <address>
              <country key="FR"/>
            </address>
          </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>
      </listOrg>
    </back>
  </text>
</TEI>