Tree Covering

Tree Covering is a method in compiler code generation that systematically partitions an abstract syntax tree into disjoint, node-disjoint subtrees corresponding to patterns implementable by target machine instructions, distinguishing it from alternative instruction selection strategies by emphasizing pattern-matching completeness and optimality guarantees over heuristic matching.

14

Publications

363

Citations

34

Authors

17

Institutions

Publications per year

2017–2026

2

Authors

34

  1. RL
    Rainer Leupers

    RWTH Aachen University, Germany

    2 publications · 56 citations

    2

    h-index

  2. LV
    Laurent Van Begin

    Université Libre de Bruxelles, Belgium

    2 publications · 42 citations

    2

    h-index

  3. JR
    Jean-François Raskin

    Université Libre de Bruxelles, Belgium

    2 publications · 42 citations

    2

    h-index

  4. TG
    Tatsuya Gima

    Hokkaido University, Japan

    1 publications · 25 citations

    1

    h-index

  5. ES
    Eljas Soisalon-Soininen

    University of Helsinki, Finland

    1 publications · 11 citations

    1

    h-index

1–5 of 34

Venues

  1. Theoretical Computer Science

    2 publications · 36 citations

    2

    h-index

  2. 1

    h-index

  3. IEEE Transactions on Computers

    1 publications · 52 citations

    1

    h-index

  4. Discrete Mathematics

    1 publications · 17 citations

    1

    h-index

  5. IEEE Access

    1 publications · 47 citations

    1

    h-index

1–5