Constraint Solver¶

The constraint solver subsystem is aimed to provide a possibility to automatically generate test cases based on specified constraints. A constraint is represented by a set of limitations for input values. The solver finds values of input variables which will violate the limitations if there are any.

The subsystem uses an SMT solver as an engine (in the current version, we use the Z3 solver by Microsoft Research). SMT solvers use a special functional language to specify constraints. The subsystem generates constructions in the SMT languages and uses the engine to process them and produce the results (values of unknown input variables).

It is based on

Constraint Solver Library¶

The ru.ispras.microtesk.constraints package includes the following sub-packages:

Language-independent syntax tree¶

База данных ограничений¶

База данных ограничений строится автоматически в результате анализа формализованных спецификаций системы команд микропроцессора, выполненной на одном из ADL-языков (например, nML). Некоторые ситуации могут описываться вручную и добавляться в базу данных ограничений.