9067 search results - page 74 / 1814 » Adaptive Model Checking |
PLDI
2006
ACM
14 years 4 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...
CAV
2000
Springer
14 years 1 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...
DAC
2006
ACM
14 years 11 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...
SAT
2005
Springer
14 years 3 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...
BPM
2009
Springer
14 years 4 months ago
2009
Springer
We report on a case study on control-flow analysis of business process models. We checked 735 industrial business process models from financial services, telecommunications and o...