Sciweavers

50 search results - page 5 / 10
» Fundamental Theory for Typed Attributed Graph Transformation
Sort
View
ICFP
2008
ACM
14 years 7 months ago
From ML to MLF: graphic type constraints with efficient type inference
MLF is a type system that seamlessly merges ML-style type inference with System-F polymorphism. We propose a system of graphic (type) constraints that can be used to perform type ...
Boris Yakobowski, Didier Rémy
ENTCS
2008
72views more  ENTCS 2008»
13 years 7 months ago
Towards a Notion of Transaction in Graph Rewriting
We define transactional graph transformation systems (t-gtss), a mild extension of the ordinary framework for the double-pushout approach to graph transformation, which allows to ...
Paolo Baldan, Andrea Corradini, Fernando Luí...
VL
2005
IEEE
123views Visual Languages» more  VL 2005»
14 years 1 months ago
A Visually-Specified Code Generator for Simulink/Stateflow
On one hand, visual modeling languages are often used today in engineering domains, Mathworks’ Simulink/Stateflow for simulation, signal processing and controls being the prime ...
Sandeep Neema, Zsolt Kalmar, Feng Shi, Attila Vizh...
ENTCS
2006
153views more  ENTCS 2006»
13 years 7 months ago
Towards Model Transformation in Generated Eclipse Editor Plug-Ins
With the growing importance of model-driven development, the ability of transforming models into well-defined semantic domains becomes a key to automated code generation or verifi...
Karsten Ehrig, Claudia Ermel, Stefan Hänsgen
LATA
2009
Springer
14 years 2 months ago
Monadic Second-Order Logic for Graphs: Algorithmic and Language Theoretical Applications
This tutorial will present an overview of the use of Monadic Second-Order Logic to describe sets of finite graphs and graph transformations, in relation with the notions of tree-w...
Bruno Courcelle