<?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-01257239</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-03T07:15:47+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Polyhedral AST generation is more than scanning polyhedra</title>
            <author role="aut">
              <persName>
                <forename type="first">Sven</forename>
                <surname>Verdoolaege</surname>
              </persName>
              <idno type="halauthorid">480115-0</idno>
              <affiliation ref="#struct-155688"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Tobias</forename>
                <surname>Grosser</surname>
              </persName>
              <idno type="halauthorid">409232-0</idno>
              <affiliation ref="#struct-155688"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Albert</forename>
                <surname>Cohen</surname>
              </persName>
              <email type="md5">0fd09e2732b1d397469038c52354ebe2</email>
              <email type="domain">gmail.com</email>
              <idno type="idhal" notation="string">acohen</idno>
              <idno type="idhal" notation="numeric">6894</idno>
              <idno type="halauthorid" notation="string">1512-6894</idno>
              <idno type="ORCID">https://orcid.org/0000-0002-8866-5343</idno>
              <idno type="IDREF">https://www.idref.fr/067155898</idno>
              <affiliation ref="#struct-155688"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Albert</forename>
                <surname>Cohen</surname>
              </persName>
              <email type="md5">0fd09e2732b1d397469038c52354ebe2</email>
              <email type="domain">gmail.com</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2016-01-16 02:27:45</date>
              <date type="whenModified">2025-10-24 17:38:02</date>
              <date type="whenReleased">2016-01-16 02:27:45</date>
              <date type="whenProduced">2015</date>
              <ref type="externalLink" target="https://lirias.kuleuven.be/bitstream/123456789/497238/1/toplas-astgen.pdf"/>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="111925">
                <persName>
                  <forename>Albert</forename>
                  <surname>Cohen</surname>
                </persName>
                <email type="md5">0fd09e2732b1d397469038c52354ebe2</email>
                <email type="domain">gmail.com</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-01257239</idno>
            <idno type="halUri">https://hal.science/hal-01257239</idno>
            <idno type="halBibtex">verdoolaege:hal-01257239</idno>
            <idno type="halRefHtml">&lt;i&gt;ACM Transactions on Programming Languages and Systems (TOPLAS)&lt;/i&gt;, 2015, 37 (4), &lt;a target="_blank" href="https://dx.doi.org/10.1145/2743016"&gt;&amp;#x27E8;10.1145/2743016&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">ACM Transactions on Programming Languages and Systems (TOPLAS), 2015, 37 (4), &amp;#x27E8;10.1145/2743016&amp;#x27E9;</idno>
            <availability status="restricted"/>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="ENS-PARIS">Ecole Normale Supérieure de Paris</idno>
            <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_TEST">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
            <idno type="stamp" n="TESTALAIN1">TESTALAIN1</idno>
            <idno type="stamp" n="INRIA2">INRIA 2</idno>
            <idno type="stamp" n="PSL">Université Paris sciences et lettres</idno>
            <idno type="stamp" n="INRIA-PSL">INRIA-PSL</idno>
            <idno type="stamp" n="ENS-PSL" corresp="PSL">École normale supérieure - PSL</idno>
            <idno type="stamp" n="DIENS" corresp="ENS-PARIS">Département d'informatique de l'ENS-PSL</idno>
          </seriesStmt>
          <notesStmt>
            <note type="commentary">Original submission, candidate for presentation at PLDI 2016</note>
            <note type="audience" n="2">International</note>
            <note type="popular" n="0">No</note>
            <note type="peer" n="1">Yes</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">Polyhedral AST generation is more than scanning polyhedra</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Sven</forename>
                    <surname>Verdoolaege</surname>
                  </persName>
                  <idno type="halauthorid">480115-0</idno>
                  <affiliation ref="#struct-155688"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Tobias</forename>
                    <surname>Grosser</surname>
                  </persName>
                  <idno type="halauthorid">409232-0</idno>
                  <affiliation ref="#struct-155688"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Albert</forename>
                    <surname>Cohen</surname>
                  </persName>
                  <email type="md5">0fd09e2732b1d397469038c52354ebe2</email>
                  <email type="domain">gmail.com</email>
                  <idno type="idhal" notation="string">acohen</idno>
                  <idno type="idhal" notation="numeric">6894</idno>
                  <idno type="halauthorid" notation="string">1512-6894</idno>
                  <idno type="ORCID">https://orcid.org/0000-0002-8866-5343</idno>
                  <idno type="IDREF">https://www.idref.fr/067155898</idno>
                  <affiliation ref="#struct-155688"/>
                </author>
              </analytic>
              <monogr>
                <idno type="halJournalId" status="VALID">2600</idno>
                <idno type="issn">0164-0925</idno>
                <idno type="eissn">1558-4593</idno>
                <title level="j">ACM Transactions on Programming Languages and Systems (TOPLAS)</title>
                <imprint>
                  <publisher>ACM</publisher>
                  <biblScope unit="volume">37</biblScope>
                  <biblScope unit="issue">4</biblScope>
                  <date type="datePub">2015</date>
                </imprint>
              </monogr>
              <idno type="doi">10.1145/2743016</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <classCode scheme="halDomain" n="info.info-pl">Computer Science [cs]/Programming Languages [cs.PL]</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-es">Computer Science [cs]/Embedded Systems</classCode>
              <classCode scheme="halTypology" n="ART">Journal articles</classCode>
              <classCode scheme="halOldTypology" n="ART">Journal articles</classCode>
              <classCode scheme="halTreeTypology" n="ART">Journal articles</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>mathematical representations such as integer polyhedra have been shown to be useful to precisely analyze computational kernels and to express complex loop transformations. Such transformations rely on abstract syntax tree (AST) generators to convert the mathematical representation back to an imperative program. Such generic AST generators avoid the need to resort to transformation-specific code generators, which may be very costly or technically difficult to develop as transformations become more complex. Existing AST generators have proven their effectiveness, but they hit limitations in more complex scenarios. Specifically, (1) they do not support or may fail to generate control flow for complex transformations using piecewise schedules or mappings involving modulo arithmetic; (2) they offer limited support for the specialization of the generated code exposing compact, straightline, vectorizable kernels with high arithmetic intensity necessary to exploit the peak performance of modern hardware; (3) they offer no support for memory layout transformations; and (4) they provide insufficient control over the AST generation strategy, preventing their application to complex domain-specific optimizations.We present a new AST generation approach that extends classical polyhedral scanning to the full generality of Presburger arithmetic, including existentially quantified variables and piecewise schedules, and introduce new optimizations for the detection of components and shifted strides. Not limiting ourselves to control flow generation, we expose functionality to generate AST expressions from arbitrary piecewise quasi-affine expressions, which enables the use of our AST generator for data-layout transformations. We complement this with support for specialization by polyhedral unrolling, user-directed versioning, and specialization of AST expressions according to the location at which they are generated, and we complete this work with finegrained user control over the AST generation strategies used. Using this generalized idea of AST generation, we present how to implement complex domain-specific transformations without the need to write specialized code generators, but instead relying on a generic AST generator parametrized to a specific problem domain.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="researchteam" xml:id="struct-155688" status="OLD">
          <idno type="IdRef">158093453</idno>
          <idno type="RNSR">201120983P</idno>
          <orgName>Parallélisme de Kahn Synchrone</orgName>
          <orgName type="acronym">Parkas</orgName>
          <date type="end">2015-12-31</date>
          <desc>
            <address>
              <addrLine>Département d'informatique École normale supérieure 45 rue d'Ulm F-75230 Paris Cedex 05</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/equipes/parkas</ref>
          </desc>
          <listRelation>
            <relation active="#struct-25027" type="direct"/>
            <relation active="#struct-59704" type="indirect"/>
            <relation active="#struct-564132" type="indirect"/>
            <relation active="#struct-300009" type="indirect"/>
            <relation name="UMR8548" active="#struct-441569" type="direct"/>
            <relation active="#struct-86790" type="direct"/>
            <relation name="UMR 8548" active="#struct-441569" type="direct"/>
          </listRelation>
        </org>
        <org type="regrouplaboratory" xml:id="struct-25027" status="VALID">
          <idno type="IdRef">148034055</idno>
          <idno type="RNSR">199812876J</idno>
          <idno type="ROR">05y6rqs46</idno>
          <orgName>Département d'informatique - ENS-PSL</orgName>
          <orgName type="acronym">DI-ENS</orgName>
          <date type="start">1999-01-01</date>
          <desc>
            <address>
              <addrLine>École normale supérieure 45 rue d'Ulm F-75230 Paris Cedex 05</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.di.ens.fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-59704" type="direct"/>
            <relation active="#struct-564132" type="indirect"/>
            <relation active="#struct-300009" type="direct"/>
            <relation name="UMR8548" active="#struct-441569" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-59704" status="VALID">
          <idno type="IdRef">031738419</idno>
          <idno type="ISNI">0000000123532622</idno>
          <idno type="ROR">https://ror.org/05a0dhs15</idno>
          <orgName>École normale supérieure - Paris</orgName>
          <orgName type="acronym">ENS-PSL</orgName>
          <date type="start">1985-07-24</date>
          <desc>
            <address>
              <addrLine>45, Rue d'Ulm - 75230 Paris cedex 05</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.ens.psl.eu/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-564132" type="direct"/>
          </listRelation>
        </org>
        <org type="regroupinstitution" xml:id="struct-564132" status="VALID">
          <idno type="IdRef">241597595</idno>
          <idno type="ISNI">0000 0004 1784 3645</idno>
          <idno type="ROR">https://ror.org/013cjyk83</idno>
          <orgName>Université Paris Sciences et Lettres</orgName>
          <orgName type="acronym">PSL</orgName>
          <desc>
            <address>
              <addrLine>60 rue Mazarine 75006 Paris</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.psl.eu/</ref>
          </desc>
        </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="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-86790" status="OLD">
          <orgName>Inria Paris-Rocquencourt</orgName>
          <date type="end">2016-03-30</date>
          <desc>
            <address>
              <addrLine>INRIA Rocquencourt : Domaine de Voluceau, Rocquencourt B.P. 105 78153 le Chesnay Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/centre/paris-rocquencourt</ref>
          </desc>
          <listRelation>
            <relation active="#struct-300009" type="direct"/>
          </listRelation>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>