86 search results - page 14 / 18 » Automatic memory reclamation for lock-free data structures |
64
Voted
ACL
1998
14 years 11 months ago
1998
In this study, a learning device based on the PATtree data structures was developed. The original PAT-trees were enhanced with the deletion function to emulate human learning comp...
119
click to vote
ESOP
2000
Springer
15 years 2 months ago
2000
Springer
We exhibit a technique for automatically verifying the safety of simple C programs working on tree-shaped data structures. We do not consider the complete behavior of programs, but...
VMCAI
2007
Springer
15 years 4 months ago
2007
Springer
We present a constraint-based algorithm for the synthesis of invariants expressed in the combined theory of linear arithmetic and uninterpreted function symbols. Given a set of pro...
APLAS
2004
ACM
2004
ACM
Translation of Tree-Processing Programs into Stream-Processing Programs Based on Ordered Linear Type
15 years 3 months ago
There are two ways to write a program for manipulating tree-structured data such as XML documents: One is to write a tree-processing program focusing on the logical structure of t...
133
Voted
SIGMOD
2007
ACM
15 years 10 months ago
2007
ACM
We propose to demonstrate EaseDB, the first cache-oblivious query processor for in-memory relational query processing. The cacheoblivious notion from the theory community refers t...