494 search results - page 4 / 99 » Heap Building Bounds |
152
click to vote
JACM
2000
15 years 5 months ago
2000
A simple variant of a priority queue, called a soft heap, is introduced. The data structure supports the usual operations: insert, delete, meld, and findmin. Its novelty is to beat...
135
click to vote
CC
2007
Springer
15 years 11 months ago
2007
Springer
We present a unification-based, context-sensitive escape and effect analysis that infers lightweight method summaries describing heap effects. The analysis is parameterized on two...
151
click to vote
FOSSACS
2005
Springer
15 years 10 months ago
2005
Springer
Separation logic is a spatial logic for reasoning locally about heap structures. A decidable fragment of its assertion language was presented in [1], based on a bounded model prope...
135
click to vote
CASC
2007
Springer
15 years 11 months ago
2007
Springer
A common way of implementing multivariate polynomial multiplication and division is to represent polynomials as linked lists of terms sorted in a term ordering and to use repeated ...
238
click to vote
POPL
2003
ACM
16 years 5 months ago
2003
ACM
We show how to efficiently obtain linear a priori bounds on the heap space consumption of first-order functional programs. The analysis takes space reuse by explicit deallocation ...