[TYPES/announce] SAT 2015: Call for participation, 24-27 September, Austin

[Sean Weaver]

CALL FOR PARTICIPATION

International Conference on Theory and Applications of Satisfiability
Testing, SAT 2015
Austin, Texas, USA, September 24-27, 2015

*** Early Registration until August 23, 2015 ***

Conference page:   http://www.cs.utexas.edu/~marijn/sat15/index.html
Accepted papers:   http://www.cs.utexas.edu/~marijn/sat15/index.html#papers
Registration page: http://www.regonline.com/sat15

INVITED TALKS

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

COMPETITIVE EVENTS

SAT Race: http://baldur.iti.kit.edu/sat-race-2015/
Max-SAT Evaluation: http://maxsat.ia.udl.cat/
Pseudo-Boolean Evaluation: http://pbeva.computational-logic.org/

TUTORIALS

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

WORKSHOPS

Pragmatics of Satisfiability: http://www.pragmaticsofsat.org/2015/
Workshop on Quantified Boolean Formulas: http://fmv.jku.at/qbf15/

IMPORTANT EVENT DATES

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

CO-LOCATED EVENTS

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

CONFERENCE SCOPE

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.

SAT 2015 ORGANIZATION

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