<!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>Satisfiability Modulo Theories - 19th International Workshop SMT 2021</article-title>
      </title-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>Proceedings
©2021 Copyright for the individual papers by their authors. Copyright for the volume
as a collection by its editors. Use permitted under Creative Commons License Attribution 4.0
International (CC BY 4.0).</p>
      <p>CPWrEooUrckResehdoinpgs IhStSpN:/c1e6u1r3-w-0s0.o7r3g CEUR Workshop Proceedings (CEUR-WS.org)
The 19th International Workshop on Satisfiability Modulo Theories was held on July 18th and
19th in association with the 33rd International Conference on Computer Aided Verification.
The workshop had originally been scheduled to take place in Los Angeles, USA, but was held
online as a virtual meeting due to the COVID-19 pandemic and its repercussions.</p>
      <p>The SMT workshop is an annual event dedicated to Satisfiability Modulo Theories (SMT).</p>
      <p>Determining the satisfiability of first-order formulas modulo background theories, known as
the Satisfiability Modulo Theories (SMT) problem, has proved to be an enabling technology for
verification, test-vector generation, compiler optimization, scheduling, and other areas.</p>
      <p>The success of SMT techniques depends on the development of both domain-specific decision
procedures for each concrete 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.
These two ingredients together make SMT techniques well-suited for use in larger automated
reasoning and formal verification eforts.</p>
      <p>The workshop aims at bringing 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 2021 featured invited talks by Guy Katz from the University of Jerusalem and Karem
A. Sakallah from the University of Michigan, and the presentation of 14 peer-reviewed papers.
The workshop received 16 submissions, out of which 14 were accepted. Each submission
was reviewed by three program committee members. Of the 14 accepted submissions, six are
published in this volume: two as original papers, and four as extended abstracts. The remaining
eight were submitted to the workshop for presentation only. For two of them, the authors
agreed to include the paper abstracts in this volume.</p>
      <p>We would like to thank the program commitee, the authors, the invited speakers and the SMT
Steering Committee for their contributions to the workshop. We would further like to thank
the CAV organizers for hosting the workshop, EasyChair for the availability of their conference
system, and CEUR for their help to publish these proceedings.</p>
      <p>Alexander Nadel and Aina Niemetz
Co-chairs, SMT 2021
Program Committee
Alexander Nadel, Intel
Aina Niemetz, Stanford University</p>
    </sec>
    <sec id="sec-2">
      <title>Regular Papers</title>
    </sec>
    <sec id="sec-3">
      <title>Presentation-Only Papers (Abstracts)</title>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1 2
          <string-name>
            <given-names>Proof</given-names>
            <surname>Tree</surname>
          </string-name>
          <article-title>Preserving Sequence Interpolation of Quantified Formulas in the Theory of</article-title>
          <string-name>
            <given-names>Equality . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Elisabeth</given-names>
            <surname>Henkel</surname>
          </string-name>
          , Jochen Hoenicke and Tanja Schindler
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          <article-title>40 Reliable Reconstruction of Fine-Grained Proofs in a Proof Assistant</article-title>
          . . . . . . . . .
          <string-name>
            <surname>Hans-Jörg</surname>
            <given-names>Schurr</given-names>
          </string-name>
          , Mathias Fleury and Martin Desharnais
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>