Abstract is missing.
- Practical Aspects of SAT SolvingArmin Biere. 1 [doi]
- The Architecture of Inference from SMT to ETBNatarajan Shankar. 2 [doi]
- Program Verification as Satisfiability Modulo TheoriesNikolaj Bjørner, Kenneth L. McMillan, Andrey Rybalchenko. 3-11 [doi]
- Built-in Treatment of an Axiomatic Floating-Point Theory for SMT SolversSylvain Conchon, Guillaume Melquiond, Cody Roux, Mohamed Iguernelala. 12-21 [doi]
- Reasoning with TriggersClaire Dross, Sylvain Conchon, Johannes Kanig, Andrei Paskevich. 22-31 [doi]
- SMT-Based System Verification with DVFAmit Goel, Sava Krstic, Rebekah Leslie, Mark R. Tuttle. 32-43 [doi]
- On the Complexity of Fixed-Size Bit-Vector Logics with Binary Encoded Bit-WidthGergely Kovásznai, Andreas Fröhlich, Armin Biere. 44-56 [doi]
- A Machine Learning Technique for Hardness Estimation of QFBV SMT ProblemsMohammad Abdul Aziz, Amr G. Wassal, Nevin M. Darwish. 57-66 [doi]
- Reachability Modulo Theory LibraryFrancesco Alberti, Roberto Bruttomesso, Silvio Ghilardi, Silvio Ranise, Natasha Sharygina. 67-76 [doi]
- SMT-LIB Sequences and Regular ExpressionsNikolaj Bjørner, Vijay Ganesh, Raphaël Michel, Margus Veanes. 77-87 [doi]
- Exotic Semi-Ring ConstraintsMichael Codish, Yoav Fekete, Carsten Fuhs, Jürgen Giesl, Johannes Waldmann. 88-97 [doi]
- A Theory of Arrays with set and copy OperationsStephan Falke, Carsten Sinz, Florian Merz. 98-108 [doi]
- An SMT-based approach to automated configurationRaphaël Michel, Arnaud Hubaux, Vijay Ganesh, Patrick Heymans. 109-119 [doi]
- Anatomy of Alternating Quantifier Satisfiability (Work in progress)Anh-Dung Phan, Nikolaj Bjørner, David Monniaux. 120-130 [doi]
- The 2012 SMT CompetitionDavid R. Cok, Alberto Griggio, Roberto Bruttomesso, Morgan Deters. 131-142 [doi]