Sciweavers

295 search results - page 11 / 59
» SAT, SMT and Applications
Sort
View
FMCAD
2004
Springer
15 years 10 months ago
Memory Efficient All-Solutions SAT Solver and Its Application for Reachability Analysis
This work presents a memory-efficient All-SAT engine which, given a propositional formula over sets of important and non-important variables, returns the set of all the assignments...
Orna Grumberg, Assaf Schuster, Avi Yadgar
SAMOS
2007
Springer
16 years 21 days ago
On the Problem of Minimizing Workload Execution Time in SMT Processors
Abstract—Most research work on (Simultaneous Multithreading Processors) SMTs focuses on improving throughput and/or fairness, or on prioritizing some threads over others in a wor...
Francisco J. Cazorla, Enrique Fernández, Pe...
IFM
2010
Springer
152views Formal Methods» more  IFM 2010»
15 years 5 months ago
Satisfaction Meets Expectations - Computing Expected Values of Probabilistic Hybrid Systems with SMT
Stochastic satisfiability modulo theories (SSMT), which is an extension of satisfiability modulo theories with randomized quantification, has successfully been used as a symboli...
Martin Fränzle, Tino Teige, Andreas Eggers
HIPEAC
2007
Springer
16 years 23 days ago
Dynamic Capacity-Speed Tradeoffs in SMT Processor Caches
Caches are designed to provide the best tradeoff between access speed and capacity for a set of target applications. Unfortunately, different applications, and even different phas...
Sonia López, Steve Dropsho, David H. Albone...
CSL
2010
Springer
15 years 7 months ago
Embedding Deduction Modulo into a Prover
Deduction modulo consists in presenting a theory through rewrite rules to support automatic and interactive proof search. It induces proof search methods based on narrowing, such a...
Guillaume Burel