SMT 2012. 10th International Workshop on Satisfiability Modulo Theories15 articles•142 pages•Published: August 19, 2013 PapersPage 1 | Page 2 | Pages 3-11 | Pages 12-21 | Pages 22-31 | Pages 32-43 | Pages 44-56 | Pages 57-66 | Pages 67-76 | Pages 77-87 | Pages 88-97 | Pages 98-108 | Pages 109-119 | Pages 120-130 | Pages 131-142 |
Keyphrasesarithmetic, axiomatic theory, bit-precise reasoning, bit-vector logics, bitvectors, complexity, Configuration, copy, decision procedure2, exotic semi-rings, floating-point, High-level modeling, Instantiation, integers, machine learning, Mapping, memcpy, memmove, memset, model checking, NEXPTIME, order encoding, Presburger arithmetic, product lines, program verification, quantifier elimination, quantifiers, Reachability Modulo Theories, real arithmetic, regular expressions, SAT encodings, satisfiability, satisfiability module theories, SET, simplex, SMT11, SMT Competition, SMT solver, SMT-COMP, SMT-evaluation, SMT-IDL, SMT-LIA, SMT-LIB2, Statistical Hardness models, STP, strings, symbolic model checking, system description languages, theories2, Theory of Arrays, transition systems, triggers, TVL, variability, verification |
|