Sciweavers

2947 search results - page 367 / 590
» Analyzing Program Analyses
Sort
View
ASPLOS
2009
ACM
15 years 10 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 10 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 10 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, ...
202
Voted
EDBT
1992
ACM
111views Database» more  EDBT 1992»
15 years 10 months ago
Pipelined Query Processing in the DBGraph Storage Model
The DBGraph storage model, designed for main memory DBMS, ensures both data storage compactness and efficient processing for all database operations. By representing the entire da...
Philippe Pucheral, Jean-Marc Thévenin
ESWS
2010
Springer
15 years 8 months ago
Dealing with Inconsistency When Combining Ontologies and Rules Using DL-Programs
Abstract. Description Logic Programs (DL-programs) have been introduced to combine ontological and rule-based reasoning in the context of the Semantic Web. A DL-program loosely com...
Jörg Pührer, Stijn Heymans, Thomas Eiter