Sciweavers

1153 search results - page 56 / 231
» Reversing graph transformations
Sort
View
CASES
2010
ACM
13 years 8 months ago
Instruction selection by graph transformation
Common generated instruction selections are based on tree pattern matching, but modern and custom architectures feature instructions, which cannot be covered by trees. To overcome...
Sebastian Buchwald, Andreas Zwinkau
ENTCS
2008
153views more  ENTCS 2008»
13 years 9 months ago
Efficient Conflict Detection in Graph Transformation Systems by Essential Critical Pairs
The well-known notion of critical pairs already allows a static conflict detection, which is important for all kinds of applications and already implemented in AGG. Unfortunately ...
Leen Lambers, Hartmut Ehrig, Fernando Orejas
ASAP
2010
IEEE
143views Hardware» more  ASAP 2010»
13 years 11 months ago
Loop transformations for interface-based hierarchies IN SDF graphs
Data-flow has proven to be an attractive computation model for programming digital signal processing (DSP) applications. A restricted version of data-flow, termed synchronous data...
Jonathan Piat, Shuvra S. Bhattacharyya, Mickaë...
MODELS
2007
Springer
14 years 4 months ago
Scenario Integration via the Transformation and Manipulation of Higher-order Graphs
The integration of different models, such as scenarios, is an important component of the requirements engineer’s work. If manually performed, the integration operation is error-...
Hongzhi Liang
GLVLSI
2002
IEEE
160views VLSI» more  GLVLSI 2002»
14 years 2 months ago
Computing walsh, arithmetic, and reed-muller spectral decision diagrams using graph transformations
Spectral techniques have found many applications in computeraided design, including synthesis, verification, and testing. Decision diagram representations permit spectral coeffici...
Whitney J. Townsend, Mitchell A. Thornton, Rolf Dr...