2014 for the individual papers
by the papers' authors. Copying permitted only for private and academic purposes.
This volume is published and copyrighted by its editors.
Satisfiability Modulo Theories
Proceedings of the 12th International Workshop on Satisfiability Modulo Theories
the 26th International Conference on Computer Aided Verification
the 7th International Joint Conference on Automated Reasoning
the 17th International Conference on Theory and Applications
of Satisfiability Testing
Vienna, Austria, July 17-18, 2014.
* Uppsala University, Uppsala, Sweden
** Microsoft Research
Table of Contents
Philipp Rümmer, Christoph M. Wintersteiger
SMT: Where do we go from here?
Speeding Up SMT-Based Quantitative Program Analysis
Daniel J. Fremont, Sanjit A. Seshia
Multi-solver Support in Symbolic Execution
Hristina Palikareva, Cristian Cadar
Protocol Log Analysis with Constraint Programming
Mats Carlsson, Olga Grinchtein, Justin Pearson
Reasoning About Set Comprehensions
Edmund S. L. Lam, Iliano Cervesato
Weakly Equivalent Arrays
Juergen Christ, Jochen Hoenicke
Decision Procedures for Flat Array Properties
Francesco Alberti, Silvio Ghilardi, Natasha Sharygina
Extending SMT-LIB v2 with λ-Terms and Polymorphism
Richard Bonichon, David Déharbe, Cláudia Tavares
Automating the Verification of Floating-Point Algorithms
Leveraging Linear and Mixed Integer Programming for SMT
Tim King, Clark Barrett, Cesare Tinelli
raSAT: SMT for Polynomial Inequality
To Van Khanh, Vu Xuan Tung, Mizuhito Ogawa
Better Answers to Real Questions
Marek Kosta, Thomas Sturm, Andreas Dolzmann
Towards Conflict-Driven Learning for Virtual Substitution
Konstantin Korovin, Marek Kosta, Thomas Sturm
The whole proceedings can also be downloaded as a single file (PDF, including title pages, preface, and table of contents).
We offer a BibTeX file for citing papers of this workshop from LaTeX.
2014-06-27: submitted by Christoph M. Wintersteiger
2014-06-29: published on CEUR-WS.org