<?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-01514667</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-21T10:21:06+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Push-Down Automata with Gap-Order Constraints</title>
            <author role="aut">
              <persName>
                <forename type="first">Parosh</forename>
                <forename type="middle">Aziz</forename>
                <surname>Abdulla</surname>
              </persName>
              <email type="md5">c6aee7dbef032bfa43f3d75352bbfc8d</email>
              <email type="domain">it.uu.se</email>
              <idno type="idhal" notation="numeric">1007031</idno>
              <idno type="halauthorid" notation="string">1104439-1007031</idno>
              <affiliation ref="#struct-50873"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Mohamed</forename>
                <forename type="middle">Faouzi</forename>
                <surname>Atig</surname>
              </persName>
              <email type="md5">d7b5ffa8225aca907fe0cfb46490625f</email>
              <email type="domain">it.uu.se</email>
              <idno type="idhal" notation="numeric">998103</idno>
              <idno type="halauthorid" notation="string">1104440-998103</idno>
              <affiliation ref="#struct-50873"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Giorgio</forename>
                <surname>Delzanno</surname>
              </persName>
              <email type="md5">ddc459b86c26b2adb58a5989c6cf8bd5</email>
              <email type="domain">disi.unige.it</email>
              <idno type="idhal" notation="numeric">966688</idno>
              <idno type="halauthorid" notation="string">167785-966688</idno>
              <affiliation ref="#struct-302889"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Andreas</forename>
                <surname>Podelski</surname>
              </persName>
              <email type="md5">f50eac0b7dce5cf155dec007f04d87ac</email>
              <email type="domain">informatik.uni-freiburg.de</email>
              <idno type="idhal" notation="numeric">1007032</idno>
              <idno type="halauthorid" notation="string">509148-1007032</idno>
              <affiliation ref="#struct-449355"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Hal</forename>
                <surname>Ifip</surname>
              </persName>
              <email type="md5">2073ac78024b6e13f2714db96e9b1e63</email>
              <email type="domain">inria.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2017-04-26 15:22:10</date>
              <date type="whenModified">2026-02-07 05:13:39</date>
              <date type="whenReleased">2017-04-26 15:26:38</date>
              <date type="whenProduced">2013-04-24</date>
              <date type="whenEndEmbargoed">2016-01-01</date>
              <ref type="file" target="https://inria.hal.science/hal-01514667v1/document">
                <date notBefore="2016-01-01"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://inria.hal.science/hal-01514667v1/file/978-3-642-40213-5_13_Chapter.pdf" id="file-1514667-1575658">
                <date notBefore="2016-01-01"/>
              </ref>
              <ref type="externalLink" target="https://link.springer.com/content/pdf/10.1007%2F978-3-642-40213-5_13.pdf"/>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="200187">
                <persName>
                  <forename>Hal</forename>
                  <surname>Ifip</surname>
                </persName>
                <email type="md5">2073ac78024b6e13f2714db96e9b1e63</email>
                <email type="domain">inria.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-01514667</idno>
            <idno type="halUri">https://inria.hal.science/hal-01514667</idno>
            <idno type="halBibtex">abdulla:hal-01514667</idno>
            <idno type="halRefHtml">&lt;i&gt;5th International Conference on Fundamentals of Software Engineering (FSEN)&lt;/i&gt;, Apr 2013, Tehran, Iran. pp.199-216, &lt;a target="_blank" href="https://dx.doi.org/10.1007/978-3-642-40213-5_13"&gt;&amp;#x27E8;10.1007/978-3-642-40213-5_13&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">5th International Conference on Fundamentals of Software Engineering (FSEN), Apr 2013, Tehran, Iran. pp.199-216, &amp;#x27E8;10.1007/978-3-642-40213-5_13&amp;#x27E9;</idno>
            <availability status="restricted">
              <licence target="https://creativecommons.org/licenses/by/4.0/">CC BY 4.0 - Attribution<ref corresp="#file-1514667-1575658"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="IFIP-LNCS" corresp="IFIP">IFIP - Lecture Notes in Computer Science</idno>
            <idno type="stamp" n="IFIP">IFIP - International Federation for Information Processing</idno>
            <idno type="stamp" n="IFIP-TC" corresp="IFIP">IFIP Technical Committees </idno>
            <idno type="stamp" n="IFIP-TC2" corresp="IFIP-TC">IFIP TC 2: Software:Theory and Practice</idno>
            <idno type="stamp" n="IFIP-WG2-2">WG2-2: Formal Description of Programming Concepts</idno>
            <idno type="stamp" n="IFIP-FSEN">IFIP-FSEN</idno>
            <idno type="stamp" n="IFIP-LNCS-8161">Fundamentals of Software Engineering</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="1">Yes</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">Push-Down Automata with Gap-Order Constraints</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Parosh</forename>
                    <forename type="middle">Aziz</forename>
                    <surname>Abdulla</surname>
                  </persName>
                  <email type="md5">c6aee7dbef032bfa43f3d75352bbfc8d</email>
                  <email type="domain">it.uu.se</email>
                  <idno type="idhal" notation="numeric">1007031</idno>
                  <idno type="halauthorid" notation="string">1104439-1007031</idno>
                  <affiliation ref="#struct-50873"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Mohamed</forename>
                    <forename type="middle">Faouzi</forename>
                    <surname>Atig</surname>
                  </persName>
                  <email type="md5">d7b5ffa8225aca907fe0cfb46490625f</email>
                  <email type="domain">it.uu.se</email>
                  <idno type="idhal" notation="numeric">998103</idno>
                  <idno type="halauthorid" notation="string">1104440-998103</idno>
                  <affiliation ref="#struct-50873"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Giorgio</forename>
                    <surname>Delzanno</surname>
                  </persName>
                  <email type="md5">ddc459b86c26b2adb58a5989c6cf8bd5</email>
                  <email type="domain">disi.unige.it</email>
                  <idno type="idhal" notation="numeric">966688</idno>
                  <idno type="halauthorid" notation="string">167785-966688</idno>
                  <affiliation ref="#struct-302889"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Andreas</forename>
                    <surname>Podelski</surname>
                  </persName>
                  <email type="md5">f50eac0b7dce5cf155dec007f04d87ac</email>
                  <email type="domain">informatik.uni-freiburg.de</email>
                  <idno type="idhal" notation="numeric">1007032</idno>
                  <idno type="halauthorid" notation="string">509148-1007032</idno>
                  <affiliation ref="#struct-449355"/>
                </author>
              </analytic>
              <monogr>
                <title level="m">Lecture Notes in Computer Science</title>
                <meeting>
                  <title>5th International Conference on Fundamentals of Software Engineering (FSEN)</title>
                  <date type="start">2013-04-24</date>
                  <date type="end">2013-04-26</date>
                  <settlement>Tehran</settlement>
                  <country key="IR">Iran</country>
                </meeting>
                <editor>Farhad Arbab</editor>
                <editor>Marjan Sirjani</editor>
                <imprint>
                  <publisher>Springer Berlin Heidelberg</publisher>
                  <biblScope unit="serie">Fundamentals of Software Engineering</biblScope>
                  <biblScope unit="volume">LNCS-8161</biblScope>
                  <biblScope unit="pp">199-216</biblScope>
                  <date type="datePub">2013</date>
                </imprint>
              </monogr>
              <idno type="doi">10.1007/978-3-642-40213-5_13</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <classCode scheme="halDomain" n="info">Computer Science [cs]</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 consider push-down automata with data (Pdad) that operate on variables ranging over the set of natural numbers. The conditions on variables are defined via gap-order constraint. Gap-order constraints allow to compare variables for equality, or to check that the gap between the values of two variables exceeds a given natural number. The messages inside the stack are equipped with values that are natural numbers reflecting their “values”. When a message is pushed to the stack, its value may be defined by a variable in the program. When a message is popped, its value may be copied to a variable. Thus, we obtain a system that is infinite in two dimensions, namely we have a stack that may contain an unbounded number of messages each of which is equipped with a natural number. We present an algorithm for solving the control state reachability problem for Pdad based on two steps. We first provide a translation to the corresponding problem for context-free grammars with data (Cfgd). Then, we use ideas from the framework of well quasi-orderings in order to obtain an algorithm for solving the reachability problem for Cfgds.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="institution" xml:id="struct-50873" status="VALID">
          <idno type="IdRef">026431661</idno>
          <idno type="ROR">https://ror.org/048a87296</idno>
          <orgName>Uppsala University</orgName>
          <desc>
            <address>
              <addrLine>Box 256, SE-751 05 Uppsala</addrLine>
              <country key="SE"/>
            </address>
            <ref type="url">http://www.uu.se/en/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-302889" status="VALID">
          <idno type="IdRef">032054262</idno>
          <idno type="ROR">https://ror.org/0107c5v14</idno>
          <idno type="Wikidata">032054262</idno>
          <orgName>Università degli studi di Genova = University of Genoa = Université de Gênes</orgName>
          <orgName type="acronym">UniGe</orgName>
          <desc>
            <address>
              <addrLine>Via Balbi, 5 - 16126 Genova</addrLine>
              <country key="IT"/>
            </address>
            <ref type="url">https://unige.it/it</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-449355" status="INCOMING">
          <orgName>University of Freiburg</orgName>
          <desc>
            <address>
              <country key="DE"/>
            </address>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>