201 search results - page 12 / 41 » Scalability analysis of SPMD codes using expectations |
105
click to vote
PEPM
2009
ACM
15 years 10 months ago
2009
ACM
The goal of the Parfait project is to find bugs in C source code in a scalable and precise way. To this end, Parfait was designed as a framework with layers of sound program anal...
134
click to vote
SIGSOFT
2003
ACM
16 years 2 months ago
2003
ACM
Memory corruption errors lead to non-deterministic, elusive crashes. This paper describes ARCHER (ARray CHeckER) a static, effective memory access checker. ARCHER uses path-sensit...
246
click to vote
PLDI
2009
ACM
16 years 2 months ago
2009
ACM
High-level languages are growing in popularity. However, decades of C software development have produced large libraries of fast, timetested, meritorious code that are impractical...
114
click to vote
ICCD
2004
IEEE
15 years 10 months ago
2004
IEEE
In this paper, an efficient Montgomery multiplier is introduced for the modular exponentiation operation, which is fundamental to numerous public-key cryptosystems. Four aspects a...
105
click to vote
SAC
1998
ACM
15 years 6 months ago
1998
ACM
The fast messy genetic algorithm (fmGA) belongs to a class of algorithms inspired by the principles of evolution, known appropriately as "evolutionary algorithms" (EAs)....