## Internal Strategies in a Rewriting Implementation of Tile Systems (1998)

Venue: | Rewriting Logic and its Applications, volume 15 of Electronic Notes in Theoretical Computer Science. Elsevier Sciences |

Citations: | 16 - 11 self |

### BibTeX

@INPROCEEDINGS{Bruni98internalstrategies,

author = {R. Bruni and J. Meseguer and U. Montanari},

title = {Internal Strategies in a Rewriting Implementation of Tile Systems},

booktitle = {Rewriting Logic and its Applications, volume 15 of Electronic Notes in Theoretical Computer Science. Elsevier Sciences},

year = {1998},

pages = {1--5},

publisher = {Elsevier}

}

### OpenURL

### Abstract

Tile logic extends rewriting logic, taking into account rewriting with side-effects and rewriting synchronization. Since rewriting logic is the semantic basis of several language implementation efforts, it is interesting to map tile logic back into rewriting logic in a conservative way, to obtain executable specifications of tile systems. The resulting implementation requires a meta-layer to control the rewritings, so that only tile proofs are accepted. However, by exploiting the reflective capabilities of the Maude language, such meta-layer can be specified as a kernel of internal strategies. It turns out that the required strategies are very general and can be reformulated in terms of search algorithms for non-confluent systems equipped with a notion of success. We formalize such strategies, giving their detailed description in Maude, and showing their application to modeling uniform tile systems. 1 Introduction The evolution of a process in a concurrent system often depends on the ...

### Citations

124 | Principles of Maude
- Clavel, Eker, et al.
- 1996
(Show Context)
Citation Context ...ional case), taking into account rewriting with side effects and rewriting synchronization. On the other hand, since there exist several languages based on rewriting logic (Cafe [16], ELAN [3], Maude =-=[9]-=-), the implementation of a conservative mapping of tile logic into rewriting logic would facilitate the execution and development of tile specifications. This topic has been extensively investigated i... |

88 | ELAN: A logical framework based on computational systems
- Borovansky, Kirchner, et al.
(Show Context)
Citation Context ... non-conditional case), taking into account rewriting with side effects and rewriting synchronization. On the other hand, since there exist several languages based on rewriting logic (Cafe [16], ELAN =-=[3]-=-, Maude [9]), the implementation of a conservative mapping of tile logic into rewriting logic would facilitate the execution and development of tile specifications. This topic has been extensively inv... |

62 | Reflection and strategies in rewriting logic
- Clavel, Meseguer
- 1996
(Show Context)
Citation Context ...rovided that the rewriting engine is able to select, among all the possible rewriting computations, those interpreting tile logic derivations. For this purpose, we exploit the reflective capabilities =-=[10,11]-=- of the Maude language [9,8] developed at SRI, defining suitable internal strategies [12], which can help the user to collect and analyze the possible computations and results. A key point is that the... |

43 |
Observing localities
- Boudol, Castellani, et al.
- 1991
(Show Context)
Citation Context ...s sections only for the simple example of finite CCS . We refer the reader to [6] for a more interesting example dealing with the tile system proposed by Ferrari and Montanari in [15] for located CCS =-=[4]-=-. Milner's Calculus for Communicating Systems (CCS) [27] is among the more well-known and studied concurrency models. We present here an executable tile specification for a fragment of CCS, called fin... |

41 | Controlling Rewriting by Rewriting - Borovanský, Kirchner, et al. - 1996 |

35 |
Reflection in general logics and in rewriting logic, with applications to the Maude language
- Clavel
- 1998
(Show Context)
Citation Context ... 2 C), we get a reflective tower: T ` ' () U ` T ` ' () U ` U ` T ` ' \Delta \Delta \Delta The class of finitely presentable rewrite theories has universal theories, making rewriting logic reflective =-=[10,7]-=-. A rewrite theory T consists of a signature \Sigma, a set E of equations, and a set of labelled rewrite rules. The deductions of T are rewrites modulo E using such rules, and the meaningful sentences... |

35 | Axiomatizing Reflective Logics and Languages
- Clavel, Meseguer
- 1996
(Show Context)
Citation Context ...rovided that the rewriting engine is able to select, among all the possible rewriting computations, those interpreting tile logic derivations. For this purpose, we exploit the reflective capabilities =-=[10,11]-=- of the Maude language [9,8] developed at SRI, defining suitable internal strategies [12], which can help the user to collect and analyze the possible computations and results. A key point is that the... |

34 | Process and term tile logic
- Bruni, Meseguer, et al.
- 1998
(Show Context)
Citation Context ... the implementation of a conservative mapping of tile logic into rewriting logic would facilitate the execution and development of tile specifications. This topic has been extensively investigated in =-=[26,6]-=-. From a practical point of view, the mapping becomes effective provided that the rewriting engine is able to select, among all the possible rewriting computations, those interpreting tile logic deriv... |

34 | A 2-categorical presentation of term graph rewriting - Corradini, Gadducci - 1997 |

24 | On the Algebraic Approach to Concurrent Term Rewriting
- Gadducci
- 1996
(Show Context)
Citation Context ...Meseguer, and Montanari non-deterministic choices in the body of a process. Such a mechanism should allow local choices to be coordinated, affecting the global evolution of the system. The tile model =-=[17,19]-=- is a formalism for modular descriptions of concurrent systems. Basically, a set of rules defines the behaviour of certain modules (a module is just an open, e.g., partially specified, configuration o... |

21 | Internal Strategies in a Reflective Logic
- Clavel, Meseguer
- 1997
(Show Context)
Citation Context ...ations, those interpreting tile logic derivations. For this purpose, we exploit the reflective capabilities [10,11] of the Maude language [9,8] developed at SRI, defining suitable internal strategies =-=[12]-=-, which can help the user to collect and analyze the possible computations and results. A key point is that the internal strategies needed to embed tile systems in rewriting logic are for the most par... |

19 |
An Introduction to Maude (Beta Version
- Clavel, Durn, et al.
- 1998
(Show Context)
Citation Context ...ine is able to select, among all the possible rewriting computations, those interpreting tile logic derivations. For this purpose, we exploit the reflective capabilities [10,11] of the Maude language =-=[9,8]-=- developed at SRI, defining suitable internal strategies [12], which can help the user to collect and analyze the possible computations and results. A key point is that the internal strategies needed ... |

15 |
Multiple functors I, Limits relative to double categories
- Bastiani, Ehresmann
- 1974
(Show Context)
Citation Context ... a cartesian 2-category 2 LR , which does for R what a Lawvere theory does for a signature. Gadducci and Montanari pointed out in [18] that if side-effects are also introduced, then double categories =-=[14,1,20]-=- should be considered in place of 2-categories. A double category can be informally described as the superposition of a horizontal and a vertical category of cells, the former defining effect propagat... |

14 |
Tiles for Concurrent and Located Calculi
- Ferrari, Montanari
- 1997
(Show Context)
Citation Context ...cribed in the previous sections only for the simple example of finite CCS . We refer the reader to [6] for a more interesting example dealing with the tile system proposed by Ferrari and Montanari in =-=[15]-=- for located CCS [4]. Milner's Calculus for Communicating Systems (CCS) [27] is among the more well-known and studied concurrency models. We present here an executable tile specification for a fragmen... |

14 |
Cafe as an extensible specification environment
- Futatsugi, Sawada
- 1994
(Show Context)
Citation Context ...gic (in the non-conditional case), taking into account rewriting with side effects and rewriting synchronization. On the other hand, since there exist several languages based on rewriting logic (Cafe =-=[16]-=-, ELAN [3], Maude [9]), the implementation of a conservative mapping of tile logic into rewriting logic would facilitate the execution and development of tile specifications. This topic has been exten... |

11 | Enriched Categories as Models of Computation
- Gadducci, Montanari
- 1995
(Show Context)
Citation Context ...stitution. It has been shown in [24], that a rewriting theory R yields a cartesian 2-category 2 LR , which does for R what a Lawvere theory does for a signature. Gadducci and Montanari pointed out in =-=[18]-=- that if side-effects are also introduced, then double categories [14,1,20] should be considered in place of 2-categories. A double category can be informally described as the superposition of a horiz... |