This paper describes a general approach for automatic and accurate live heap
space and live heap space-bound analyses for high-level languages. The
approach is based on program analysis and transformations and is fully
automatic. The space-bound analysis produces accurate (tight) upper bounds
in the presence of partially known input structures. The analyses have been
implemented and experimental results confirm their accuracy.