Interactive data representation migration: exploiting program dependence to aid program transformation

Research output: Chapter in Book/Report/Conference proceedingPaper in conference proceeding

Abstract

Data representation migration is a program transformation that involves changing the type of a particular data structure, and then updating all of the operations that somehow depend on that data structure according to the new type. Changing the data representation can provide benefits such as improving efficiency and improving the quality of the computed results. Performing such a transformation is challenging, because it requires applying data-type specific changes to code fragments that may be widely scattered throughout the source code, connected by dataflow dependencies.
Refactoring systems are typically sensitive to dataflow dependencies, but are not programmable with respect to the features of particular data types. Existing program transformation languages provide the needed flexibility, but do not concisely support reasoning about dataflow dependencies.
To address the needs of data representation migration, we propose a new approach to program transformation that relies on a notion of semantic dependency: every transformation step propagates the transformation process onward to code that somehow depends on the transformed code. Our approach provides a declarative transformation-specification language, for expressing type-specific transformation rules. We further provide scoped rules, a mechanism for guiding rule application, and tags, a device for simple program analysis within our framework, to enable more powerful program transformations.
We have implemented a prototype transformation system based on these ideas for C and C++ code and evaluate it against three example specifications, including vectorization, transformation of integers to big integers, and transformation of array-of-structures data types to structure-of-arrays format. Our evaluation shows that our approach can improve program performance and the precision of the computed results, and that it scales to programs of up to 3700 lines.

Details

Authors
External organisations
  • Goethe University
  • R 2 Software & Systeme UG
  • Paris-Sorbonne University
  • Pierre and Marie Curie University
  • INRA National Institute of Agricultural Research
Research areas and keywords

Subject classification (UKÄ) – MANDATORY

  • Computer Systems
Original languageEnglish
Title of host publicationPEPM 2017 Proceedings of the 2017 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation
PublisherACM
Pages47-58
ISBN (Print)978-1-4503-4721-1
Publication statusPublished - 2017
Publication categoryResearch
Peer-reviewedYes
Externally publishedYes
Eventthe 2017 ACM SIGPLAN Workshop - Paris, France
Duration: 2017 Jan 162017 Jan 17

Conference

Conferencethe 2017 ACM SIGPLAN Workshop
Period2017/01/162017/01/17