Sciweavers

5 search results - page 1 / 1
» Finding Resource Bounds in the Presence of Explicit Dealloca...
Sort
View
ICTAC
2005
Springer
16 years 28 days ago
Finding Resource Bounds in the Presence of Explicit Deallocation
Abstract. A software program requesting a resource that is not available usually raises an out-of-resource exception. Component software is software that has been assembled from st...
Hoang Truong, Marc Bezem
284
Voted
POPL
2003
ACM
16 years 7 months ago
Static prediction of heap space usage for first-order functional programs
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 ...
Martin Hofmann, Steffen Jost
202
Voted
OOPSLA
2004
Springer
16 years 23 days ago
Finding and preventing run-time error handling mistakes
It is difficult to write programs that behave correctly in the presence of run-time errors. Existing programming language features often provide poor support for executing clean-u...
Westley Weimer, George C. Necula
209
Voted
EOR
2008
159views more  EOR 2008»
15 years 7 months ago
A survey on the continuous nonlinear resource allocation problem
Our problem of interest consists of minimizing a separable, convex and differentiable function over a convex set, defined by bounds on the variables and an explicit constraint des...
Michael Patriksson
164
Voted
MICRO
1999
IEEE
110views Hardware» more  MICRO 1999»
15 years 11 months ago
Balance Scheduling: Weighting Branch Tradeoffs in Superblocks
Since there is generally insufficient instruction level parallelism within a single basic block, higher performance is achieved by speculatively scheduling operations in superbloc...
Alexandre E. Eichenberger, Waleed Meleis