2019 search results - page 119 / 404 » Programming with Shared Data Abstractions |
ATVA
2004
Springer
15 years 3 months ago
2004
Springer
Data races do not cover all kinds of concurrency errors. This paper presents a data- ow-based technique to nd stale-value errors, which are not found by low-level and high-level d...
SOSP
1997
ACM
14 years 11 months ago
1997
ACM
This paper presents a new model for controlling information flow in systems with mutual distrust and decentralized authority. The model allows users to share information with dis...
EMSOFT
2007
Springer
15 years 4 months ago
2007
Springer
This paper describes techniques to estimate the worst case execution time of executable code on architectures with data caches. The underlying mechanism is Abstract Interpretation...
VMCAI
2007
Springer
15 years 3 months ago
2007
Springer
We define the class of single-parent heap systems, which rely on a singly-linked heap in order to model destructive updates on tree structures. This encoding has the advantage of ...
POPL
2000
ACM
15 years 2 months ago
2000
ACM
In 1998 Asperti and Mairson proved that the cost of reducing a lambda-term using an optimal lambda-reducer (a la L´evy) cannot be bound by any elementary function in the number o...