On the use of rewriting logic for verification of distributed software architecture description based LfP

Software architecture description languages (ADLs) allow software designers to focus on high level aspects of an application by abstracting from the details of the components that compose architecture. It is precisely this abstraction that makes ADLs suitable for verification using model checking techniques. ADLs are, in a way, domain-specific languages for aspects such as coordination and distribution. LfP (language for prototyping) is a formal approach for distributed software architectures that is based on RM-ODP and that can be linked to an UML methodology. We propose in this paper a rewriting of the LfP semantics, specified in rewriting logic which is well suited for axiomatization of concurrent languages. Using the Maude system, a high-performance interpreter based on rewriting logic, we illustrate through an example how this rewriting semantics can be exploited for verification aspects related to distributed object interactions.