Marker-Directed optimization of UnCAL graph transformations

  • Authors:

  • Soichiro Hidaka;Zhenjiang Hu;Kazuhiro Inaba;Hiroyuki Kato;Kazutaka Matsuda;Keisuke Nakano;Isao Sasano

  • Affiliations:

  • National Institute of Informatics, Japan;National Institute of Informatics, Japan;National Institute of Informatics, Japan;National Institute of Informatics, Japan;Tohoku University, Japan;The University of Electro-Communications, Japan;Shibaura Institute of Technology, Japan

  • Venue:
  • LOPSTR'11 Proceedings of the 21st international conference on Logic-Based Program Synthesis and Transformation
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Buneman et al. proposed a graph algebra called UnCAL (Unstructured CALculus) for compositional graph transformations based on structural recursion, and we have recently applied to model transformations. The compositional nature of the algebra greatly enhances the modularity of transformations. However, intermediate results generated between composed transformations cause overhead. Buneman et al. proposed fusion rules that eliminate the intermediate results, but auxiliary rewriting rules that enable the actual application of the fusion rules are not apparent so far. UnCAL graph model includes the concept of markers, which correspond to recursive function call in the structural recursion. We have found that there are many optimization opportunities at rewriting level based on static analysis, especially focusing on markers. The analysis can safely eliminate redundant function calls. Performance evaluation shows its practical effectiveness for non-trivial examples in model transformations.