33 search results - page 7 / 7 » The Boolean Constraint Solver of SWI-Prolog (System Descript... |
CPAIOR
2008
Springer
13 years 6 months ago
2008
Springer
Abstract. The stochastic satisfiability modulo theories (SSMT) problem is a generalization of the SMT problem on existential and randomized (aka. stochastic) quantification over di...
PEPM
2009
ACM
15 years 5 months ago
2009
ACM
The Verilog hardware description language has padding semantics that allow designers to write descriptions where wires of different bit widths can be interconnected. However, many ...
CONCUR
2010
Springer
13 years 6 months ago
2010
Springer
Boolean notions of correctness are formalized by preorders on systems. Quantitative measures of correctness can be formalized by realvalued distance functions between systems, wher...