24 search results - page 4 / 5 » User-Input Dependence Analysis via Graph Reachability |
ICCAD
2001
IEEE
14 years 1 months ago
2001
IEEE
Methods based on Boolean satisfiability (SAT) typically use a Conjunctive Normal Form (CNF) representation of the Boolean formula, and exploit the structure of the given problem ...
CCS
2007
ACM
13 years 11 months ago
2007
ACM
: To understand overall vulnerability to network attack, one must consider attacker exploits not just in isolation, but also in combination. That is, one must analyze how low-level...
SIGSOFT
1995
ACM
13 years 8 months ago
1995
ACM
The notion of a program slice, originally introduced by Mark Weiser, is a fundamental operation for addressing many software-engineering problems, including program understanding,...
SIGMOD
2009
ACM
14 years 5 months ago
2009
ACM
Wikipedia is an example of the large, collaborative, semi-structured data sets emerging on the Web. Typically, before these data sets can be used, they must transformed into struc...
BMCBI
2008
13 years 5 months ago
2008
Background: Microarray experiments generate vast amounts of data. The functional context of differentially expressed genes can be assessed by querying the Gene Ontology (GO) datab...