33 search results - page 1 / 7 » Efficient Rule Base Verification Using Binary Decision Diagr... |
DEXA
2004
Springer
13 years 8 months ago
2004
Springer
As their field of application has evolved and matured, the importance of verifying knowledge-based systems is now widely recognized. Nevertheless, some problems have remained. In t...
ICSE
2004
IEEE-ACM
14 years 5 months ago
2004
IEEE-ACM
Dynamic slicing algorithms can greatly reduce the debugging effort by focusing the attention of the user on a relevant subset of program statements. Recently algorithms for forwar...
CAV
2000
Springer
13 years 8 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...
CAP
2010
12 years 12 months ago
2010
Binary Decision Diagrams (BDDs) are widely used in formal verification. They are also widely known for consuming large amounts of memory. For larger problems, a BDD computation wi...
ISQED
2002
IEEE
13 years 9 months ago
2002
IEEE
State-of-the-art verification tools are based on efficient operations on Boolean formulas. Traditional manipulation techniques are based on Binary Decision Diagrams (BDDs) and SAT...