4719 search results - page 187 / 944 » Newtonian program analysis |
127
click to vote
ESOP
2007
Springer
15 years 10 months 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...
162
click to vote
PEPM
1993
ACM
15 years 8 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...
140
click to vote
CORR
2010
Springer
15 years 4 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...
156
click to vote
SAS
2009
Springer
16 years 5 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...
158
click to vote
FASE
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. The reality of multi-core hardware has made concurrent programs pervasive. Unfortunately, writing correct concurrent programs is difficult. Atomicity violation, which is ...