Sciweavers

95 search results - page 7 / 19
» Parametric heap usage analysis for functional programs
Sort
View
ESOP
2010
Springer
14 years 6 months ago
Amortized Resource Analysis with Polynomial Potential - A Static Inference of Polynomial Bounds for Functional Programs
In 2003, Hofmann and Jost introduced a type system that uses a potential-based amortized analysis to infer bounds on the resource consumption of (first-order) functional programs. ...
Jan Hoffmann and Martin Hofmann
HASKELL
2009
ACM
14 years 3 months ago
Finding the needle: stack traces for GHC
Even Haskell programs can occasionally go wrong. Programs calling head on an empty list, and incomplete patterns in function definitions can cause program crashes, reporting littl...
Tristan O. R. Allwood, Simon Peyton Jones, Susan E...
PLDI
1999
ACM
14 years 27 days ago
Pointer Analysis for Multithreaded Programs
This paper presents a novel interprocedural, ow-sensitive, and context-sensitive pointer analysis algorithm for multithreaded programs that may concurrently update shared pointers...
Radu Rugina, Martin C. Rinard
JTRES
2009
ACM
14 years 3 months ago
On transforming Java-like programs into memory-predictable code
The ScopedMemory class of the RTSJ enables the organization of objects into regions. This ensures time-predictable management of dynamic memory. Using scopes forces the programmer...
Diego Garbervetsky, Sergio Yovine, Víctor A...
ICLP
2007
Springer
14 years 13 days ago
User-Definable Resource Bounds Analysis for Logic Programs
We present a static analysis that infers both upper and lower bounds on the usage that a logic program makes of a set of user-definable resources. The inferred bounds will in gener...
Jorge Navas, Edison Mera, Pedro López-Garc&...