Sciweavers

1452 search results - page 65 / 291
» Algorithmic Analysis of Array-Accessing Programs
Sort
View
SAS
2007
Springer
124views Formal Methods» more  SAS 2007»
14 years 4 months ago
Arithmetic Strengthening for Shape Analysis
Abstract. Shape analyses are often imprecise in their numerical reasoning, whereas numerical static analyses are often largely unaware of the shape of a program’s heap. In this p...
Stephen Magill, Josh Berdine, Edmund M. Clarke, By...
JUCS
2006
92views more  JUCS 2006»
13 years 10 months ago
Program Slicing by Calculation
: Program slicing is a well known family of techniques used to identify code fragments which depend on or are depended upon specific program entities. They are particularly useful ...
Nuno F. Rodrigues, Luís Soares Barbosa
AMC
2007
115views more  AMC 2007»
13 years 10 months ago
Evolutionary programming based on non-uniform mutation
Abstract–A new evolutionary programming algorithm (NEP) using the non-uniform mutation operator instead of Gaussian or Cauchy mutation operators is proposed. NEP has the merits o...
Xinchao Zhao, Xiao-Shan Gao, Ze-Chun Hu
JDA
2006
85views more  JDA 2006»
13 years 10 months ago
Average case analysis of DJ graphs
Abstract. Sreedhar et al. [SGL98, Sre95] have presented an eliminationbased algorithm to solve data flow problems. A thorough analysis of the algorithm shows that the worst-case pe...
Johann Blieberger
PLDI
2006
ACM
14 years 3 months ago
LOCKSMITH: context-sensitive correlation analysis for race detection
One common technique for preventing data races in multi-threaded programs is to ensure that all accesses to shared locations are consistently protected by a lock. We present a too...
Polyvios Pratikakis, Jeffrey S. Foster, Michael W....