17 search results - page 3 / 4 » aplas 2009 |
APLAS
2009
ACM
13 years 11 months ago
2009
ACM
Bounded existential types are a powerful language feature ling partial data abstraction and information hiding. However, existentials do not mingle well with subtyping as found in ...
APLAS
2009
ACM
13 years 11 months ago
2009
ACM
Separation Algebras serve as models of Separation Logics; Share Accounting allows reasoning about concurrent-read/exclusive-write resources in Separation Logic. In designing a Conc...
APLAS
2009
ACM
13 years 11 months ago
2009
ACM
We propose a type system for a programming language with memory allocation/deallocation primitives, which prevents memory-related errors such as double-frees and memory leaks. The ...
APLAS
2009
ACM
13 years 11 months ago
2009
ACM
We present a simple algorithmic extension of the classical call-strings approach to mitigate substantial performance degradation caused by spurious interprocedural cycles. Spuriou...
APLAS
2009
ACM
13 years 11 months ago
2009
ACM
When describing the resource usage of a program, it is usual to talk in asymptotic terms, such as the well-known “big O” notation, whereby we focus on the behaviour of the prog...