Sciweavers

1559 search results - page 8 / 312
» The Semantics of Future and Its Use in Program Optimizations
Sort
View
OOPSLA
2005
Springer
15 years 3 months ago
Safe futures for Java
is a simple and elegant abstraction that allows concurrency to be expressed often through a relatively small rewrite of a sequential program. In the absence of side-effects, futur...
Adam Welc, Suresh Jagannathan, Antony L. Hosking
ENTCS
2007
104views more  ENTCS 2007»
14 years 9 months ago
Algorithmic Debugging of Java Programs
In this paper we propose applying the ideas of declarative debugging to the object-oriented language Java as an alternative to traditional trace debuggers used in imperative langu...
Rafael Caballero, Christian Hermanns, Herbert Kuch...
POPL
2002
ACM
15 years 10 months ago
Proving correctness of compiler optimizations by temporal logic
Many classical compiler optimizations can be elegantly expressed using rewrite rules of form: I = I if , where I, I are intermediate language instructions and is a property expre...
David Lacey, Neil D. Jones, Eric Van Wyk, Carl Chr...
DYNAMO
2000
87views more  DYNAMO 2000»
14 years 11 months ago
Overcoming the Challenges to Feedback-Directed Optimization
Feedback-directed optimization (FDO) is a general term used to describe any technique that alters a program's execution based on tendencies observed in its present or past ru...
Michael D. Smith
LISP
2008
104views more  LISP 2008»
14 years 9 months ago
On the implementation of automatic differentiation tools
Automatic differentiation is a semantic transformation that applies the rules of differential calculus to source code. It thus transforms a computer program that computes a mathema...
Christian H. Bischof, Paul D. Hovland, Boyana Norr...