Hierarchical verification in maude of Lf P software architectures

  • Authors:
  • Chadlia Jerad;Kamel Barkaoui;Amel Grissa Touzi

  • Affiliations:
  • LSTS, ENIT, Tunis, Tunisia;CEDRIC, CNAM, France;LSTS, ENIT, Tunis, Tunisia

  • Venue:
  • ECSA'07 Proceedings of the First European conference on Software Architecture
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

Software architecture description languages allow software designers to focus on high level aspects of an application by abstracting from details. In general, a system's architecture is specified in a hierarchical way. In fact, hierarchical components hide, at each level, the complexity of the sub-entities composing the system. As rewriting logic is a natural semantic framework for representing concurrency, parallelism, communication and interaction, it can be used for systems specification and verification. In this paper, we show how we can take advantage of hierarchical modeling of software systems specified with Lf P, to prototype model checking process using Maude system. This approach allows us to hide and show, freely and easily, encapsulated details by moving between hierarchical levels. Thus, state explosion problem is mastered and reduced. In addition, system's maintainability and error detection become easier and faster.