4716 search results - page 162 / 944 » Iterative-free program analysis |
264
click to vote
POPL
2005
ACM
16 years 6 months ago
2005
ACM
This paper proposes a novel approach to shape analysis: using local reasoning about individual heap locations of global reasoning about entire heap abstractions. We present an int...
160
click to vote
ESOP
2007
Springer
16 years 18 days ago
2007
Springer
Abstract. We describe a new technique for computing procedure summaries for performing an interprocedural analysis on programs. Procedure summaries are computed by performing a bac...
196
click to vote
PEPM
1993
ACM
15 years 10 months ago
1993
ACM
The aim of binding-time analysis is to determine when variables, expressions, statements, etc. in a program can be evaluated by classifying these into static (compile-time) and dy...
168
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. Static analysis is a powerful technique for automatic verification of programs but raises major engineering challenges when developing a full-fledged analyzer for a reali...
205
click to vote
SAS
2009
Springer
16 years 7 months ago
2009
Springer
In this paper we present a new shape analysis algorithm. The key distinguishing aspect of our algorithm is that it is completely compositional, bottom-up and non-iterative. We pres...