<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>20th International Workshop SMT 2022 Proceedings</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Haifa</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Israel</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>David Déharbe</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Antti E. J. Hyvärinen</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>On Satisfiability of Polynomial Equations over Large Prime Fields Joseph Scott</institution>
          ,
          <addr-line>Guanting Pan, Elias B. Khalil, Vijay Ganesh</addr-line>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2022</year>
      </pub-date>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>(editors)
SMT 2022: Satisfiability Modulo Theories, August 11–12, 2022, Haifa, Israel
© 2022 Copyright for the individual papers by the papers’ authors. Copyright for the volume as a collection by its editors. This volume and its papers are
published under the Creative Commons License Attribution 4.0 International (CC BY 4.0).</p>
      <p>CPWrEooUrckResehdoinpgs IhStpN:/c1e6u1r3-w-0s.o7r3g CEUR Workshop Proceedings (CEUR-WS.org)
The International Workshop on Satisfiability Modulo Theories is an annual event dedicated
to Satisfiability Modulo Theories (SMT). The 20th edition of the SMT workshop was held in
Haifa, Israel, on August 11th and 12th in association with the International Joint Conference on
Automated Reasoning 2022 (IJCAR 2022), as part of the 8th Federated Logic Conference (FLoC
2022).</p>
      <p>Determining the satisfiability of first-order formulas modulo background theories, known
as the Satisfiability Modulo Theories problem, has proved to be an enabling technology for
verification, synthesis, test generation, compiler optimization, scheduling, and other areas.
The success of SMT techniques depends on the development of both domain-specific decision
procedures for each background theory (e.g., linear arithmetic, the theory of arrays, or the
theory of bit-vectors) and combination methods that allow one to obtain more versatile SMT
tools, usually leveraging Boolean satisfiability (SAT) solvers. These ingredients together make
SMT techniques well-suited for use in larger automated reasoning and verification eforts.</p>
      <p>The aim of the workshop is to bring together researchers and users of SMT tools and
techniques. Relevant topics include but are not limited to:
• Decision procedures and theories of interest
• Combinations of decision procedures
• Novel implementation techniques
• Benchmarks and evaluation methodologies
• Applications and case studies
• Theoretical results</p>
      <p>SMT 2022 featured an invited talk by Aina Niemetz from Stanford University, a panel
discussion, and the presentation of 14 peer-reviewed papers, along with a discussion on SMT
proofs and a competitive event. The workshop received 15 paper submissions, out of which 14
were accepted. Each submission was reviewed by three program committee members. Of the
14 accepted submissions, four were accepted as regular papers, and six as extended abstracts.
The remaining five contributions were submitted to the workshop for presentation only. The
authors of one of these presentations agreed to include the abstract of their talk into these
proceedings.</p>
      <p>We would like to thank the program committee, the subreviewers, the authors, the invited
speaker, the panelists, the SMT competition organisers and participants, and the SMT Steering
Committee for their contributions to the workshop. We thank Alexander Nadel and Aina
Niemetz, the chairs of SMT 2021 for their valuable advice in organising the workshop. We would
further like to thank the IJCAR and FLoC organizers for hosting the workshop, EasyChair for
the availability of their conference system, and CEUR for their help to publish these proceedings.</p>
      <p>SMT 2022 was sponsored by AdaCore, Ethereum Foundation, Informal Systems, and Runtime</p>
    </sec>
    <sec id="sec-2">
      <title>Verification. We are grateful for their generosity in supporting the workshop.</title>
    </sec>
    <sec id="sec-3">
      <title>David Déharbe and Antti Hyvärinen</title>
    </sec>
    <sec id="sec-4">
      <title>Co-chairs, SMT 2022</title>
      <sec id="sec-4-1">
        <title>Program Committee</title>
        <p>David Déharbe, CLEARSY</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>Antti Hyvärinen, Università della Svizzera italiana</title>
    </sec>
    <sec id="sec-6">
      <title>Leonardo Alt, Ethereum Foundation</title>
    </sec>
    <sec id="sec-7">
      <title>Haniel Barbosa, Universidade Federal de Minas Gerais</title>
    </sec>
    <sec id="sec-8">
      <title>Nikolaj Bjørner, Microsoft Research</title>
    </sec>
    <sec id="sec-9">
      <title>Maria Paola Bonacina, Università degli Studi di Verona</title>
    </sec>
    <sec id="sec-10">
      <title>Martin Bromberger, Max-Planck Institut für Informatik</title>
    </sec>
    <sec id="sec-11">
      <title>Rayna Dimitrova, CISPA Helmholtz Center for Information Security</title>
    </sec>
    <sec id="sec-12">
      <title>Pascal Fontaine, Université de Liège</title>
      <p>Stéphane Graham-Lengrand, SRI International</p>
    </sec>
    <sec id="sec-13">
      <title>Liana Hadarean, Amazon Web Services</title>
    </sec>
    <sec id="sec-14">
      <title>Jochen Hoenicke, University of Freiburg</title>
    </sec>
    <sec id="sec-15">
      <title>Chantal Keller, Université Paris-Saclay</title>
    </sec>
    <sec id="sec-16">
      <title>Igor Konnov, Informal Systems Austria</title>
    </sec>
    <sec id="sec-17">
      <title>Matteo Marescotti, Meta Platforms, UK</title>
    </sec>
    <sec id="sec-18">
      <title>Aina Niemetz, Stanford University</title>
    </sec>
    <sec id="sec-19">
      <title>Elizabeth Polgreen, University of Edinburgh</title>
    </sec>
    <sec id="sec-20">
      <title>Mathias Preiner, Stanford University</title>
    </sec>
    <sec id="sec-21">
      <title>Andrew Reynolds, University of Iowa</title>
    </sec>
    <sec id="sec-22">
      <title>Tanja Schindler, University of Freiburg</title>
    </sec>
    <sec id="sec-23">
      <title>Sophie Tourret, Inria and MPI for Informatics</title>
    </sec>
    <sec id="sec-24">
      <title>Yoni Zohar, Bar Ilan University</title>
      <sec id="sec-24-1">
        <title>Subreviewers</title>
      </sec>
    </sec>
    <sec id="sec-25">
      <title>Hans-Jörg Schurr, Université de Lorraine</title>
    </sec>
    <sec id="sec-26">
      <title>Alex Ozdemir, Stanford University</title>
      <sec id="sec-26-1">
        <title>Invited Talks</title>
        <p>Invited Talk: Local Search for Bit-Precise Reasoning and Beyond</p>
        <p>Aina Niemetz</p>
      </sec>
      <sec id="sec-26-2">
        <title>Regular Papers</title>
        <p>Trail Saving in SMT</p>
        <p>Milan Banković, David Šćepanović
A Simple Proof Format for SMT</p>
        <p>Jochen Hoenicke, Tanja Schindler</p>
      </sec>
      <sec id="sec-26-3">
        <title>Extended Abstracts</title>
        <p>CDSAT for Nondisjoint Theories with Shared Predicates: Arrays With Abstract</p>
        <p>Length</p>
        <p>Maria Paola Bonacina, Stéphane Graham-Lengrand, Natarajan Shankar
38
54
71
80
90
99
114
128</p>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>18</mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>