Sciweavers

53 search results - page 1 / 11
» Model Transformations powered by Rewriting Logic
Sort
View
CAISE
2008
Springer
13 years 9 months ago
Model Transformations powered by Rewriting Logic
This paper shows a rigorous approach based on algebraic specications and rewriting logic which makes up for the lack of current transformation languages and oers a balanced rigour-...
Francisco J. Lucas, José Ambrosio Toval &Aa...
CADE
2004
Springer
14 years 7 months ago
Rewriting Logic Semantics: From Language Specifications to Formal Analysis Tools
Formal semantic definitions of concurrent languages, when specified in a well-suited semantic framework and supported by generic and efficient formal tools, can be the basis of pow...
José Meseguer, Grigore Rosu
LATA
2009
Springer
14 years 1 months ago
Termination of Priority Rewriting
Introducing priorities on rules in rewriting increases their expressive power and helps to limit computations. Priority rewriting is used in rule-based programming as well as in f...
Isabelle Gnaedig
SBCCI
2003
ACM
135views VLSI» more  SBCCI 2003»
14 years 8 days ago
Modeling a Reconfigurable System for Computing the FFT in Place via Rewriting-Logic
The growing adoption of reconfigurable architectures opens new implementation alternatives and creates new design challenges. In the case of dynamically reconfigurable architectur...
Mauricio Ayala-Rincón, Rodrigo B. Nogueira,...
ENTCS
2008
85views more  ENTCS 2008»
13 years 7 months ago
Innermost Termination of Rewrite Systems by Labeling
Semantic labeling is a powerful transformation technique for proving termination of term rewrite systems. The semantic part is given by a model or a quasi-model of the rewrite rul...
René Thiemann, Aart Middeldorp