A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
All-Solution Satisfiability Modulo Theories: Applications, Algorithms and Benchmarks
2015
2015 10th International Conference on Availability, Reliability and Security
Satisfiability Modulo Theories (SMT) is a decision problem for logical formulas over one or more first-order theories. In this paper, we study the problem of finding all solutions of an SMT problem with respect to a set of Boolean variables, henceforth All-SMT. First, we show how an All-SMT solver can benefit various domains of application: Bounded Model Checking, Automated Test Generation, Reliability analysis, and Quantitative Information Flow. Secondly, we then propose algorithms to design
doi:10.1109/ares.2015.14
dblp:conf/IEEEares/PhanM15
fatcat:3far5acohnbofhpr6sxq23lytq