2000 search results - page 136 / 400 » Program Transformation and Proof Transformation |
120
Voted
PEPM
1994
ACM
15 years 7 months ago
1994
ACM
our results using the Fast Fourier Transformation, the N-body attraction problem, and the cubic splines interpolation as examples.We investigate the application of partial evaluati...
108
Voted
PODS
1989
ACM
15 years 7 months ago
1989
ACM
The alternating xpoint of a logic program with negation is de ned constructively. The underlying idea is monotonically to build up a set of negative conclusions until the least xp...
121
Voted
FOCS
1998
IEEE
15 years 7 months ago
1998
IEEE
The speed of many computations is limited not by the number of arithmetic operations but by the time it takes to move and rearrange data in the increasingly complicated memory hie...
144
Voted
JAIR
2007
15 years 3 months ago
2007
Exact Max-SAT solvers, compared with SAT solvers, apply little inference at each node of the proof tree. Commonly used SAT inference rules like unit propagation produce a simpliï¬...
217
Voted
ENTCS
2002
15 years 3 months ago
2002
The paper presents approaches to the validation of optimizing compilers. The emphasis is on aggressive and architecture-targeted optimizations which try to obtain the highest perf...