2000 search results - page 128 / 400 » Program Transformation and Proof Transformation |
109
Voted
ICFP
2007
ACM
16 years 3 months ago
2007
ACM
User-defined data types, pattern-matching, and recursion are ubiquitous features of Haskell programs. Sometimes a function is called with arguments that are statically known to be...
137
Voted
IWMM
2000
Springer
15 years 7 months ago
2000
Springer
We investigate reference counting in the context of a multithreaded architecture by exploiting two observations: (1) reference-counting can be performed by a transformed program s...
155
Voted
IPPS
2000
IEEE
15 years 8 months ago
2000
IEEE
This paper presents a new approach to improve performance of Java programs by extending the superthreaded speculative execution model [14, 15] to exploit coarsegrained parallelism...
128
Voted
CC
2000
Springer
15 years 7 months ago
2000
Springer
A fast and scalable interprocedural escape analysis algorithm is presented. The analysis computes a description of a subset of created objects whose lifetime is bounded by the life...
148
Voted
AGTIVE
2007
Springer
15 years 9 months ago
2007
Springer
In this article, we propose to use the Discrete EVent system Specification (DEVS) formalism to describe and execute graph transformation control structures. We provide a short rev...