Sciweavers

911 search results - page 76 / 183
» Combining programs and state machines
Sort
View
CGO
2006
IEEE
14 years 2 months ago
Fast and Effective Orchestration of Compiler Optimizations for Automatic Performance Tuning
Although compile-time optimizations generally improve program performance, degradations caused by individual techniques are to be expected. One promising research direction to ove...
Zhelong Pan, Rudolf Eigenmann
ICFP
2005
ACM
14 years 8 months ago
Monadic augment and generalised short cut fusion
Monads are commonplace programming devices that are used to uniformly structure computations with effects such as state, exceptions, and I/O. This paper further develops the monad...
Neil Ghani, Patricia Johann, Tarmo Uustalu, Varmo ...
LFP
1990
73views more  LFP 1990»
13 years 10 months ago
Lazy Task Creation: A Technique for Increasing the Granularity of Parallel Programs
Many parallel algorithms are naturally expressed at a ne level of granularity, often ner than a MIMD parallel system can exploit eciently. Most builders of parallel systems have...
Eric Mohr, David A. Kranz, Robert H. Halstead Jr.
POPL
2009
ACM
14 years 9 months ago
Semi-sparse flow-sensitive pointer analysis
Pointer analysis is a prerequisite for many program analyses, and the effectiveness of these analyses depends on the precision of the pointer information they receive. Two major a...
Ben Hardekopf, Calvin Lin
JFP
2000
163views more  JFP 2000»
13 years 8 months ago
Automatic useless-code elimination for HOT functional programs
In this paper we present two type inference systems for detecting useless-code in higher-order typed functional programs. Type inference can be performed in an efficient and compl...
Ferruccio Damiani, Paola Giannini