An Abstract Way to Define Rewriting Logic

Aiguier, Marc; Bahrami, Diane; Longuet, Delphine

doi:10.1016/j.entcs.2005.09.033

Cited by 1 publication

(1 citation statement)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Therefore, we use the rewriting logic (Martí-Oliet and Meseguer 2002) which has been shown as an unified semantic framework, for concurrent and distributed computation (Martí-Oliet and Meseguer 2000;Meseguer 2004;Meseguer and Roşu 2007). The basic axioms of this logic, which are rewrite rules of the form t → t where t and t are terms over a given signature, can be interpreted into two ways (Aiguier et al 2006): (1) as the local transition of a concurrent system, the rewriting logic then extends (equational) algebraic specifications to deal with dynamic and concurrent changes in systems or (2) as the inference rule, the rewriting logic is then a universal logic within which other logics can be translated. Furthermore rewriting logic has several highperformance implementations (Borovanský et al 2002;Clavel et al 2011;Diaconescu and Futatsugi 1998), the most comprehensive and expressive one is Maude (Clavel et al 2011).…”

Section: Introductionmentioning

confidence: 99%

Toward a rewriting logic framework for safe and distributed component installation

Belguidoum

Belala

Latreche

2011

Electronic Workshops in Computing

View full text Add to dashboard Cite

Traditionally, software components are developed independently and often considered as black boxes. However, they might be dependent from each other at assembly and deployment stages and used by a third party in various environments. In a previous work (Belguidoum and Dagnat 2007), we have proposed an intra-dependency language and a predicate logic based framework for safe component deployment. In this paper, we aim to extend this work to take into account dynamic changes of concurrent and distributed systems in installation phase and overcome some predicate logic limitations. Therefore, we propose an integration of predicate logic based framework within a rewriting logic based framework. Finally, we execute it in Maude which is a high-performance implementation of rewriting logic enabling both the deployment execution and its formal analysis. We show the relevance of the Maude based deployment approach relating to the interesting features of Maude such as: genericity, concurrency, distribution and formal tools.

show abstract