Formal specification and analysis of functional properties of graph rewriting‐based model transformation. (7th June 2013)

• Record Type: Journal Article
• Authors: Asztalos, Márk; Lengyel, László; Levendovszky, Tihamér
• Other Names: Cavalli Ana guestEditor.; Ghosh Sudipto guestEditor.
• Is Part Of: Software testing, verification & reliability. Volume 23:Number 5(2013)
• Page Start: 405
• Page End: 435
• Publication Date: 2013-06-07
• Subjects: model processing -- model transformation -- graph rewriting -- verification -- offline analysis; Computer software -- Testing -- Periodicals; Computer software -- Verification -- Periodicals; Computer software -- Reliability -- Periodicals; 005.14
• DOI: 10.1002/stvr.1502
• Languages: English
• ISSNs: 0960-0833

Abstract

SUMMARY: Model processing programs are regularly used when working with models or synthetizing the code from them; therefore, their verification has become an essential component of constructing reliable software in model‐based software engineering. Models are usually formalized and visualized as graphs; therefore, model processing programs based on algebraic graph rewriting systems—such programs are called model transformations—are often applied, and their verification has become an important research area. The goal of our research is to support offline transformation analysis by automated methods, where offline means that only the definition of the program itself, the language definitions of its source and target models are used during the analysis. Therefore, the results are independent from concrete source models, and the analysis needs to be performed only once. Based on previous work, this paper provides the synthesis and of a set of individual components and improves them to provide a complete verification solution: (i) a language is introduced to specify the properties to be verified; (ii) a formalism to describe model transformations in a declarative way; and (iii) automated algorithms that can analyse the declarative transformations as well as the properties expressed by the language. Besides its theoretical basis, the implementation of a verification framework is presented, and its operation is illustrated on a case study. Although the formal verification of model transformation properties is algorithmically undecidable in general, our goal is to provide a practically usable, scoped framework that can largely facilitate the manual verification of model transformations. Copyright © 2013 John Wiley & Sons, Ltd. Abstract : This paper focuses on the theory of formal verification of functional properties of graph rewriting‐based model processing programs often referred as model transformations. A formal framework has been developed for the declarative description of individual graph‐rewriting rules and for the specification of the functional properties to be verified. Methods have been proposed for the semi‐automated analysis of the transformations, and the implementation of framework has been outlined as a part of visual modeling and transformation system.