494 search results - page 9 / 99 » Heap Building Bounds |
APLAS
2010
ACM
14 years 10 months ago
2010
ACM
This paper studies the problem of statically determining upper bounds on the resource consumption of first-order functional programs. A previous work approached the problem with an...
NJC
2000
14 years 10 months ago
2000
We show how linear typing can be used to obtain functional programs which modify heap-allocated data structures in place. We present this both as a "design pattern" for ...
61
Voted
PLDI
1990
ACM
15 years 2 months ago
1990
ACM
Languages such as Scheme and Smalltalk that provide continuations as first-class data objects present a challenge to efficient implementation. Allocating activation records in a h...
183
click to vote
POPL
2009
ACM
15 years 11 months ago
2009
ACM
This paper describes an inter-procedural technique for computing symbolic bounds on the number of statements a procedure executes in terms of its scalar inputs and user-defined qu...
ASPLOS
2000
ACM
15 years 2 months ago
2000
ACM
Parallel, multithreaded C and C++ programs such as web servers, database managers, news servers, and scientific applications are becoming increasingly prevalent. For these applic...