Sciweavers

974 search results - page 19 / 195
» Hardware Synthesis from Term Rewriting Systems
Sort
View
ACSD
2008
IEEE
135views Hardware» more  ACSD 2008»
13 years 10 months ago
Synthesis of Petri nets from infinite partial languages
In this paper we present an algorithm to synthesize a finite unlabeled place/transition Petri net (p/t-net) from a possibly infinite partial language, which is given by a term ove...
Robin Bergenthum, Jörg Desel, Robert Lorenz, ...
TCS
1998
13 years 8 months ago
Bubbles in Modularity
We provide a global technique, called neatening, for the study of modularity of left-linear Term Rewriting Systems. Objects called bubbles are identi ed as the responsibles of mos...
Massimo Marchiori
FCCM
2011
IEEE
331views VLSI» more  FCCM 2011»
13 years 16 days ago
Synthesis of Platform Architectures from OpenCL Programs
—The problem of automatically generating hardware modules from a high level representation of an application has been at the research forefront in the last few years. In this pap...
Muhsen Owaida, Nikolaos Bellas, Konstantis Dalouka...
ISCAS
1999
IEEE
114views Hardware» more  ISCAS 1999»
14 years 1 months ago
Nonuniformly offset polyphase synthesis of a bandpass signal from complex-envelope samples
In this paper we consider the synthesis of a bandpass signal from complex-envelope samples using a polyphase conversion structure based on periodically nonuniform output samples. ...
D. Scholnik, J. O. Coleman
ICTAC
2004
Springer
14 years 2 months ago
A Proof of Weak Termination Providing the Right Way to Terminate
We give an inductive method for proving weak innermost termination of rule-based programs, from which we automatically infer, for each successful proof, a finite strategy for data...
Olivier Fissore, Isabelle Gnaedig, Hél&egra...