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
Parents
63
Mechanizing and Improving Dependency Pairs
Jürgen Giesl, René Thiemann, Peter Schneider–Kamp et al. · Journal of Automated Reasoning · 2007 · 195 citations
Language Studies, Computer Science, Computational Linguistics +8
1–5 of 63
114
7
h-index
5
h-index
5
h-index
4
h-index
3
h-index
1–5 of 114
57
RWTH Aachen University
Aachen, Germany
7 h-index
14 publications
976 citations

Universität Innsbruck
Innsbruck, Austria
6 h-index
11 publications
450 citations
Nagoya University
Nagoya, Japan
5 h-index
11 publications
216 citations
Universitat Politècnica de València
Valencia, Spain
4 h-index
6 publications
130 citations
University of Michigan
Ann Arbor, United States
3 h-index
7 publications
507 citations
University of Maryland, College Park
College Park, United States
3 h-index
6 publications
797 citations
Laboratoire Lorrain de Recherche en Informatique et ses Applications
Nancy, France
2 h-index
3 publications
62 citations
Utrecht University
Utrecht, The Netherlands
2 h-index
2 publications
516 citations
1–8 of 57
5 publications · 295 citations
5
h-index
3 publications · 105 citations
3
h-index
ENTCS · 3 publications · 53 citations
3
h-index
LMCS · 2 publications · 36 citations
2
h-index
2 publications · 283 citations
2
h-index
1–5