19 search results - page 4 / 4 » Improving NFA-Based Signature Matching Using Ordered Binary ... |
JSAT
2006
13 years 4 months ago
2006
Several propositional fragments have been considered so far as target languages for knowledge compilation and used for improving computational tasks from major AI areas (like infe...
ICCD
2005
IEEE
14 years 1 months ago
2005
IEEE
In recent years, Boolean Satisfiability (SAT) has been shown to hold potential for Unbounded Model Checking (UMC). The success of SAT-based UMC largely relies on (i) the SAT solv...
TVLSI
2008
13 years 4 months ago
2008
Exact approaches to combinational equivalence checking, such as automatic test pattern generation-based, binary decision diagrams (BDD)-based, satisfiability-based, and hybrid appr...
ICSE
2008
IEEE-ACM
14 years 5 months ago
2008
IEEE-ACM
Program specifications are important in many phases of the software development process, but they are often omitted or incomplete. An important class of specifications takes the f...