86 search results - page 7 / 18 » Automatic memory reclamation for lock-free data structures |
ATVA
2009
Springer
14 years 2 months ago
2009
Springer
We present a new approach for automatic verification of data-dependent programs manipulating dynamic heaps. A heap is encoded by a graph where the nodes represent the cells, and t...
WWW
2007
ACM
14 years 8 months ago
2007
ACM
Data-driven web applications are usually structured in three tiers with different programming models at each tier. This division forces developers to manually partition applicatio...
ATVA
2009
Springer
13 years 8 months ago
2009
Springer
Embedded systems often come with constrained memory footprints. It is therefore essential to ensure that software running on such platforms fulfils memory usage specifications at c...
ICS
2003
Tsinghua U.
14 years 20 days ago
2003
Tsinghua U.
Recent work in low-latency, high-bandwidth communication systems has resulted in building user–level Network InControllers (NICs) and communication abstractions that support dir...
ICALP
2001
Springer
13 years 12 months ago
2001
Springer
Abstract. In this paper we investigate automated methods for externalizing internal memory data structures. We consider a class of balanced trees that we call weight-balanced parti...