4502 search results - page 94 / 901 » Regular Model Checking |
109
click to vote
PLDI
2006
ACM
15 years 8 months ago
2006
ACM
Type systems for secure information flow are useful for efficiently checking that programs have secure information flow. They are, however, conservative, so that they often rej...
137
Voted
CAV
2000
Springer
15 years 6 months ago
2000
Springer
In this paper we show how to do symbolic model checking using Boolean Expression Diagrams (BEDs), a non-canonical representation for Boolean formulas, instead of Binary Decision Di...
112
click to vote
JMLR
2010
14 years 9 months ago
2010
We propose a novel group regularization which we call exclusive lasso. Unlike the group lasso regularizer that assumes covarying variables in groups, the proposed exclusive lasso ...
122
click to vote
DAC
2006
ACM
16 years 3 months ago
2006
ACM
In this paper, we present a method that helps improve the performance of Bounded Model Checking by automatically strengthening invariants so that the termination proof may be obta...
122
click to vote
SAT
2005
Springer
15 years 7 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...