37 search results - page 5 / 8 » Worst-Case Analysis of Heap Allocations |
155
click to vote
SIROCCO
2000
15 years 7 months ago
2000
ABSTRACT: This work considers the problem of performing a set of N tasks on a set of P cooperating message-passing processors (P N). The processors use a group communication servi...
165
click to vote
CN
2008
15 years 6 months ago
2008
This paper deals with a congestion control framework for elastic and real-time traffic, where the user's application is associated with a utility function. We allow users to ...
171
click to vote
PLDI
2006
ACM
15 years 12 months ago
2006
ACM
Static analysis of programs in weakly typed languages such as C and C++ is generally not sound because of possible memory errors due to dangling pointer references, uninitialized ...
165
click to vote
ISTCS
1997
Springer
15 years 10 months ago
1997
Springer
We introduce the k-payment problem: given a total budget of N units, the problem is to represent this budget as a set of coins, so that any k exact payments of total value at most ...
181
click to vote
OOPSLA
1999
Springer
15 years 10 months ago
1999
Springer
This paper presents a combined pointer and escape analysis algorithm for Java programs. The algorithm is based on the abstraction of points-to escape graphs, which characterize ho...