Hoare Logic is a formal system in theoretical computer science that uses logical formulae to specify and verify the correctness of imperative program statements relative to preconditions and postconditions.
222
Publications
13.6K
Citations
339
Authors
158
Institutions
Publications per year
2017–2026
30
Variants
Floyd-hoare LogicHoare Calculus
Parents
Publications
222
Logical form, its structure and derivation
Lingua · 1989 · 766 citations
Verifying properties of parallel programs
Susan Owicki, David Gries · Communications of the ACM · 1976 · 543 citations · Full text
1–5 of 222
Authors
339
- CC
9
h-index
- LB
8
h-index
- UZ
6
h-index
- PG
6
h-index
- NB
5
h-index
1–5 of 339
Institutions
158
Imperial College London
London, United Kingdom
11 h-index
30 publications
1.2K citations
Cornell University
Ithaca, United States
11 h-index
14 publications
1.7K citations
IT University of Copenhagen
Copenhagen, Denmark
7 h-index
7 publications
385 citations
Stanford University
Stanford, United States
7 h-index
9 publications
367 citations
Queen Mary University of London
London, United Kingdom
7 h-index
13 publications
767 citations
University of Illinois Urbana-Champaign
Urbana, United States
7 h-index
14 publications
380 citations
Carnegie Mellon University
Pittsburgh, United States
7 h-index
12 publications
261 citations
Max Planck Institute for Software Systems
Saarbrücken, Germany
5 h-index
11 publications
718 citations
1–8 of 158
Venues
- ACM SIGPLAN Notices
13 publications · 437 citations
12
h-index
- Proceedings of the ACM on Programming Languages
PACMPL · 10 publications · 407 citations
10
h-index
- Electronic Notes in Theoretical Computer Science
ENTCS · 11 publications · 241 citations
10
h-index
- Theoretical Computer Science
8 publications · 261 citations
8
h-index
- ACM Transactions on Computational Logic
TOCL · 8 publications · 442 citations
8
h-index
1–5