SAT 2015: Early Registration Ends Soon! Student Grants Available!

The International Conference on Theory and Applications of Satisfiability Testing, SAT 2015 will take place in Austin, Texas, USA, September 24-27, 2015.


Early registration for both the conference and workshops is available through August 23rd, 2015.

Register soon! After August 23rd, prices will go up!

The reserved hotel blocks are also filling up fast. Book your room soon to ensure availability!

Conference page: Registration: Lodging:


A limited number of student travel support grants of up to 600 Euro per person are available from the SAT Association. Applicants should acquire a letter of support from their advisor and prepare a statement detailing why the travel support is needed. This information should be emailed to the SAT’15 conference chairs at by August 31st, 2015. Determinations will be made shortly thereafter.


The conference schedule is now posted online. It can be found here:


Dimitris Achlioptas (UC Santa Cruz): Random Formulas are Irrelevant, Right? Anna Slobodova (Centaur Technology): Pragmatic Approach to Formal Verification Aaron Tomb (Galois, Inc.): Applying Satisfiability to the Analysis of Cryptography


SAT Race: Max-SAT Evaluation: Pseudo-Boolean Evaluation:


Isil Dillig, The University of Texas at Austin, United States Priyank Kalla, University of Utah, United States Andre Platzer, Carnegie Mellon University, United States Roderick Bloem, Graz University of Technology, Austria


Pragmatics of Satisfiability: Workshop on Quantified Boolean Formulas:


SAT Workshops: September 23, 2015 SAT Regular Program: September 24-26, 2015 SAT Tutorial Day: September 27, 2015 (joint with DIFTS and FMCAD)


MEMOCODE conference: September 21-23, 2015 FMCAD conference: September 27-30, 2015 DIFTS workshop: September 26-27, 2015 ACL2 workshop: October 01-02, 2015


The SAT conference is the premier annual meeting for researchers focusing on the theory and applications of the propositional satisfiability problem, broadly construed. Aside from plain propositional satisfiability, the scope of the meeting includes Boolean optimization (including MaxSAT and Pseudo-Boolean (PB) constraints), Quantified Boolean Formulas (QBF), Satisfiability Modulo Theories (SMT), and Constraint Programming (CP) for problems with clear connections to Boolean-level reasoning.

Many hard combinatorial problems can be tackled using SAT-based techniques, including problems that arise in Formal Verification, Artificial Intelligence, Operations Research, Computational Biology, Cryptology, Data Mining, Machine Learning, Mathematics, et cetera. Indeed, the theoretical and practical advances in SAT research over the past twenty years have contributed to making SAT technology an indispensable tool in a variety of domains.


Chairs: Marijn Heule, The University of Texas at Austin, United States Sean Weaver, Trusted Systems Research Group, United States

Workshop Chair: Albert Oliveras, Technical University of Catalonia, Spain

Tutorial Chairs: Malay Ganai, Atrenta, United States Chao Wang, Virginia Tech, United States