Total Correctness

Total Correctness is a formal property of program verification within Hoare Logic that belongs to the class of correctness assertions, distinguished by the requirement that a program both terminates and produces a correct result satisfying the postcondition for all inputs satisfying the precondition.

75

Publications

3K

Citations

106

Authors

67

Institutions

Publications per year

2017–2026

6

Authors

106

  1. DH
    David Harel

    Weizmann Institute of Science, Israel

    4 publications · 175 citations

    4

    h-index

  2. KR
    Krzysztof R. Apt

    Centrum Wiskunde & Informatica, Netherlands

    4 publications · 302 citations

    4

    h-index

  3. VP
    Vaughan Pratt

    Stanford University, United States

    3 publications · 149 citations

    3

    h-index

  4. NS
    Norihisa Suzuki

    Palo Alto Research Center, United States

    2 publications · 43 citations

    2

    h-index

  5. MR
    Michael R. Clarkson

    Cornell University, United States

    2 publications · 109 citations

    2

    h-index

1–5 of 106

Venues

  1. Acta Informatica

    4 publications · 180 citations

    4

    h-index

  2. IEEE Transactions on Software Engineering

    TSE · 4 publications · 209 citations

    4

    h-index

  3. 4

    h-index

  4. Theoretical Computer Science

    4 publications · 80 citations

    4

    h-index

  5. BIT Numerical Mathematics

    2 publications · 259 citations

    2

    h-index

1–5