Sciweavers

1392 search results - page 108 / 279
» Dynamic Data Structure Analysis for Java Programs
Sort
View
SCN
2008
Springer
136views Communications» more  SCN 2008»
14 years 9 months ago
An efficient data structure for network anomaly detection
Abstract-- Despite the rapid advance in networking technologies, detection of network anomalies at high-speed switches/routers is still far from maturity. To push the frontier, two...
Jieyan Fan, Dapeng Wu, Kejie Lu, Antonio Nucci
ASPLOS
2009
ACM
15 years 10 months ago
Leak pruning
Managed languages improve programmer productivity with type safety and garbage collection, which eliminate memory errors such as dangling pointers, double frees, and buffer overfl...
Michael D. Bond, Kathryn S. McKinley
DATESO
2009
101views Database» more  DATESO 2009»
14 years 7 months ago
Using Top Trees For Easy Programming of Tree Algorithms
Top trees are a dynamic self-adjusting data structure that can be used by any tree algorithm. Actually, an arbitrary number of different tree algorithms can use a single structure....
Michal Vajbar
CBSE
2008
Springer
14 years 11 months ago
A Practical Approach for Finding Stale References in a Dynamic Service Platform
The OSGiTM Service Platform is becoming the de facto standard for modularized Java applications. The market of OSGi based COTS components is continuously growing. OSGi specific pro...
Kiev Gama, Didier Donsez
IPPS
1999
IEEE
15 years 2 months ago
An Adaptive, Fault-Tolerant Implementation of BSP for JAVA-Based Volunteer Computing Systems
Abstract. In recent years, there has been a surge of interest in Javabased volunteer computing systems, which aim to make it possible to build very large parallel computing network...
Luis F. G. Sarmenta