Sciweavers

974 search results - page 15 / 195
» Hardware Synthesis from Term Rewriting Systems
Sort
View
CODES
2008
IEEE
14 years 3 months ago
Symbolic voter placement for dependability-aware system synthesis
This paper presents a system synthesis approach for dependable embedded systems. The proposed approach significantly extends previous work by automatically inserting fault detect...
Felix Reimann, Michael Glabeta, Martin Lukasiewycz...
ISSS
1999
IEEE
151views Hardware» more  ISSS 1999»
14 years 1 months ago
Optimized System Synthesis of Complex RT Level Building Blocks from Multirate Dataflow Graphs
In order to cope with the ever increasing complexity of todays application specific integrated circuits, a building block based design methodology is established. The system is co...
Jens Horstmannshoff, Heinrich Meyr
ENTCS
2007
105views more  ENTCS 2007»
13 years 8 months ago
Narrowing and Rewriting Logic: from Foundations to Applications
Narrowing was originally introduced to solve equational E-unification problems. It has also been recognized as a key mechanism to unify functional and logic programming. In both ...
Santiago Escobar, José Meseguer, Prasanna T...
EH
1999
IEEE
351views Hardware» more  EH 1999»
14 years 1 months ago
Evolvable Hardware or Learning Hardware? Induction of State Machines from Temporal Logic Constraints
Here we advocate an approach to learning hardware based on induction of finite state machines from temporal logic constraints. The method involves training on examples, constraint...
Marek A. Perkowski, Alan Mishchenko, Anatoli N. Ch...
CORR
2006
Springer
120views Education» more  CORR 2006»
13 years 8 months ago
Termination orders for 3-dimensional rewriting
Abstract: This paper studies 3-polygraphs as a framework for rewriting on two-dimensional words. A translation of term rewriting systems into 3-polygraphs with explicit resource ma...
Yves Guiraud