Dependency Pairs

Dependency Pairs is a termination analysis method that identifies recursive call dependencies in term rewrite systems by capturing potential call patterns between rules through a syntactic criterion on argument positions.

63

Publications

3.2K

Citations

114

Authors

57

Institutions

Publications per year

2017–2026

8

Authors

114

  1. JG
    Jürgen Giesl

    RWTH Aachen University, Germany

    7 publications · 897 citations

    7

    h-index

  2. MS
    Masahiko Sakai

    Kyoto University, Japan

    5 publications · 106 citations

    5

    h-index

  3. KK
    Keiichirou Kusakari

    Nagoya University, Japan

    5 publications · 87 citations

    5

    h-index

  4. SL
    Salvador Lucas

    Universitat Politècnica de València, Spain

    4 publications · 100 citations

    4

    h-index

  5. GM
    Georg Moser

    Universität Innsbruck, Austria

    3 publications · 68 citations

    3

    h-index

1–5 of 114

Venues

  1. Journal of Automated Reasoning

    5 publications · 295 citations

    5

    h-index

  2. 3

    h-index

  3. Electronic Notes in Theoretical Computer Science

    ENTCS · 3 publications · 53 citations

    3

    h-index

  4. Logical Methods in Computer Science

    LMCS · 2 publications · 36 citations

    2

    h-index

  5. Journal of Memory and Language

    2 publications · 283 citations

    2

    h-index

1–5