Sciweavers

779 search results - page 13 / 156
» A Simple Program Transformation for Parallelism
Sort
View
97
Voted
CC
2001
Springer
177views System Software» more  CC 2001»
15 years 2 months ago
Imperative Program Transformation by Rewriting
Abstract. We present a method of specifying standard imperative program optimisations as a rewrite system. To achieve this we have extended the idea of matching sub-terms in expres...
David Lacey, Oege de Moor
ICMT
2009
Springer
15 years 4 months ago
A Simple Game-Theoretic Approach to Checkonly QVT Relations
Abstract. The QVT Relations (QVT-R) transformation language allows the definition of bidirectional model transformations, which are required in cases where a two (or more) models ...
Perdita Stevens
131
Voted
TSE
2011
107views more  TSE 2011»
14 years 4 months ago
Deriving a Slicing Algorithm via FermaT Transformations
In this paper we present a case study in deriving an algorithm from a formal specification via FermaT transformations. The general method (which is presented in a separate paper)...
Martin P. Ward, Hussein Zedan
SAS
2009
Springer
175views Formal Methods» more  SAS 2009»
15 years 10 months ago
Automatic Parallelization and Optimization of Programs by Proof Rewriting
We show how, given a program and its separation logic proof, one can parallelize and optimize this program and transform its proof simultaneously to obtain a proven parallelized an...
Clément Hurlin
IEEEHPCS
2010
14 years 7 months ago
Reducing memory requirements of stream programs by graph transformations
Stream languages explicitly describe fork-join parallelism and pipelines, offering a powerful programming model for many-core Multi-Processor Systems on Chip (MPSoC). In an embedd...
Pablo de Oliveira Castro, Stéphane Louise, ...