The Experts below are selected from a list of 18 Experts worldwide ranked by ideXlab platform

Isao Sasano - One of the best experts on this subject based on the ideXlab platform.

  • Marker-directed optimization of uncal graph transformations
    2015
    Co-Authors: Soichiro Hidaka, Kazuhiro Inaba, Hiroyuki Kato, Keisuke Nakano, Isao Sasano
    Abstract:

    Abstract. Buneman et al. proposed a graph algebra Called UnCAL (Un-structured CALculus) for compositional graph transformations based on structural recursion, and we have recently applied to model transfor-mations. The compositional nature of the algebra greatly enhances the modularity of transformations. However, intermediate results generated between composed transformations cause overhead. Buneman et al. pro-posed 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 mark-ers, which correspond to Recursive Function Call in the structural recur-sion. 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

  • LOPSTR - Marker-Directed optimization of UnCAL graph transformations
    Logic-Based Program Synthesis and Transformation, 2012
    Co-Authors: Soichiro Hidaka, Kazuhiro Inaba, Hiroyuki Kato, Kazutaka Matsuda, Keisuke Nakano, Isao Sasano
    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.

Soichiro Hidaka - One of the best experts on this subject based on the ideXlab platform.

  • Marker-directed optimization of uncal graph transformations
    2015
    Co-Authors: Soichiro Hidaka, Kazuhiro Inaba, Hiroyuki Kato, Keisuke Nakano, Isao Sasano
    Abstract:

    Abstract. Buneman et al. proposed a graph algebra Called UnCAL (Un-structured CALculus) for compositional graph transformations based on structural recursion, and we have recently applied to model transfor-mations. The compositional nature of the algebra greatly enhances the modularity of transformations. However, intermediate results generated between composed transformations cause overhead. Buneman et al. pro-posed 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 mark-ers, which correspond to Recursive Function Call in the structural recur-sion. 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

  • LOPSTR - Marker-Directed optimization of UnCAL graph transformations
    Logic-Based Program Synthesis and Transformation, 2012
    Co-Authors: Soichiro Hidaka, Kazuhiro Inaba, Hiroyuki Kato, Kazutaka Matsuda, Keisuke Nakano, Isao Sasano
    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.

John S. Robertson - One of the best experts on this subject based on the ideXlab platform.

  • How many Recursive Calls does a Recursive Function make
    ACM SIGCSE Bulletin, 1999
    Co-Authors: John S. Robertson
    Abstract:

    The calculation of the Fibonacci sequence using recursion gives rise to an interesting question: How many times does a Recursive Function Call itself? This paper presents one way to examine this question using difference equations with initial conditions, or discrete dynamical systems (DDS). We show that there is a linear relationship between the Fibonacci numbers themselves and the number of Recursive Calls. This relationship generalizes to any type of DDS of second-order, and DDS of higher-order.

Kazuhiro Inaba - One of the best experts on this subject based on the ideXlab platform.

  • Marker-directed optimization of uncal graph transformations
    2015
    Co-Authors: Soichiro Hidaka, Kazuhiro Inaba, Hiroyuki Kato, Keisuke Nakano, Isao Sasano
    Abstract:

    Abstract. Buneman et al. proposed a graph algebra Called UnCAL (Un-structured CALculus) for compositional graph transformations based on structural recursion, and we have recently applied to model transfor-mations. The compositional nature of the algebra greatly enhances the modularity of transformations. However, intermediate results generated between composed transformations cause overhead. Buneman et al. pro-posed 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 mark-ers, which correspond to Recursive Function Call in the structural recur-sion. 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

  • LOPSTR - Marker-Directed optimization of UnCAL graph transformations
    Logic-Based Program Synthesis and Transformation, 2012
    Co-Authors: Soichiro Hidaka, Kazuhiro Inaba, Hiroyuki Kato, Kazutaka Matsuda, Keisuke Nakano, Isao Sasano
    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.

Hiroyuki Kato - One of the best experts on this subject based on the ideXlab platform.

  • Marker-directed optimization of uncal graph transformations
    2015
    Co-Authors: Soichiro Hidaka, Kazuhiro Inaba, Hiroyuki Kato, Keisuke Nakano, Isao Sasano
    Abstract:

    Abstract. Buneman et al. proposed a graph algebra Called UnCAL (Un-structured CALculus) for compositional graph transformations based on structural recursion, and we have recently applied to model transfor-mations. The compositional nature of the algebra greatly enhances the modularity of transformations. However, intermediate results generated between composed transformations cause overhead. Buneman et al. pro-posed 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 mark-ers, which correspond to Recursive Function Call in the structural recur-sion. 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

  • LOPSTR - Marker-Directed optimization of UnCAL graph transformations
    Logic-Based Program Synthesis and Transformation, 2012
    Co-Authors: Soichiro Hidaka, Kazuhiro Inaba, Hiroyuki Kato, Kazutaka Matsuda, Keisuke Nakano, Isao Sasano
    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.