Sciweavers

242 search results - page 9 / 49
» Finding effective compilation sequences
Sort
View
OOPSLA
2005
Springer
15 years 8 months ago
Finding application errors and security flaws using PQL: a program query language
A number of effective error detection tools have been built in recent years to check if a program conforms to certain design rules. An important class of design rules deals with s...
Michael C. Martin, V. Benjamin Livshits, Monica S....
LCTRTS
2000
Springer
15 years 6 months ago
Automatic Validation of Code-Improving Transformations
This paper presents a general approach to automatically validate code-improving transformations on low-level program representations. The approach ensures the correctness of compi...
Robert van Engelen, David B. Whalley, Xin Yuan
KDD
2003
ACM
194views Data Mining» more  KDD 2003»
16 years 2 months ago
Finding recent frequent itemsets adaptively over online data streams
A data stream is a massive unbounded sequence of data elements continuously generated at a rapid rate. Consequently, the knowledge embedded in a data stream is more likely to be c...
Joong Hyuk Chang, Won Suk Lee
BMCBI
2007
106views more  BMCBI 2007»
15 years 2 months ago
Modeling SAGE tag formation and its effects on data interpretation within a Bayesian framework
Background: Serial Analysis of Gene Expression (SAGE) is a high-throughput method for inferring mRNA expression levels from the experimentally generated sequence based tags. Stand...
Michael A. Gilchrist, Hong Qin, Russell L. Zaretzk...
112
Voted
CGO
2006
IEEE
15 years 8 months ago
Exhaustive Optimization Phase Order Space Exploration
The phase-ordering problem is a long standing issue for compiler writers. Most optimizing compilers typically have numerous different code-improving phases, many of which can be a...
Prasad Kulkarni, David B. Whalley, Gary S. Tyson, ...