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
75
A constructive approach to the problem of program correctness
E. Dijkstra · BIT Numerical Mathematics · 1968 · 238 citations
Countable nondeterminism and random assignment
Krzysztof R. Apt, Gordon Plotkin · Journal of the ACM · 1986 · 181 citations · Full text
Assessing the quality of GitHub copilot’s code generation
Burak Yetistiren, Isik Ozsoy, Eray Tüzün · 2022 · 130 citations · Full text
A verified compiler for an impure functional language
Adam Chlipala · 2010 · 101 citations
1–5 of 75
106
4
h-index
4
h-index
3
h-index
2
h-index
2
h-index
1–5 of 106
67
Massachusetts Institute of Technology
Cambridge, United States
4 h-index
8 publications
245 citations

Cornell University
Ithaca, United States
4 h-index
4 publications
167 citations
IBM (United States)
Armonk, United States
3 h-index
4 publications
144 citations
University of Oxford
Oxford, United Kingdom
3 h-index
3 publications
103 citations

UNSW Sydney
Sydney, Australia
2 h-index
8 publications
232 citations
Chalmers University of Technology
Gothenburg, Sweden
2 h-index
3 publications
114 citations
University of Southern California
Los Angeles, United States
2 h-index
2 publications
54 citations
Miami University
Oxford, United States
2 h-index
2 publications
109 citations
1–8 of 67
4 publications · 180 citations
4
h-index
TSE · 4 publications · 209 citations
4
h-index
4 publications · 376 citations
4
h-index
4 publications · 80 citations
4
h-index
2 publications · 259 citations
2
h-index
1–5