3820 search results - page 47 / 764 » Bounded Model Debugging |
SAT
2005
Springer
14 years 1 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...
ENTCS
2007
13 years 7 months ago
2007
Bounded Model Checking (BMC) is a successful refutation method to detect errors in not only circuits and other binary systems but also in systems with more complex domains like ti...
CRYPTO
2009
Springer
14 years 2 months ago
2009
Springer
We study the design of cryptographic primitives resilient to key-leakage attacks, where an attacker can repeatedly and adaptively learn information about the secret key, subject o...
DSN
2004
IEEE
13 years 11 months ago
2004
IEEE
The authors describe the use of bounded model checking (BMC) for verifying Web application code. Vulnerable sections of code are patched automatically with runtime guards, allowin...
AAAI
2006
13 years 9 months ago
2006
Model counting is the classical problem of computing the number of solutions of a given propositional formula. It vastly generalizes the NP-complete problem of propositional satis...