94 search results - page 8 / 19 » Instruction selection by graph transformation |
SYNASC
2007
IEEE
14 years 1 months ago
2007
IEEE
In this paper, we present a rewriting framework for modeling molecular complexes, biochemical reaction rules, and generation of biochemical networks based on the representation of...
EMSOFT
2010
Springer
13 years 5 months ago
2010
Springer
We propose the first polynomial-time code selection algorithm for minimising the worst-case execution time of a nonnested loop executed on a fully pipelined processor that uses sc...
CC
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Writing an optimizing back end is expensive, in part because it requires mastery of both a target machine and a compiler's internals. We separate these concerns by i...
CASES
2007
ACM
13 years 11 months ago
2007
ACM
We present an efficient framework for dynamic reconfiguration of application-specific custom instructions. A key component of this framework is an iterative algorithm for temporal...
GG
2008
Springer
13 years 8 months ago
2008
Springer
This event is the second instance of the contest for graph transformation-based tools, which was first held as part of the AGTIVE workshop. The aim is to stimulate tool developmen...