## Wiki » History » Version 17

*Andrei Tatarnikov, 07/10/2013 05:39 PM *

1 | 1 | Andrei Tatarnikov | h1. Constraint Solver API |
---|---|---|---|

2 | |||

3 | 2 | Andrei Tatarnikov | h2. Basic Concepts |

4 | 1 | Andrei Tatarnikov | |

5 | 2 | Andrei Tatarnikov | Constraint Solver Java API provides a Java API for generating pseudorandom values that satisfy certain constraints. This feature is important for test generators that aim at creating directed tests. At logical level, a constraint is represented by a set of expressions that specify limitations for input values (assertions that must be hold for those values). If there are values satisfying all of the specified assertions they will be used a solution for the constraint. If there is a multitude of values satisfying the constraint, specific values will be selected from the range of possible solutions on random basis. |

6 | |||

7 | 4 | Andrei Tatarnikov | From an implementational point of view, the API represents a wrapper around some kind of an openly distributed SMT solver engine (in the current version, we use the Z3 solver by Microsoft Research). It can be extended to support other solver engines and it provides a possibility to interact with different solver engines in a uniform way. Also, it facilitates creating task-specific custom solvers and extending functionality of existing solver engines by adding custom operations (macros based on built-in operations). |

8 | 2 | Andrei Tatarnikov | |

9 | 3 | Andrei Tatarnikov | h2. SMT-LIB |

10 | 2 | Andrei Tatarnikov | |

11 | In SMT solvers, a special functional language is used to specify constraints. The constraint solver subsystem generates constructions in the SMT language and runs the engine to process them and produce the results (find values of unknown input variables). |
||

12 | |||

13 | 1 | Andrei Tatarnikov | h2. Constraints and SMT |

14 | |||

15 | Constrains specified as an SMT model are represented by a set of assertions (formulas) that must be satisfied. An SMT solver checks the satisfiability of the model and suggests a solution (variable values) that would satisfy the model. In the example below, we specify a model that should help us create a test that will cause a MIPS processor to generate an exception. We want to find values of the rs and rt general purpose registers that will cause the ADD instruction to raise an integer overflow exception. It should be correct 32-bit signed integers that are not equal to each other. Here is an SMT script: |
||

16 | |||

17 | 17 | Andrei Tatarnikov | <pre><code class="lisp"> |

18 | 1 | Andrei Tatarnikov | (define-sort Int_t () (_ BitVec 64)) |

19 | |||

20 | (define-fun INT_ZERO () Int_t (_ bv0 64)) |
||

21 | (define-fun INT_BASE_SIZE () Int_t (_ bv32 64)) |
||

22 | (define-fun INT_SIGN_MASK () Int_t (bvshl (bvnot INT_ZERO) INT_BASE_SIZE)) |
||

23 | |||

24 | (define-fun IsValidPos ((x!1 Int_t)) Bool (ite (= (bvand x!1 INT_SIGN_MASK) INT_ZERO) true false)) |
||

25 | (define-fun IsValidNeg ((x!1 Int_t)) Bool (ite (= (bvand x!1 INT_SIGN_MASK) INT_SIGN_MASK) true false)) |
||

26 | (define-fun IsValidSignedInt ((x!1 Int_t)) Bool (ite (or (IsValidPos x!1) (IsValidNeg x!1)) true false)) |
||

27 | |||

28 | (declare-const rs Int_t) |
||

29 | (declare-const rt Int_t) |
||

30 | |||

31 | ; rt and rs must contain valid sign-extended 32-bit values (bits 63..31 equal) |
||

32 | (assert (IsValidSignedInt rs)) |
||

33 | (assert (IsValidSignedInt rt)) |
||

34 | |||

35 | ; the condition for an overflow: the summation result is not a valid sign-extended 32-bit value |
||

36 | (assert (not (IsValidSignedInt (bvadd rs rt)))) |
||

37 | |||

38 | ; just in case: rs and rt are not equal (to make the results more interesting) |
||

39 | (assert (not (= rs rt))) |
||

40 | |||

41 | (check-sat) |
||

42 | |||

43 | (echo "Values that lead to an overflow:") |
||

44 | (get-value (rs rt)) |
||

45 | 17 | Andrei Tatarnikov | </code></pre> |

46 | 1 | Andrei Tatarnikov | |

47 | 5 | Andrei Tatarnikov | In an ideal case, each run of an SMT solver should return random values from the set of possible solutions. This should improve test coverage. Unfortunately, the current implementation is limited to a single solution that is constant for all run. This should be improved in the final version. |

48 | |||

49 | 9 | Sergey Smolov | h3. SMT Limitations. |

50 | 5 | Andrei Tatarnikov | |

51 | 8 | Andrei Tatarnikov | # *Recursion in not allowed* in SMT-LIB. At least, this applies to the Z3 implementation. In other words, code like provided below is not valid: |

52 | 5 | Andrei Tatarnikov | |

53 | <pre> |
||

54 | (define-fun fact ((x Int)) Int (ite (= x 0) 1 (fact (- x 1)))) |
||

55 | (simplify (fact 10)) |
||

56 | </pre> |
||

57 | 1 | Andrei Tatarnikov | |

58 | 12 | Andrei Tatarnikov | h3. Constraints in XML |

59 | |||

60 | 15 | Andrei Tatarnikov | <pre><code class="xml"> |

61 | 12 | Andrei Tatarnikov | <?xml version="1.0" encoding="UTF-8" standalone="no"?> |

62 | 1 | Andrei Tatarnikov | <Constraint version="1.0"> |

63 | 16 | Andrei Tatarnikov | <Name>SimpleBitVector</Name> |

64 | <Description>SimpleBitVector constraint</Description> |
||

65 | 13 | Andrei Tatarnikov | <Solver id="Z3_TEXT"/> |

66 | 1 | Andrei Tatarnikov | <Signature> |

67 | 16 | Andrei Tatarnikov | <Variable length="3" name="a" type="BIT_VECTOR" value=""/> |

68 | <Variable length="3" name="b" type="BIT_VECTOR" value=""/> |
||

69 | 13 | Andrei Tatarnikov | </Signature> |

70 | 1 | Andrei Tatarnikov | <Syntax> |

71 | 12 | Andrei Tatarnikov | <Formula> |

72 | 13 | Andrei Tatarnikov | <Expression> |

73 | 16 | Andrei Tatarnikov | <Operation family="ru.ispras.solver.core.syntax.EStandardOperation" id="NOT"/> |

74 | 1 | Andrei Tatarnikov | <Expression> |

75 | 16 | Andrei Tatarnikov | <Operation family="ru.ispras.solver.core.syntax.EStandardOperation" id="EQ"/> |

76 | <VariableRef name="a"/> |
||

77 | 1 | Andrei Tatarnikov | <VariableRef name="b"/> |

78 | </Expression> |
||

79 | </Expression> |
||

80 | 12 | Andrei Tatarnikov | </Formula> |

81 | 1 | Andrei Tatarnikov | <Formula> |

82 | <Expression> |
||

83 | <Operation family="ru.ispras.solver.core.syntax.EStandardOperation" id="EQ"/> |
||

84 | 13 | Andrei Tatarnikov | <Expression> |

85 | 16 | Andrei Tatarnikov | <Operation family="ru.ispras.solver.core.syntax.EStandardOperation" id="BVOR"/> |

86 | <VariableRef name="a"/> |
||

87 | <VariableRef name="b"/> |
||

88 | 1 | Andrei Tatarnikov | </Expression> |

89 | 16 | Andrei Tatarnikov | <Value length="3" type="BIT_VECTOR" value="111"/> |

90 | 13 | Andrei Tatarnikov | </Expression> |

91 | 12 | Andrei Tatarnikov | </Formula> |

92 | 13 | Andrei Tatarnikov | <Formula> |

93 | <Expression> |
||

94 | 16 | Andrei Tatarnikov | <Operation family="ru.ispras.solver.core.syntax.EStandardOperation" id="EQ"/> |

95 | 12 | Andrei Tatarnikov | <Expression> |

96 | 16 | Andrei Tatarnikov | <Operation family="ru.ispras.solver.core.syntax.EStandardOperation" id="BVLSHL"/> |

97 | <VariableRef name="a"/> |
||

98 | <Value length="3" type="BIT_VECTOR" value="011"/> |
||

99 | 12 | Andrei Tatarnikov | </Expression> |

100 | 16 | Andrei Tatarnikov | <Expression> |

101 | <Operation family="ru.ispras.solver.core.syntax.EStandardOperation" id="BVSMOD"/> |
||

102 | <VariableRef name="a"/> |
||

103 | <Value length="3" type="BIT_VECTOR" value="010"/> |
||

104 | </Expression> |
||

105 | 13 | Andrei Tatarnikov | </Expression> |

106 | </Formula> |
||

107 | 12 | Andrei Tatarnikov | <Formula> |

108 | 13 | Andrei Tatarnikov | <Expression> |

109 | 16 | Andrei Tatarnikov | <Operation family="ru.ispras.solver.core.syntax.EStandardOperation" id="EQ"/> |

110 | <Expression> |
||

111 | <Operation family="ru.ispras.solver.core.syntax.EStandardOperation" id="BVAND"/> |
||

112 | <VariableRef name="a"/> |
||

113 | <VariableRef name="b"/> |
||

114 | </Expression> |
||

115 | <Value length="3" type="BIT_VECTOR" value="000"/> |
||

116 | 12 | Andrei Tatarnikov | </Expression> |

117 | 1 | Andrei Tatarnikov | </Formula> |

118 | 12 | Andrei Tatarnikov | </Syntax> |

119 | 14 | Andrei Tatarnikov | </Constraint> |

120 | 15 | Andrei Tatarnikov | </code></pre> |

121 | 1 | Andrei Tatarnikov | |

122 | h2. Tree Representation |
||

123 | |||

124 | In our system, we use context-independent syntax trees to represent constraints. These trees are then used to generate a representation that can be understood by a particular SMT solver. Generally, it is an SMT model that uses some limited set of solver features applicable to microprocessor verification. The syntax tree contains nodes of the following types: |
||

125 | # Constraint. This is the root node of the tree. It holds the list of unknown variables and the list of assertions (formulas) for these variables. |
||

126 | # Formula. Represents an assertion expression. Can be combined with other formulas to build a more complex expression (by applying logic OR, AND or NOT to it). The underlying expression must be a logic expression that can be solved to true or false. |
||

127 | # Operation. Represents an unary or binary operation with some unknown variable, some value or some expression as parameters. |
||

128 | # Variable.Represents an input variable. It can have an assigned value and, in such a case, will be treated as a value. Otherwise, it is an unknown variable. A variable includes a type as an attribute. |
||

129 | # Value. Specifies some known value of the specified type which can be accessed as an attribute. |
||

130 | |||

131 | Note: Operation, Variables and Value are designed to be treated polymorphically. This allows combining them to build complex expressions. |
||

132 | |||

133 | h2. Constraint Solver Java Library |
||

134 | |||

135 | The Constraint Solver subsystem is implemented in Java. The source code files are located in the "microtesk++/constraint-solver" folder. The Java classes are organized in the following packages: |
||

136 | # ru.ispras.microtesk.constraints - contains SMT model generation logic and solver implementations. |
||

137 | # ru.ispras.microtesk.constraints.syntax - contains classes implementing syntax tree nodes. |
||

138 | # ru.ispras.microtesk.constraints.syntax.types - contains code that specifies particular data types and operation types. |
||

139 | # ru.ispras.microtesk.constraints.tests - contains JUnit test cases. |
||

140 | |||

141 | h3. Core classes/interfaces |
||

142 | |||

143 | *Syntax Tree Implementation* |
||

144 | |||

145 | The syntax tree nodes are implemented in the following classes: |
||

146 | * Constraint. Parameterized by a collection of Variable objects and a collection of Formula objects. |
||

147 | * Formula. Parameterized by an Operation object. |
||

148 | * Operation. Implements SyntaxElement. Parameterized by operand objects implementing SyntaxElement and an operation type object implementing OperationType. |
||

149 | * Variable. Implements SyntaxElement. Parameterized by the variable name string, a data type object implemeting DataType and a BigInteger value object. |
||

150 | * Value. Implements SyntaxElement. Parameterized a data type object implemeting DataType and a BigInteger value object. |
||

151 | |||

152 | The SyntaxElement interface provides the ability to combine different kinds of elements into expressions. |
||

153 | |||

154 | 10 | Alexander Kamkin | The current implementation supports operations with the following data types: (1) Bit vectors, (2) Booleans. They are implemented in the BitVector and LogicBoolean classes. The BitVectorOperation and LogicBooleanOperation classes specify supported operation with these types. For example, the LogicBooleanOperation class looks like this: |

155 | 1 | Andrei Tatarnikov | |

156 | <pre><code class="java"> |
||

157 | public final class LogicBooleanOperation extends OperationType |
||

158 | { |
||

159 | private LogicBooleanOperation() {} |
||

160 | |||

161 | /** Operation: Logic - Equality */ |
||

162 | public static final OperationType EQ = new LogicBooleanOperation(); |
||

163 | /** Operation: Logic - AND */ |
||

164 | public static final OperationType AND = new LogicBooleanOperation(); |
||

165 | /** Operation: Logic - OR */ |
||

166 | public static final OperationType OR = new LogicBooleanOperation(); |
||

167 | /** Operation: Logic - NOT */ |
||

168 | public static final OperationType NOT = new LogicBooleanOperation(); |
||

169 | /** Operation: Logic - XOR */ |
||

170 | public static final OperationType XOR = new LogicBooleanOperation(); |
||

171 | /** Operation: Logic - Implication */ |
||

172 | 10 | Alexander Kamkin | public static final OperationType IMPL= new LogicBooleanOperation(); |

173 | 1 | Andrei Tatarnikov | } |

174 | </code></pre> |
||

175 | |||

176 | 10 | Alexander Kamkin | The code below demonstrates how we can build a syntax tree representation for the integer overflow constraint: |

177 | 1 | Andrei Tatarnikov | |

178 | <pre><code class="java"> |
||

179 | class BitVectorIntegerOverflowTestCase implements SolverTestCase |
||

180 | { |
||

181 | private static final int BIT_VECTOR_LENGTH = 64; |
||

182 | private static final DataType BIT_VECTOR_TYPE = DataType.getBitVector(BIT_VECTOR_LENGTH); |
||

183 | private static final Value INT_ZERO = new Value(new BigInteger("0"), BIT_VECTOR_TYPE); |
||

184 | private static final Value INT_BASE_SIZE = new Value(new BigInteger("32"), BIT_VECTOR_TYPE); |
||

185 | |||

186 | private static final Operation INT_SIGN_MASK = |
||

187 | new Operation(BitVectorOperation.BVSHL, new Operation(BitVectorOperation.BVNOT, INT_ZERO, null), INT_BASE_SIZE); |
||

188 | |||

189 | private Operation IsValidPos(SyntaxElement arg) |
||

190 | { |
||

191 | return new Operation(LogicBooleanOperation.EQ, new Operation(BitVectorOperation.BVAND, arg, INT_SIGN_MASK), INT_ZERO); |
||

192 | } |
||

193 | |||

194 | private Operation IsValidNeg(SyntaxElement arg) |
||

195 | { |
||

196 | return new Operation(LogicBooleanOperation.EQ, new Operation(BitVectorOperation.BVAND, arg, INT_SIGN_MASK), INT_SIGN_MASK); |
||

197 | } |
||

198 | |||

199 | private Operation IsValidSignedInt(SyntaxElement arg) |
||

200 | { |
||

201 | return new Operation(LogicBooleanOperation.OR, IsValidPos(arg), IsValidNeg(arg)); |
||

202 | } |
||

203 | |||

204 | public Constraint getConstraint() |
||

205 | { |
||

206 | Constraint constraint = new Constraint(); |
||

207 | |||

208 | Variable rs = new Variable("rs", BIT_VECTOR_TYPE, null); |
||

209 | constraint.addVariable(rs); |
||

210 | |||

211 | Variable rt = new Variable("rt", BIT_VECTOR_TYPE, null); |
||

212 | constraint.addVariable(rt); |
||

213 | |||

214 | |||

215 | constraint.addFormula( |
||

216 | new Formula( |
||

217 | IsValidSignedInt(rs) |
||

218 | ) |
||

219 | ); |
||

220 | |||

221 | constraint.addFormula( |
||

222 | new Formula( |
||

223 | IsValidSignedInt(rt) |
||

224 | ) |
||

225 | ); |
||

226 | |||

227 | constraint.addFormula( |
||

228 | new Formula( |
||

229 | new Operation( |
||

230 | LogicBooleanOperation.NOT, |
||

231 | IsValidSignedInt(new Operation(BitVectorOperation.BVADD, rs, rt)), |
||

232 | null |
||

233 | ) |
||

234 | ) |
||

235 | ); |
||

236 | |||

237 | constraint.addFormula( |
||

238 | new Formula( |
||

239 | new Operation(LogicBooleanOperation.NOT, new Operation(LogicBooleanOperation.EQ, rs, rt), null) |
||

240 | ) |
||

241 | ); |
||

242 | |||

243 | return constraint; |
||

244 | } |
||

245 | |||

246 | public Vector<Variable> getExpectedVariables() |
||

247 | { |
||

248 | Vector<Variable> result = new Vector<Variable>(); |
||

249 | |||

250 | result.add(new Variable("rs", BIT_VECTOR_TYPE, new BigInteger("000000009b91b193", 16))); |
||

251 | result.add(new Variable("rt", BIT_VECTOR_TYPE, new BigInteger("000000009b91b1b3", 16))); |
||

252 | |||

253 | return result; |
||

254 | 10 | Alexander Kamkin | } |

255 | 1 | Andrei Tatarnikov | } |

256 | </code></pre> |
||

257 | |||

258 | *Representation Translation* |
||

259 | |||

260 | 10 | Alexander Kamkin | The logic that translates a tree representation into an SMT representation is implemented in the following way: Methods of the Translator class traverse the constraint syntax tree and use methods of the RepresentationBuilder interface to translate information about its nodes into a representation that can be understood by a particular solver. The RepresentationBuilder interface looks like follows: |

261 | 1 | Andrei Tatarnikov | |

262 | <pre><code class="java"> |
||

263 | public interface RepresentationBuilder |
||

264 | { |
||

265 | public void addVariableDeclaration(Variable variable); |
||

266 | |||

267 | public void beginConstraint(); |
||

268 | public void endConstraint(); |
||

269 | |||

270 | public void beginFormula(); |
||

271 | public void endFormula(); |
||

272 | |||

273 | public void beginExpression(); |
||

274 | public void endExpression(); |
||

275 | |||

276 | public void appendValue(Value value); |
||

277 | public void appendVariable(Variable variable); |
||

278 | 10 | Alexander Kamkin | public void appendOperation(OperationType type); |

279 | 1 | Andrei Tatarnikov | } |

280 | </code></pre> |
||

281 | |||

282 | *Solver Implementation* |
||

283 | |||

284 | 10 | Alexander Kamkin | Solvers use the Translator class and a specific implementation of the RepresentationBuilder interface to generate an SMT representation of a constraint. Then they run a solver engine to solve the constraint and produce the results. Solver implement a common interface called Solver that looks like this: |

285 | 1 | Andrei Tatarnikov | |

286 | <pre><code class="java"> |
||

287 | public interface Solver |
||

288 | { |
||

289 | public boolean solveConstraint(Constraint constraint); |
||

290 | |||

291 | public boolean isSolved(); |
||

292 | public boolean isSatisfiable(); |
||

293 | |||

294 | public int getErrorCount(); |
||

295 | public String getErrorText(int index); |
||

296 | |||

297 | public int getVariableCount(); |
||

298 | 10 | Alexander Kamkin | public Variable getVariable(int index); |

299 | 1 | Andrei Tatarnikov | } |

300 | </code></pre> |