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
132
Verifying properties of parallel programs
Susan Owicki, David Gries · Communications of the ACM · 1976 · 543 citations · Full text
Peter Henderson, James H. Morris · 1976 · 327 citations · Full text
Semantical consideration on floyo-hoare logic
Vaughan Pratt · 1976 · 317 citations
From program verification to program synthesis
Saurabh Srivastava, Sumit Gulwani, Jeffrey S. Foster · 2010 · 268 citations
1–5 of 132
183
5
h-index
5
h-index
4
h-index
4
h-index
4
h-index
1–5 of 183
109
Carnegie Mellon University
Pittsburgh, United States
11 h-index
11 publications
439 citations

Cornell University
Ithaca, United States
8 h-index
10 publications
1.3K citations
Massachusetts Institute of Technology
Cambridge, United States
7 h-index
12 publications
636 citations
Stanford University
Stanford, United States
5 h-index
6 publications
114 citations
Princeton University
Princeton, United States
4 h-index
7 publications
335 citations
University of Maryland, College Park
College Park, United States
4 h-index
8 publications
820 citations
University of California, Santa Barbara
Santa Barbara, United States
4 h-index
7 publications
134 citations

University of Edinburgh
Edinburgh, United Kingdom
3 h-index
3 publications
118 citations
1–8 of 109
ENTCS · 8 publications · 247 citations
8
h-index
5 publications · 657 citations
5
h-index
5 publications · 164 citations
5
h-index
4 publications · 153 citations
4
h-index
TSE · 3 publications · 60 citations
3
h-index
1–5