Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Peled, Matan"'
We investigate the domain of satisfiable formulas in satisfiability modulo theories (SMT), in particular, automatic generation of a multitude of satisfying assignments to such formulas. Despite the long and successful history of SMT in model checking
Externí odkaz:
http://arxiv.org/abs/2212.06472
