Recursive Program Verification

Recursive Program Verification is a formal method within program verification that employs Hoare Logic to reason about the correctness of recursive programs by establishing preconditions and postconditions for recursive procedures, distinguishing itself through the use of inductive assertions to ensure termination and partial or total correctness.

48

Publications

2.3K

Citations

80

Authors

57

Institutions

Publications per year

2017–2026

2

Authors

80

  1. NK
    Naoki Kobayashi

    The University of Tokyo, Japan

    9 publications · 718 citations

    9

    h-index

  2. HU
    Hiroshi Unno

    University of Tsukuba, Japan

    4 publications · 317 citations

    4

    h-index

  3. JE
    Javier Esparza

    Technical University of Munich, Germany

    3 publications · 59 citations

    3

    h-index

  4. EK
    Etienne Kneuss

    École Polytechnique Fédérale de Lausanne, Switzerland

    3 publications · 193 citations

    3

    h-index

  5. PS
    Philippe Suter

    École Polytechnique Fédérale de Lausanne, Switzerland

    3 publications · 193 citations

    3

    h-index

1–5 of 80

Venues

  1. ACM SIGPLAN Notices

    8 publications · 333 citations

    8

    h-index

  2. IEEE Transactions on Software Engineering

    TSE · 4 publications · 63 citations

    4

    h-index

  3. 2

    h-index

  4. Proceedings of the ACM on Programming Languages

    PACMPL · 2 publications · 22 citations

    2

    h-index

  5. Journal of Functional Programming

    2 publications · 20 citations

    2

    h-index

1–5