- Abstracts requested:
April 19, 2019May 3, 2019 - Submission deadline:
April 26, 2019May 3, 2019 - Notification:
May 31, 2019June 7, 2019 - Workshop: July 7-8, 2019
Important Dates
Scope and Topics of Interest
Background
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, 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 efforts.
Aims and Scope
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
More information about the SMT workshop series can be found on The International Workshop on Satisfiability Modulo Theories Website. Information about the SMT Competition can be found on the competition website.