Abstract: SMT solvers check the satisfiability of logic formulas over first-order theories, which have been utilized in a rich number of critical applications, such as software verification, test case ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results