enter search term and/or author name
Equivalence checking of static affine programs using widening to handle recurrences
Sven Verdoolaege, Gerda Janssens, Maurice Bruynooghe
Article No.: 11
Designers often apply manual or semi-automatic loop and data transformations on array- and loop-intensive programs to improve performance. It is crucial that such transformations preserve the functionality of the program. This article presents an...
Aspect-oriented programming (AOP) has produced interesting language designs, but also ad hoc semantics that needs clarification. We contribute to this clarification with a calculus that models essential AOP, both simpler and more general than...
Space overhead bounds for dynamic memory management with partial compaction
Anna Bendersky, Erez Petrank
Article No.: 13
Dynamic memory allocation is ubiquitous in today's runtime environments. Allocation and deallocation of objects during program execution may cause fragmentation and foil the program's ability to allocate objects. Robson  has shown that a...
We study the problem of automatically analyzing the worst-case resource usage of procedures with several arguments. Existing automatic analyses based on amortization or sized types bound the resource usage or result size of such a procedure by a...