Marker-directed optimization of UnCAL graph transformations

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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

11 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages123-138
Number of pages16
Volume7225 LNCS
DOIs
Publication statusPublished - 2012
Event21st International Symposium on Logic-Based Program Synthesis and Transformation, LOPSTR 2011 - Odense
Duration: 2011 Jul 182011 Jul 20

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7225 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other21st International Symposium on Logic-Based Program Synthesis and Transformation, LOPSTR 2011
CityOdense
Period11/7/1811/7/20

Fingerprint

Algebra
Fusion reactions
Recursive functions
Static analysis

Keywords

  • graph transformations
  • program transformations
  • UnCAL

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Hidaka, S., Hu, Z., Inaba, K., Kato, H., Matsuda, K., Nakano, K., & Sasano, I. (2012). Marker-directed optimization of UnCAL graph transformations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7225 LNCS, pp. 123-138). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7225 LNCS). https://doi.org/10.1007/978-3-642-32211-2_9

Marker-directed optimization of UnCAL graph transformations. / Hidaka, Soichiro; Hu, Zhenjiang; Inaba, Kazuhiro; Kato, Hiroyuki; Matsuda, Kazutaka; Nakano, Keisuke; Sasano, Isao.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 7225 LNCS 2012. p. 123-138 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7225 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Hidaka, S, Hu, Z, Inaba, K, Kato, H, Matsuda, K, Nakano, K & Sasano, I 2012, Marker-directed optimization of UnCAL graph transformations. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 7225 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 7225 LNCS, pp. 123-138, 21st International Symposium on Logic-Based Program Synthesis and Transformation, LOPSTR 2011, Odense, 11/7/18. https://doi.org/10.1007/978-3-642-32211-2_9
Hidaka S, Hu Z, Inaba K, Kato H, Matsuda K, Nakano K et al. Marker-directed optimization of UnCAL graph transformations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 7225 LNCS. 2012. p. 123-138. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-32211-2_9
Hidaka, Soichiro ; Hu, Zhenjiang ; Inaba, Kazuhiro ; Kato, Hiroyuki ; Matsuda, Kazutaka ; Nakano, Keisuke ; Sasano, Isao. / Marker-directed optimization of UnCAL graph transformations. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 7225 LNCS 2012. pp. 123-138 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{2d3a12b064f348d59f12c9df9f525a3d,
title = "Marker-directed optimization of UnCAL graph transformations",
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.",
keywords = "graph transformations, program transformations, UnCAL",
author = "Soichiro Hidaka and Zhenjiang Hu and Kazuhiro Inaba and Hiroyuki Kato and Kazutaka Matsuda and Keisuke Nakano and Isao Sasano",
year = "2012",
doi = "10.1007/978-3-642-32211-2_9",
language = "English",
isbn = "9783642322105",
volume = "7225 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "123--138",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Marker-directed optimization of UnCAL graph transformations

AU - Hidaka, Soichiro

AU - Hu, Zhenjiang

AU - Inaba, Kazuhiro

AU - Kato, Hiroyuki

AU - Matsuda, Kazutaka

AU - Nakano, Keisuke

AU - Sasano, Isao

PY - 2012

Y1 - 2012

N2 - 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.

AB - 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.

KW - graph transformations

KW - program transformations

KW - UnCAL

UR - http://www.scopus.com/inward/record.url?scp=84865138271&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84865138271&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-32211-2_9

DO - 10.1007/978-3-642-32211-2_9

M3 - Conference contribution

SN - 9783642322105

VL - 7225 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 123

EP - 138

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -