L. Unnikrishnan

A new approach is presented for detecting whether a particular computation of an asynchronous distributed system satisfies \(\mathop{{\bf Poss}}\Phi\) (read “possibly Φ”), meaning the system could have passed through a global state satisfying predicate Φ. Expand

This paper describes a general approach for optimized live heap space and live heapspace-bound analyses for garbage-collected languages. Expand

This paper describes a general approach for automatic and accurate space and space-bound analyses for high-level languages, considering stack space, heap allocation and live heap space usage of programs. Expand

This paper describes a general approach for automatic and accurate live heap space and space-bound analyses for high-level languages. Expand

This paper presents an analysis that derives a formula describing the worst-case live heap space usage of programs in a functional language with automated memory management (garbage collection). Expand

We use program transformation to derive a space-bound function that takes as input partially-known structures which characterize sets of inputs to P. Expand