Ranking Functions

Ranking Functions is a mathematical construct used in termination analysis to prove that a program's execution eventually halts by mapping computational states to a well-founded domain, thereby ensuring progress toward termination through strictly decreasing values.

306

Publications

22.1K

Citations

726

Authors

300

Institutions

Publications per year

2017–2026

64

Authors

726

  1. HZ
    Hongyuan Zha

    Georgia Institute of Technology, United States

    9 publications · 567 citations

    9

    h-index

  2. ZZ
    Zhaohui Zheng

    Yahoo (United States), United States

    6 publications · 512 citations

    6

    h-index

  3. AM
    Amir M. Ben-Amram

    Academic College of Tel Aviv-Yafo, Israel

    5 publications · 184 citations

    5

    h-index

  4. JW
    Ji-Rong Wen

    Renmin University of China, China

    5 publications · 184 citations

    5

    h-index

  5. GS
    Gordon Sun

    Yahoo (United States), United States

    5 publications · 466 citations

    5

    h-index

1–5 of 726

Venues

  1. arXiv (Cornell University)

    Repository · 11 publications · 541 citations

    10

    h-index

  2. IEEE Transactions on Knowledge and Data Engineering

    TKDE · 6 publications · 200 citations

    6

    h-index

  3. Proceedings of the VLDB Endowment

    PVLDB · 4 publications · 191 citations

    4

    h-index

  4. ACM SIGPLAN Notices

    4 publications · 120 citations

    4

    h-index

  5. Logical Methods in Computer Science

    LMCS · 4 publications · 92 citations

    4

    h-index

1–5