204 search results - page 1 / 41 » Efficient Modeling of Embedded Memories in Bounded Model Che... |
CAV
2004
Springer
13 years 9 months ago
2004
Springer
SAT
2005
Springer
13 years 9 months ago
2005
Springer
Current algorithms for bounded model checking (BMC) use SAT methods for checking satisfiability of Boolean formulas. These BMC methods suffer from a potential memory explosion prob...
ICCAD
2010
IEEE
13 years 2 months ago
2010
IEEE
State-based model checking methods comprise computing and storing reachable states, while stateless model checking methods directly reason about reachable paths using decision proc...
CAV
2006
Springer
13 years 8 months ago
2006
Springer
Many multithreaded programs employ concurrent data types to safely share data among threads. However, highly-concurrent algorithms for even seemingly simple data types are difficul...
KBSE
2009
IEEE
13 years 11 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...