Sciweavers

93 search results - page 1 / 19
» Making numerical program analysis fast
Sort
View
IWMM
2007
Springer
122views Hardware» more  IWMM 2007»
14 years 5 months ago
Overlooking roots: a framework for making nondeferred reference-counting garbage collection fast
Numerous optimizations exist for improving the performance of nondeferred reference-counting (RC) garbage collection. Their designs are ad hoc, intended to exploit different count...
Pramod G. Joisha
TNN
1998
85views more  TNN 1998»
13 years 10 months ago
Fast numerical integration of relaxation oscillator networks based on singular limit solutions
—Relaxation oscillations exhibiting more than one time scale arise naturally from many physical systems. When relaxation oscillators are coupled in a way that resembles chemical ...
P. S. Linsay, DeLiang L. Wang
CGO
2010
IEEE
14 years 5 months ago
Level by level: making flow- and context-sensitive pointer analysis scalable for millions of lines of code
We present a practical and scalable method for flow- and contextsensitive (FSCS) pointer analysis for C programs. Our method analyzes the pointers in a program level by level in ...
Hongtao Yu, Jingling Xue, Wei Huo, Xiaobing Feng 0...
FM
2009
Springer
92views Formal Methods» more  FM 2009»
14 years 5 months ago
Field-Sensitive Value Analysis by Field-Insensitive Analysis
Shared and mutable data-structures pose major problems in static analysis and most analyzers are unable to keep track of the values of numeric variables stored in the heap. In this...
Elvira Albert, Puri Arenas, Samir Genaim, Germ&aac...
CIDR
2009
159views Algorithms» more  CIDR 2009»
13 years 12 months ago
RIOT: I/O-Efficient Numerical Computing without SQL
R is a numerical computing environment that is widely popular for statistical data analysis. Like many such environments, R performs poorly for large datasets whose sizes exceed t...
Yi Zhang 0011, Herodotos Herodotou, Jun Yang 0001