Floating-point satisfiability as global optimization

Solving SMT formulas involving the theory of floating-pointing arithmetic (FPA) can be encountered in several domains including symbolic execution and program synthesis. Unfortunately, SMT solvers which support FPA often struggle trying to satisfy ...


Building this blog

Details about the tools and services used in building this blog. Also, some discussion about the design rationale behind it.