251 search results - page 9 / 51 » Lattice-Valued Binary Decision Diagrams |
APLAS
2005
ACM
14 years 28 days ago
2005
ACM
Many problems in program analysis can be expressed naturally and concisely in a declarative language like Datalog. This makes it easy to specify new analyses or extend or compose e...
ICSE
2004
IEEE-ACM
14 years 7 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...
AUSDM
2007
Springer
14 years 1 months ago
2007
Springer
Mining frequent patterns such as frequent itemsets is a core operation in many important data mining tasks, such as in association rule mining. Mining frequent itemsets in high-di...
ICCAD
1994
IEEE
13 years 11 months ago
1994
IEEE
We propose new techniques for efficient breadth-first iterative manipulation of ROBDDs. Breadth-first iterative ROBDD manipulation can potentially reduce the total elapsed time by...
ISCAS
1994
IEEE
13 years 11 months ago
1994
IEEE