126
click to vote
APLAS
9 years 10 months ago
2015 ACM
Abstract. We study the efficient implementation of call-by-value using the structure of interactive computation models. This structure has been useful in applications to resource-...
104
click to vote
APLAS
9 years 10 months ago
2015 ACM
Abstract. Quasi-linearizability is a quantitative relaxation of linearizability. It preserves the intuition of the standard notion of linearizability and permits more flexibility....
102
click to vote
APLAS
9 years 10 months ago
2015 ACM
We study integration of static and dynamic typing in the presence of delimited-control operators. In a program where typed and untyped parts coexist, the run-time system has to mon...
97
Voted
APLAS
9 years 10 months ago
2015 ACM
Abstract. Separation logic has been successful at verifying that programs do not crash due to illegal use of resources. The underlying assumption, however, is that machines do not ...
|