Sciweavers

974 search results - page 10 / 195
» Hardware Synthesis from Term Rewriting Systems
Sort
View
AAECC
2008
Springer
110views Algorithms» more  AAECC 2008»
13 years 9 months ago
Adding constants to string rewriting
We consider unary term rewriting, i.e., term rewriting with unary signatures where all function symbols are either unary or constants. Terms over such signatures can be transformed...
René Thiemann, Hans Zantema, Jürgen Gi...
ENTCS
2006
176views more  ENTCS 2006»
13 years 8 months ago
Automatic Formal Synthesis of Hardware from Higher Order Logic
A compiler that automatically translates recursive function definitions in higher order logic to clocked synchronous hardware is described. Compilation is by mechanised proof in t...
Mike Gordon, Juliano Iyoda, Scott Owens, Konrad Sl...
WADT
1997
Springer
14 years 27 days ago
An inductive view of graph transformation
The dynamic behavior of rule-based systems (like term rewriting systems 24], process algebras 27], and so on) can be traditionally determined in two orthogonal ways. Either operati...
Fabio Gadducci, Reiko Heckel
GLVLSI
2002
IEEE
95views VLSI» more  GLVLSI 2002»
14 years 1 months ago
Term ordering problem on MDG
As an efficient representation of Extended Finite State Machines, Multiway Decision Graphs (MDG) are suitable for automatic hardware verification of Register Transfer Level (RTL) ...
Yi Feng, Eduard Cerny
ISSS
2000
IEEE
144views Hardware» more  ISSS 2000»
14 years 1 months ago
Efficient Hardware Controller Synthesis for Synchronous Dataflow Graph in System Level Design
This paper concerns automatic hardware synthesis from data flow graph (DFG) specification in system level design. In the presented design methodology, each node of a data flow gra...
Hyunuk Jung, Kangnyoung Lee, Soonhoi Ha