search for: yice

Displaying 5 results from an estimated 5 matches for "yice".

Did you mean: nice
2018 Sep 21
1
[cfe-dev] SMT solvers in clang SA
We are currently implementing the backends for other solvers (you can follow the progress here: https://github.com/mikhailramalho/clang). So far we got Boolector, MathSAT and Yices ready. CVC4 should be done soon. When used to refute bugs, they all give roughly the same results: a ~5% speedup if there are refuted bugs or a ~5% slowdown if no bug is refuted. I've only tried to analyze one full project (tmux) with Yices; the CSA ran for 24hrs and it didn't complete t...
2018 Sep 21
2
SMT solvers in clang SA
Hi all, Currently studying the impact of SMT solvers on Clang SA. Can anyone help in telling more about the SMT solvers use in clang SA ? ( Have already tested Z3 SMT solver implemented in GSoC 2018 , also looking for other SMT solvers if possible ) Thanks, Siddharth -------------- next part -------------- An HTML attachment was scrubbed... URL:
2007 Apr 09
0
[LLVMdev] New automated decision procedure for path-sensitive analysis
On 4/9/07, Domagoj Babic <babic.domagoj at gmail.com> wrote: > > > Traditionally, such analyses have been considered too expensive to be > practical, and were mostly an academic curiosity. The core of the > problem is the lack of adequate automated decision procedures which > could quickly determine whether a set of constraints is satisfiable or > not, and if it is
2007 Apr 09
2
[LLVMdev] New automated decision procedure for path-sensitive analysis
...simulate memory by arrays in > symbolic execution. But I found it is inadequate. There has been some progress lately (see Rustan Leino's work on the weakest precondition transformer) on handling arrays. Some automated theorem provers even support the theories of arrays (like CVC, Simplify, Yices,...). However, those thm provers do not have a very good support for modular arithmetic. In fact, they most often approximate bounded integers with rationals (reals), and that's one of the reasons why they can't handle operators like MUL ( as they rely on linear arithmetic solvers, like si...
2007 Apr 08
2
[LLVMdev] New automated decision procedure for path-sensitive analysis
Dear LLVMers, This email is intended for those interested in path-sensitive analysis, integer overflow analysis, static analysis, and (perhaps) loop invariant computation. Traditionally, such analyses have been considered too expensive to be practical, and were mostly an academic curiosity. The core of the problem is the lack of adequate automated decision procedures which could quickly