4722 search results - page 182 / 945 » Representation-independent program analysis |
SAS
2009
Springer
14 years 10 months ago
2009
Springer
Abstract. While the tightest proven worst-case complexity for Andersen's points-to analysis is nearly cubic, the analysis seems to scale better on real-world codes. We examine...
ICSE
2003
IEEE-ACM
14 years 9 months ago
2003
IEEE-ACM
Testing of polymorphism in object-oriented software may require coverage of all possible bindings of receiver classes and target methods at call sites. Tools that measure this cove...
PEPM
1995
ACM
14 years 1 months ago
1995
ACM
This paper concerns a method for approximating the possible “shapes” that heap-allocated structures in a program can take on. We present a new approach to finding solutions t...
CAV
2009
Springer
14 years 10 months ago
2009
Springer
We address the problem of analyzing programs such as J2ME midlets for mobile devices, where a central correctness requirement concerns confidentiality of data that the user wants t...
SPIN
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. The paper presents a novel technique to create implementations of the basic primitives used in symbolic program analysis: forward symbolic evaluation, weakest liberal pre...