Sciweavers

866 search results - page 2 / 174
» Bidirectionalizing graph transformations
Sort
View
POPL
2009
ACM
14 years 5 months ago
Bidirectionalization for free! (Pearl)
A bidirectional transformation consists of a function get that takes a source (document or value) to a view and a function put that takes an updated view and the original source b...
Janis Voigtländer
CORR
2002
Springer
135views Education» more  CORR 2002»
13 years 4 months ago
Randomized Approximation Schemes for Cuts and Flows in Capacitated Graphs
We improve on random sampling techniques for approximately solving problems that involve cuts and flows in graphs. We give a near-linear-time construction that transforms any grap...
András A. Benczúr, David R. Karger
STTT
2010
134views more  STTT 2010»
13 years 3 months ago
A case study to evaluate the suitability of graph transformation tools for program refactoring
This article proposes a case study to evaluate the suitability of graph transformation tools for program refactoring. In order to qualify for this purpose, a graph transformation s...
Francisco Javier Pérez, Yania Crespo, Berth...
CORR
2010
Springer
178views Education» more  CORR 2010»
13 years 3 months ago
Towards A Shape Analysis for Graph Transformation Systems
Graphs and graph transformation systems are a frequently used modelling technique for a wide range of different domains, covering areas as diverse as refactorings, network topolog...
Dominik Steenken, Heike Wehrheim, Daniel Wonisch
FAC
2010
148views more  FAC 2010»
13 years 3 months ago
Automating the transformation-based analysis of visual languages
We present a novel approach for the automatic generation of model-to-model transformations given a description of the operational semantics of the source language in the form of gr...
Juan de Lara, Hans Vangheluwe