Sciweavers

39 search results - page 1 / 8
» Simulation as a Correct Transformation of Rewrite Systems
Sort
View
MFCS
1997
Springer
13 years 8 months ago
Simulation as a Correct Transformation of Rewrite Systems
Abstract. Kamperman and Walters proposed the notion of a simulation of one rewrite system by another one, whereby each term of the simulating rewrite system is related to a term in...
Wan Fokkink, Jaco van de Pol
PPDP
2005
Springer
13 years 10 months ago
Program transformation by templates based on term rewriting
Huet and Lang (1978) presented a framework of automated program transformation based on lambda calculus in which programs are transformed according to a given program transformati...
Yuki Chiba, Takahito Aoto, Yoshihito Toyama
EUROMICRO
1996
IEEE
13 years 9 months ago
A Graph Rewriting Approach for Transformational Design of Digital Systems
Transformational design integrates design and verification. It combines "correctness by construciion" and design creativity by the use ofpre-proven behaviour preserving ...
Corrie Huijs
GG
2008
Springer
13 years 5 months ago
Semantical Correctness and Completeness of Model Transformations Using Graph and Rule Transformation
An important requirement of model transformations is the preservation of the behavior of the original model. A model transformation is semantically correct if for each simulation r...
Hartmut Ehrig, Claudia Ermel
LATA
2009
Springer
13 years 9 months ago
On Parallel Communicating Grammar Systems and Correctness Preserving Restarting Automata
Abstract. This paper contributes to the study of Freely Rewriting Restarting Automata (FRR-automata) and Parallel Communicating Grammar Systems (PCGS) as formalizations of the ling...
Dana Pardubská, Martin Plátek, Fried...