A Formal Definition of Stuctured Analysis with Programmable Graph Grammars

  • Authors:
  • Luciano Baresi;Mauro Pezzè

  • Affiliations:
  • -;-

  • Venue:
  • AGTIVE '99 Proceedings of the International Workshop on Applications of Graph Transformations with Industrial Relevance
  • Year:
  • 1999

Quantified Score

Hi-index 0.00

Visualization

Abstract

Structured Analysis has been one of the most widely used specification notations of the last decades. Friendliness and flexibility promoted its use, but informality hampered its precision and efficacy. The many proposals that tried to overcome the problem improve precision, but constrain flexibility. They propose formal and specific interpretations of Structured Analysis that, even if meritorious, do not impact on day-to-day practice. To meet the goal, formalization attempts should not try to impose particular interpretations, but they should allow users to tailor the interpretation to their current needs. In this paper, we present a solution that merges precision and flexibility to provide a customizable and formal definition of Structured Analysis. Formalization consists of a set of customization rules and a consistency framework. Customization rules, based on graph grammars, formalize the different behaviors of notation elements by defining a mapping onto a formal model. The consistency framework groups complementary rules, which give different semantics to the same elements, and constrain the scope of each rule, that is, identifies the set of rules that may be affected by a change.