10038 search results - page 79 / 2008 » Model Checking for Managers |
PLDI
2006
ACM
15 years 5 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...
108
click to vote
CAV
2000
Springer
15 years 3 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...
120
click to vote
COMPSAC
2002
IEEE
15 years 4 months ago
2002
IEEE
With computer systems becoming ever larger and more complex, the cost and effort associated with their construction is increasing and the systems are now sufficiently complex that...
DAC
2006
ACM
16 years 25 days 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...
SAT
2005
Springer
15 years 5 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...