Sciweavers

330 search results - page 32 / 66
» Analyzing Large Spreadsheet Programs
Sort
View
ASPLOS
2009
ACM
15 years 5 months ago
Gordon: using flash memory to build fast, power-efficient clusters for data-intensive applications
As our society becomes more information-driven, we have begun to amass data at an astounding and accelerating rate. At the same time, power concerns have made it difficult to brin...
Adrian M. Caulfield, Laura M. Grupp, Steven Swanso...
CSFW
2010
IEEE
15 years 5 months ago
Approximation and Randomization for Quantitative Information-Flow Analysis
—Quantitative information-flow analysis (QIF) is an emerging technique for establishing information-theoretic confidentiality properties. Automation of QIF is an important step...
Boris Köpf, Andrey Rybalchenko
ASPLOS
2006
ACM
15 years 5 months ago
Instruction scheduling for a tiled dataflow architecture
This paper explores hierarchical instruction scheduling for a tiled processor. Our results show that at the top level of the hierarchy, a simple profile-driven algorithm effective...
Martha Mercaldi, Steven Swanson, Andrew Petersen, ...
ISSTA
2012
ACM
13 years 4 months ago
Residual investigation: predictive and precise bug detection
We introduce the concept of “residual investigation” for program analysis. A residual investigation is a dynamic check installed as a result of running a static analysis that ...
Kaituo Li, Christoph Reichenbach, Christoph Csalln...
132
Voted
KBSE
2005
IEEE
15 years 7 months ago
Optimized run-time race detection and atomicity checking using partial discovered types
Concurrent programs are notorious for containing errors that are difficult to reproduce and diagnose. Two common kinds of concurrency errors are data races and atomicity violation...
Rahul Agarwal, Amit Sasturkar, Liqiang Wang, Scott...