295 search results - page 21 / 59 » SAT, SMT and Applications |
ICMCS
2006
IEEE
15 years 5 months ago
2006
IEEE
Numerous approaches can be employed in exploiting computation power in processors such as superscalar, VLIW, SMT and multi-core on chip. In this paper, a UniCore VisoMT processor ...
ATVA
2010
Springer
15 years 25 days ago
2010
Springer
We present a trace-driven SMT-based symbolic debugging tool for MCAPI (Multicore Association Communication API) applications. MCAPI is a newly proposed standard that provides an AP...
97
Voted
KBSE
2009
IEEE
15 years 6 months ago
2009
IEEE
Propositional bounded model checking has been applied successfully to verify embedded software but is limited by the increasing propositional formula size and the loss of structur...
ICCAD
2001
IEEE
15 years 8 months ago
2001
IEEE
Methods based on Boolean satisfiability (SAT) typically use a Conjunctive Normal Form (CNF) representation of the Boolean formula, and exploit the structure of the given problem ...
SAT
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. Symmetry occurs naturally in many computational problems. The use of symmetry breaking techniques for solving search problems reduces the search space and therefore is ex...