352 search results - page 1 / 71 » Evaluating the imprecision of static analysis |
PASTE
2004
ACM
13 years 10 months ago
2004
ACM
This work discusses two non-traditional approaches for evaluating the imprecision of static analysis. The approaches are based on proofs of feasibility or infeasibility that are c...
DIMVA
2006
13 years 6 months ago
2006
Abstract. The Internet, and in particular the world-wide web, have become part of the everyday life of millions of people. With the growth of the web, the demand for on-line servic...
PLDI
1998
ACM
13 years 9 months ago
1998
ACM
This paper evaluates three alias analyses based on programming language types. The first analysis uses type compatibility to determine aliases. The second extends the first by u...
SAS
2007
Springer
13 years 11 months ago
2007
Springer
In static analysis, the semantics of the program is expressed as a set ions. The equations are solved iteratively over some abstract domain. If ract domain is distributive and sati...
ICPR
2006
IEEE
14 years 5 months ago
2006
IEEE
Traditionally, machine learning algorithms have been evaluated in applications where assumptions can be reliably made about class priors and/or misclassification costs. In this pa...