Sciweavers

1550 search results - page 9 / 310
» Benchmarking for Graph Transformation
Sort
View
TCAD
2002
145views more  TCAD 2002»
14 years 11 months ago
Automatic generation of synthetic sequential benchmark circuits
The design of programmable logic architectures and supporting computer-aided design tools fundamentally requires both a good understanding of the combinatorial nature of netlist gr...
Michael D. Hutton, Jonathan Rose, Derek G. Corneil
CONCUR
2001
Springer
15 years 4 months ago
A Static Analysis Technique for Graph Transformation Systems
In this paper we introduce a static analysis technique for graph transformation systems. We present an algorithm which, given a graph transformation system and a start graph, produ...
Paolo Baldan, Andrea Corradini, Barbara König
PEPM
2007
ACM
15 years 5 months ago
Lowering: a static optimization technique for transparent functional reactivity
Functional Reactive Programming (frp) extends traditional functional programming with dataflow evaluation, making it possible to write interactive programs in a declarative style...
Kimberley Burchett, Gregory H. Cooper, Shriram Kri...
ENTCS
2006
154views more  ENTCS 2006»
14 years 11 months ago
Applying a Model Transformation Taxonomy to Graph Transformation Technology
A taxonomy of model transformations was introduced in [18]. Among others, such a taxonomy can help developers in deciding which language, forma lism, tool or mechanism is best sui...
Tom Mens, Pieter Van Gorp, Dániel Varr&oacu...
FPGA
2010
ACM
243views FPGA» more  FPGA 2010»
15 years 8 months ago
Bit-level optimization for high-level synthesis and FPGA-based acceleration
d hardware design from behavior-level abstraction has drawn wide interest in FPGA-based acceleration and configurable computing research field. However, for many high-level progra...
Jiyu Zhang, Zhiru Zhang, Sheng Zhou, Mingxing Tan,...