1357 search results - page 150 / 272 » Compositionality in Graph Transformation |
128
click to vote
JSAT
2006
15 years 3 months ago
2006
A family of satisfiable benchmark instances in conjunctive normal form is introduced. The instances are constructed by transforming a random regular graph into a system of linear ...
124
click to vote
ACL
2010
15 years 1 months ago
2010
Wikipedia articles in different languages are connected by interwiki links that are increasingly being recognized as a valuable source of cross-lingual information. Unfortunately,...
233
click to vote
MICRO
2012
IEEE
13 years 6 months ago
2012
IEEE
This article presents a general algorithm for transforming sequential imperative programs into parallel data-flow programs. Our algorithm operates on a program dependence graph i...
126
click to vote
FASE
2009
Springer
15 years 7 months ago
2009
Springer
Activity diagrams are a well-known means to model the control flow of system behavior. Their expressiveness can be enhanced by using their object flow notation. In addition, we ref...
150
click to vote
LATA
2009
Springer
15 years 10 months ago
2009
Springer
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...