Sciweavers

378 search results - page 52 / 76
» Automating Mathematical Program Transformations
Sort
View
FOAL
2009
ACM
15 years 4 months ago
Graph-based specification and simulation of featherweight Java with around advice
In this paper we specify an operational run-time semantics of Assignment Featherweight Java -- a minimal subset of Java with assignments -- with around advice, using graph transfo...
Tom Staijen, Arend Rensink
DAC
2009
ACM
16 years 1 months ago
Retiming and recycling for elastic systems with early evaluation
Retiming and recycling are two transformations used to optimize the performance of latency-insensitive (a.k.a. synchronous elastic) systems. This paper presents an approach that c...
Dmitry Bufistov, Jordi Cortadella, Marc Galceran O...
LPAR
2004
Springer
15 years 6 months ago
Second-Order Matching via Explicit Substitutions
Abstract. Matching is a basic operation extensively used in computation. Second-order matching, in particular, provides an adequate environment for expressing program transformatio...
Flávio L. C. de Moura, Fairouz Kamareddine,...
86
Voted
LOPSTR
1998
Springer
15 years 4 months ago
Improving Homeomorphic Embedding for Online Termination
Well-quasi orders in general, and homeomorphic embedding in particular, have gained popularity to ensure online termination of program analysis, specialisation and transformation t...
Michael Leuschel
FLOPS
2008
Springer
15 years 2 months ago
Semantics and Pragmatics of New Shortcut Fusion Rules
We study various shortcut fusion rules for languages like Haskell. Following a careful semantic account of a recently proposed rule for circular program transformation, we propose ...
Janis Voigtländer