Sciweavers

98 search results - page 3 / 20
» The case for analysis preserving language transformation
Sort
View
LOPSTR
1994
Springer
13 years 11 months ago
A Transformation System for Definite Programs Based on Termination Analysis
We present a goal replacement rule whose main applicability condition is based on termination properties of the resulting transformed program. The goal replacement rule together wi...
J. Cook, John P. Gallagher
CASES
2006
ACM
14 years 1 months ago
High-level languages for small devices: a case study
In this paper we study, through a concrete case, the feasibility of using a high-level, general-purpose logic language in the design and implementation of applications targeting w...
Manuel Carro, José F. Morales, Henk L. Mull...
HICSS
2007
IEEE
135views Biometrics» more  HICSS 2007»
14 years 1 months ago
Composable Language Extensions for Computational Geometry: A Case Study
— This paper demonstrates how two different sets of powerful domain specific language features can be specified and deployed as composable language extensions. These extensions...
Eric Van Wyk, Eric Johnson
GG
2008
Springer
13 years 8 months ago
Semantical Correctness and Completeness of Model Transformations Using Graph and Rule Transformation
An important requirement of model transformations is the preservation of the behavior of the original model. A model transformation is semantically correct if for each simulation r...
Hartmut Ehrig, Claudia Ermel
PPDP
2007
Springer
14 years 1 months ago
Relational semantics for effect-based program transformations with dynamic allocation
We give a denotational semantics to a region-based effect system tracking reading, writing and allocation in a higher-order language with dynamically allocated integer references....
Nick Benton, Andrew Kennedy, Lennart Beringer, Mar...