Abstract
We present a new randomized algorithm for checking the satisfiability of a conjunction of literals in the combined theory of linear equalities and uninterpreted functions. The key idea of the algor...
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have