Sciweavers

146 search results - page 23 / 30
» Cyclic reference counting
Sort
View
SAS
2010
Springer
141views Formal Methods» more  SAS 2010»
13 years 8 months ago
Statically Inferring Complex Heap, Array, and Numeric Invariants
We describe Deskcheck, a parametric static analyzer that is able to establish properties of programs that manipulate dynamically allocated memory, arrays, and integers. Deskcheck c...
Bill McCloskey, Thomas W. Reps, Mooly Sagiv
IMCSIT
2010
13 years 7 months ago
On the implementation of public keys algorithms based on algebraic graphs over finite commutative rings
We will consider balanced directed graphs, i.e., graphs of binary relations, for which the number of inputs and number of outputs are the same for each vertex. The commutative diag...
Michal Klisowski, Vasyl Ustimenko
ISCA
2007
IEEE
177views Hardware» more  ISCA 2007»
14 years 3 months ago
Adaptive insertion policies for high performance caching
The commonly used LRU replacement policy is susceptible to thrashing for memory-intensive workloads that have a working set greater than the available cache size. For such applica...
Moinuddin K. Qureshi, Aamer Jaleel, Yale N. Patt, ...
SMALLTALK
2007
Springer
14 years 3 months ago
Transactional memory for smalltalk
Concurrency control in Smalltalk is based on locks and is therefore notoriously difficult to use. Even though some implementations provide high-level constructs, these add complexi...
Lukas Renggli, Oscar Nierstrasz
CLUSTER
2003
IEEE
14 years 2 months ago
Compiler Optimized Remote Method Invocation
We further increase the efficiency of Java RMI programs. Where other optimizing re-implementations of RMI use pre-processors to create stubs and skeletons and to create class spe...
Ronald Veldema, Michael Philippsen