Partial Correctness

Partial Correct sátisfaction is a formal property in program verification within Hoare Logic that asserts if a program terminates, then its final state satisfies the postcondition, without guaranteeing termination.

132

Publications

6K

Citations

183

Authors

109

Institutions

Publications per year

2017–2026

15

Authors

183

  1. VP
    Vaughan Pratt

    Stanford University, United States

    5 publications · 616 citations

    5

    h-index

  2. KR
    Krzysztof R. Apt

    Centrum Wiskunde & Informatica, Netherlands

    5 publications · 389 citations

    5

    h-index

  3. SB
    Stephen Brookes

    Carnegie Mellon University, United States

    4 publications · 73 citations

    4

    h-index

  4. DK
    Dexter Kozen

    Cornell University, United States

    4 publications · 112 citations

    4

    h-index

  5. MY
    Mingsheng Ying

    Tsinghua University, China

    4 publications · 245 citations

    4

    h-index

1–5 of 183

Venues

  1. Electronic Notes in Theoretical Computer Science

    ENTCS · 8 publications · 247 citations

    8

    h-index

  2. 5

    h-index

  3. ACM SIGPLAN Notices

    5 publications · 164 citations

    5

    h-index

  4. Journal of Functional Programming

    4 publications · 153 citations

    4

    h-index

  5. IEEE Transactions on Software Engineering

    TSE · 3 publications · 60 citations

    3

    h-index

1–5