494 search results - page 6 / 99 » Heap Building Bounds |
152
click to vote
ESOP
2009
Springer
15 years 10 months ago
2009
Springer
Hofmann and Jost have presented a heap space analysis [1] that finds linear space bounds for many functional programs. It uses an amortised analysis: assigning hypothetical amount...
108
Voted
MST
2006
15 years 3 months ago
2006
An array of n distinct keys can be sorted for logarithmic searching or can be organized as a heap for logarithmic updating, but it is unclear how to attain logarithmic time for bo...
136
Voted
TGC
2010
Springer
15 years 1 months ago
2010
Springer
Recent work in resource analysis has translated the idea of amortised resource analysis to imperative languages using a program logic that allows mixing of assertions about heap sh...
124
Voted
IANDC
2006
15 years 3 months ago
2006
Abstract. History independent data structures, presented by Micciancio, are data structures that possess a strong security property: even if an intruder manages to get a copy of th...
133
click to vote
ESOP
2010
Springer
16 years 24 days ago
2010
Springer
Type-based amortised resource analysis following Hofmann and Jost--where resources are associated with individual elements of data structures and doled out to the programmer under ...