Sciweavers

2947 search results - page 76 / 590
» Analyzing Program Analyses
Sort
View
TAPSOFT
1997
Springer
15 years 6 months ago
On the Complexity of Function Pointer May-Alias Analysis
This paper considers the complexity of interprocedural function pointer may-alias analysis, i.e., determining the set of functions that a function pointer (in a language such as C...
Robert Muth, Saumya K. Debray
IJDE
2006
101views more  IJDE 2006»
15 years 2 months ago
Google Desktop as a Source of Digital Evidence
This paper discusses the emerging trend of Personal Desktop Searching utilities on desktop computers, and how the information cached and stored with these systems can be retrieved...
Benjamin Turnbull, Barry Blundell, Jill Slay
131
Voted
MICRO
2008
IEEE
103views Hardware» more  MICRO 2008»
15 years 9 months ago
Testudo: Heavyweight security analysis via statistical sampling
Heavyweight security analysis systems, such as taint analysis and dynamic type checking, are powerful technologies used to detect security vulnerabilities and software bugs. Tradi...
Joseph L. Greathouse, Ilya Wagner, David A. Ramos,...
BMCBI
2007
130views more  BMCBI 2007»
15 years 2 months ago
Differential analysis for high density tiling microarray data
Background: High density oligonucleotide tiling arrays are an effective and powerful platform for conducting unbiased genome-wide studies. The ab initio probe selection method emp...
Srinka Ghosh, Heather A. Hirsch, Edward A. Sekinge...
105
Voted
LPAR
2001
Springer
15 years 7 months ago
Inferring Termination Conditions for Logic Programs Using Backwards Analysis
This paper focuses on the inference of modes for which a logic program is guaranteed to terminate. This generalizes traditional termination analysis where an analyzer tries to veri...
Samir Genaim, Michael Codish