258 search results - page 28 / 52 » Static Semantics as Program Transformation and Well-founded ... |
168
Voted
CC
2012
Springer
13 years 11 months ago
2012
Springer
Abstract. How can we exploit a microprocessor as efficiently as possible? The “classic” approach is static optimization at compile-time, optimizing a program for all possible u...
166
Voted
POPL
2011
ACM
14 years 6 months ago
2011
ACM
A number of deterministic parallel programming models with strong safety guarantees are emerging, but similar support for nondeterministic algorithms, such as branch and bound sea...
129
Voted
POPL
1995
ACM
15 years 7 months ago
1995
ACM
Program slicing is a technique for isolating computational threads in programs. In this paper, we show how to mechanically extract a family of practical algorithms for computing s...
124
click to vote
ICFP
2006
ACM
16 years 3 months ago
2006
ACM
Monads are widely used in Haskell for modeling computational effects, but defining monads remains a daunting challenge. Since every part of a monad's definition depends on it...
164
click to vote
CC
1998
Springer
15 years 8 months ago
1998
Springer
Abstract. Flow logic offers a compact and versatile notation for expressing the acceptability of solutions to program analysis problems. In contrast to previous logical formulation...