Sciweavers

3507 search results - page 24 / 702
» Slicing for architectural analysis
Sort
View
SLP
1997
89views more  SLP 1997»
15 years 7 months ago
Program Analysis via Graph Reachability
This paper describes how a number of program-analysis problems can be solved by transforming them to graph-reachability problems. Some of the program-analysis problems that are am...
Thomas W. Reps
DEXA
2000
Springer
132views Database» more  DEXA 2000»
15 years 10 months ago
Improving the Performance of High-Energy Physics Analysis through Bitmap Indices
Abstract. Bitmap indices are popular multi-dimensional data structures for accessing read-mostly data such as data warehouse (DW) applications, decision support systems (DSS) and o...
Kurt Stockinger, Dirk Düllmann, Wolfgang Hosc...
ICDE
2009
IEEE
120views Database» more  ICDE 2009»
16 years 24 days ago
Recommending Join Queries via Query Log Analysis
— Complex ad hoc join queries over enterprise databases are commonly used by business data analysts to understand and analyze a variety of enterprise-wide processes. However, eff...
Xiaoyan Yang, Cecilia M. Procopiuc, Divesh Srivast...
LICS
2009
IEEE
16 years 19 days ago
Clipping: A Semantics-Directed Syntactic Approximation
In this paper we introduce “clipping,” a new method of syntactic approximation which is motivated by and works in conjunction with a sound and decidable denotational model for...
Dan R. Ghica, Adam Bakewell
POPL
1999
ACM
15 years 10 months ago
A Core Calculus of Dependency
Notions of program dependency arise in many settings: security, partial evaluation, program slicing, and call-tracking. We argue that there is a central notion of dependency commo...
Martín Abadi, Anindya Banerjee, Nevin Heint...