ACM DL

Programming Languages and Systems (TOPLAS)

Menu

Search Issue
enter search term and/or author name

Archive


ACM Transactions on Programming Languages and Systems (TOPLAS), Volume 34 Issue 3, October 2012

Equivalence checking of static affine programs using widening to handle recurrences
Sven Verdoolaege, Gerda Janssens, Maurice Bruynooghe
Article No.: 11
DOI: 10.1145/2362389.2362390

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...

Essential AOP: The a calculus
Bruno De Fraine, Erik Ernst, Mario Südholt
Article No.: 12
DOI: 10.1145/2362389.2362391

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
DOI: 10.1145/2362389.2362392

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 [1971] has shown that a...

Multivariate amortized resource analysis
Jan Hoffmann, Klaus Aehlig, Martin Hofmann
Article No.: 14
DOI: 10.1145/2362389.2362393

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...