<?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-02093520</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-21T13:24:08+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Modular and Efficient Divide-and-Conquer SAT Solver on Top of the Painless Framework</title>
            <author role="aut">
              <persName>
                <forename type="first">Ludovic</forename>
                <surname>Le Frioux</surname>
              </persName>
              <idno type="halauthorid">1182553-0</idno>
              <affiliation ref="#struct-541717"/>
              <affiliation ref="#struct-10947"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Souheib</forename>
                <surname>Baarir</surname>
              </persName>
              <email type="md5">db8f12c6ee84295c784d957461c9fda6</email>
              <email type="domain">lip6.fr</email>
              <idno type="idhal" notation="numeric">961876</idno>
              <idno type="halauthorid" notation="string">686508-961876</idno>
              <idno type="ORCID">https://orcid.org/0000-0001-8140-0273</idno>
              <idno type="IDREF">https://www.idref.fr/147205336</idno>
              <idno type="VIAF">https://viaf.org/viaf/189805824</idno>
              <affiliation ref="#struct-116205"/>
              <affiliation ref="#struct-541717"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Julien</forename>
                <surname>Sopena</surname>
              </persName>
              <email type="md5">44e6851877e5a5e7293d7c4c648b4d3e</email>
              <email type="domain">lip6.fr</email>
              <idno type="idhal" notation="string">julien-sopena</idno>
              <idno type="idhal" notation="numeric">743742</idno>
              <idno type="halauthorid" notation="string">48644-743742</idno>
              <idno type="IDREF">https://www.idref.fr/139161465</idno>
              <idno type="ORCID">https://orcid.org/0009-0006-6597-0704</idno>
              <affiliation ref="#struct-541722"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Fabrice</forename>
                <surname>Kordon</surname>
              </persName>
              <email type="md5">c31b42c685f457d01a9fb6a6d448fd9d</email>
              <email type="domain">lip6.fr</email>
              <idno type="idhal" notation="string">fabrice-kordon</idno>
              <idno type="idhal" notation="numeric">9774</idno>
              <idno type="halauthorid" notation="string">7750-9774</idno>
              <idno type="ORCID">https://orcid.org/0000-0002-5626-828X</idno>
              <idno type="IDREF">https://www.idref.fr/074605283</idno>
              <idno type="VIAF">https://viaf.org/viaf/55088809</idno>
              <affiliation ref="#struct-541717"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Fabrice</forename>
                <surname>Kordon</surname>
              </persName>
              <email type="md5">c31b42c685f457d01a9fb6a6d448fd9d</email>
              <email type="domain">lip6.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2019-04-09 08:52:07</date>
              <date type="whenModified">2025-07-22 08:34:02</date>
              <date type="whenReleased">2019-04-09 08:52:07</date>
              <date type="whenProduced">2019-04-06</date>
              <ref type="externalLink" target="https://link.springer.com/content/pdf/10.1007%2F978-3-030-17462-0_8.pdf"/>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="151582">
                <persName>
                  <forename>Fabrice</forename>
                  <surname>Kordon</surname>
                </persName>
                <email type="md5">c31b42c685f457d01a9fb6a6d448fd9d</email>
                <email type="domain">lip6.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-02093520</idno>
            <idno type="halUri">https://hal.science/hal-02093520</idno>
            <idno type="halBibtex">lefrioux:hal-02093520</idno>
            <idno type="halRefHtml">&lt;i&gt;TACAS 2019 - 25th International Conference on Tools and Algorithms for the Construction and Analysis of Systems&lt;/i&gt;, Apr 2019, Prague, Czech Republic. pp.135-151, &lt;a target="_blank" href="https://dx.doi.org/10.1007/978-3-030-17462-0_8"&gt;&amp;#x27E8;10.1007/978-3-030-17462-0_8&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">TACAS 2019 - 25th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Apr 2019, Prague, Czech Republic. pp.135-151, &amp;#x27E8;10.1007/978-3-030-17462-0_8&amp;#x27E9;</idno>
            <availability status="restricted"/>
          </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="UNIV-PARIS10" corresp="UNIV-PARIS-LUMIERES">Université Paris Nanterre</idno>
            <idno type="stamp" n="INRIA-ROCQ">INRIA Paris - Rocquencourt</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="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="UNIV-PARIS-LUMIERES"/>
            <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="UNIV-PARIS-NANTERRE" corresp="UNIV-PARIS-LUMIERES">Université Paris Nanterre</idno>
            <idno type="stamp" n="ALLIANCE-SU"> Alliance Sorbonne Université</idno>
            <idno type="stamp" n="SUPRA_MATHS_INFO">Mathématiques + Informatique</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">Modular and Efficient Divide-and-Conquer SAT Solver on Top of the Painless Framework</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Ludovic</forename>
                    <surname>Le Frioux</surname>
                  </persName>
                  <idno type="halauthorid">1182553-0</idno>
                  <affiliation ref="#struct-541717"/>
                  <affiliation ref="#struct-10947"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Souheib</forename>
                    <surname>Baarir</surname>
                  </persName>
                  <email type="md5">db8f12c6ee84295c784d957461c9fda6</email>
                  <email type="domain">lip6.fr</email>
                  <idno type="idhal" notation="numeric">961876</idno>
                  <idno type="halauthorid" notation="string">686508-961876</idno>
                  <idno type="ORCID">https://orcid.org/0000-0001-8140-0273</idno>
                  <idno type="IDREF">https://www.idref.fr/147205336</idno>
                  <idno type="VIAF">https://viaf.org/viaf/189805824</idno>
                  <affiliation ref="#struct-116205"/>
                  <affiliation ref="#struct-541717"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Julien</forename>
                    <surname>Sopena</surname>
                  </persName>
                  <email type="md5">44e6851877e5a5e7293d7c4c648b4d3e</email>
                  <email type="domain">lip6.fr</email>
                  <idno type="idhal" notation="string">julien-sopena</idno>
                  <idno type="idhal" notation="numeric">743742</idno>
                  <idno type="halauthorid" notation="string">48644-743742</idno>
                  <idno type="IDREF">https://www.idref.fr/139161465</idno>
                  <idno type="ORCID">https://orcid.org/0009-0006-6597-0704</idno>
                  <affiliation ref="#struct-541722"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Fabrice</forename>
                    <surname>Kordon</surname>
                  </persName>
                  <email type="md5">c31b42c685f457d01a9fb6a6d448fd9d</email>
                  <email type="domain">lip6.fr</email>
                  <idno type="idhal" notation="string">fabrice-kordon</idno>
                  <idno type="idhal" notation="numeric">9774</idno>
                  <idno type="halauthorid" notation="string">7750-9774</idno>
                  <idno type="ORCID">https://orcid.org/0000-0002-5626-828X</idno>
                  <idno type="IDREF">https://www.idref.fr/074605283</idno>
                  <idno type="VIAF">https://viaf.org/viaf/55088809</idno>
                  <affiliation ref="#struct-541717"/>
                </author>
              </analytic>
              <monogr>
                <meeting>
                  <title>TACAS 2019 - 25th International Conference on Tools and Algorithms for the Construction and Analysis of Systems</title>
                  <date type="start">2019-04-06</date>
                  <date type="end">2019-04-11</date>
                  <settlement>Prague</settlement>
                  <country key="CZ">Czech Republic</country>
                </meeting>
                <editor>Tomáš Vojnar</editor>
                <editor>Lijun Zhang</editor>
                <imprint>
                  <biblScope unit="serie">Lecture Notes in Computer Science</biblScope>
                  <biblScope unit="volume">11427</biblScope>
                  <biblScope unit="pp">135-151</biblScope>
                  <date type="datePub">2019-04-04</date>
                </imprint>
              </monogr>
              <idno type="doi">10.1007/978-3-030-17462-0_8</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">Tool</term>
                <term xml:lang="en">SAT solver</term>
                <term xml:lang="en">Parallel satisfiability</term>
                <term xml:lang="en">Divide-and-conquer</term>
              </keywords>
              <classCode scheme="halDomain" n="info.info-se">Computer Science [cs]/Software Engineering [cs.SE]</classCode>
              <classCode scheme="halDomain" n="info.info-es">Computer Science [cs]/Embedded Systems</classCode>
              <classCode scheme="halDomain" n="info.info-fl">Computer Science [cs]/Formal Languages and Automata Theory [cs.FL]</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>Over the last decade, parallel SATisfiability solving has been widely studied from both theoretical and practical aspects. There are two main approaches. First, divide-and-conquer (D&amp;C) splits the search space, each solver being in charge of a particular subspace. The second one, portfolio launches multiple solvers in parallel, and the first to find a solution ends the computation. However although D&amp;C based approaches seem to be the natural way to work in parallel, portfolio ones experimentally provide better performances. An explanation resides on the difficulties to use the native formulation of the SAT problem (i.e., the CNF form) to compute an apriori good search space partitioning (i.e.,all parallel solvers process their sub-spaces in comparable computational time). To avoid this, dynamic load balancing of the search subspaces is implemented. Unfortunately, this isdifficult to compare load balancing strategies since state-of-the-art SAT solvers appropriately dealing with these aspects are hardly adaptable tovarious strategies than the ones they have been designed for. This paper aims at providing a way to overcome this problem by proposing an implementation and evaluation of different types of divide-and-conquer  inspired  from  the  literature.  These  are  relying  on  thePainless framework, which provides concurrent facilities to elaborate such parallel SAT solvers. Comparison of the various strategies are thendiscussed.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="researchteam" xml:id="struct-541717" status="VALID">
          <orgName>Modélisation et Vérification</orgName>
          <orgName type="acronym">MoVe</orgName>
          <date type="start">2018-01-01</date>
          <desc>
            <address>
              <country key="FR"/>
            </address>
          </desc>
          <listRelation>
            <relation active="#struct-541703" type="direct"/>
            <relation active="#struct-413221" type="indirect"/>
            <relation name="UMR7606" active="#struct-441569" type="indirect"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-10947" status="OLD">
          <orgName>Laboratoire de Recherche et de Développement de l'EPITA</orgName>
          <orgName type="acronym">LRDE</orgName>
          <date type="end">2022-08-31</date>
          <desc>
            <address>
              <addrLine>LRDE, EPITA 14-16, rue Voltaire F-94276 Le Kremlin Bicêtre cedex France</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.lrde.epita.fr</ref>
          </desc>
          <listRelation>
            <relation active="#struct-305456" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-116205" status="VALID">
          <idno type="IdRef">026403587</idno>
          <idno type="ROR">https://ror.org/013bkhk48</idno>
          <orgName>Université Paris Nanterre</orgName>
          <orgName type="acronym">UPN</orgName>
          <date type="start">1970-01-01</date>
          <desc>
            <address>
              <addrLine>200 avenue de la République - 92001 Nanterre cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.parisnanterre.fr</ref>
          </desc>
        </org>
        <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="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="institution" xml:id="struct-305456" status="VALID">
          <orgName>Ecole Pour l'Informatique et les Techniques Avancées</orgName>
          <orgName type="acronym">EPITA</orgName>
          <date type="start">2016-11-23</date>
          <desc>
            <address>
              <country key="FR"/>
            </address>
          </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>
      </listOrg>
    </back>
  </text>
</TEI>