12272 search results - page 306 / 2455 » Experimental program analysis |
203
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...
190
click to vote
IPPS
2009
IEEE
16 years 1 months ago
2009
IEEE
We introduce the coupled placement problem for modern data centers spanning placement of application computation and data among available server and storage resources. While the t...
218
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...
200
click to vote
FASE
2009
Springer
16 years 1 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 ...
184
click to vote
ISSRE
2002
IEEE
15 years 11 months ago
2002
IEEE
Tracing is a dynamic analysis technique to continuously capture events of interest on a running program. The occurrence of a statement, the invocation of a function, and the trigg...