From software extensions to product lines of dataf

Authors: Rui C Gonçalves Don Batory João L Sobral Taylor L Riché

Publish Date: 2015/09/07

Volume: 16, Issue: 4, Pages: 929-947

PDF Link

Abstract

Dataflow programs are widely used Each program is a directed graph where nodes are computations and edges indicate the flow of data In prior work we reverseengineered legacy dataflow programs by deriving their optimized implementations from a simple specification graph using graph transformations called refinements and optimizations In MDE speak our derivations were PIMtoPSM mappings In this paper we show how extensions complement refinements optimizations and PIMtoPSM derivations to make the process of reverse engineering complex legacy dataflow programs tractable We explain how optional functionality in transformations can be encoded thereby enabling us to encode product lines of transformations as well as product lines of dataflow programs We describe the implementation of extensions in the mathttReFlO tool and present two nontrivial case studies as evidence of our work’s generalityWe gratefully acknowledge helpful feedback from B Marker U Texas and from the anonymous reviewers This work was partially supported by FCT—Fundação para a Ciência e a Tecnologia Portuguese Foundation for Science and Technology grant SFRH/BD/47800/2008 We also gratefully acknowledge support for this work by NSF grant CCF0724979 CCF1421211 and OCI1148125

Keywords: