Verification Of Concurrent Programs
Verification of Concurrent Programs is a formal method in computer science that constitutes the systematic process of proving or disproving the correctness of intended algorithms or systems with respect to a certain property, specifically by analyzing all possible interleavings of concurrent operations to ensure consistent and predictable behavior under shared resource access and synchronization constraints.
413
Publications
30.4K
Citations
672
Authors
256
Institutions
Publications per year
2017–2026
57
413
The temporal logic of programs
Amir Pnueli · 1977 · 5.7K citations
An axiomatic proof technique for parallel programs I
Susan Owicki, David Gries · Acta Informatica · 1976 · 1K citations
E. Allen Emerson · 1990 · 824 citations
Formal verification of parallel programs
Robert Keller · Communications of the ACM · 1976 · 791 citations · Full text
1–5 of 413
672
11
h-index
11
h-index
10
h-index
10
h-index
8
h-index
1–5 of 672
256
Microsoft (United States)
Redmond, United States
21 h-index
38 publications
2.4K citations
Max Planck Institute for Software Systems
Saarbrücken, Germany
16 h-index
38 publications
2K citations
Carnegie Mellon University
Pittsburgh, United States
15 h-index
40 publications
2.1K citations
The University of Texas at Austin
Austin, United States
12 h-index
35 publications
5.4K citations

Tel Aviv University
Tel Aviv, Israel
10 h-index
12 publications
6.7K citations
Yale University
New Haven, United States
10 h-index
32 publications
1.6K citations
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
10 h-index
14 publications
422 citations
University of Cambridge
Cambridge, United Kingdom
9 h-index
19 publications
947 citations
1–8 of 256
17 publications · 1.3K citations
16
h-index
24 publications · 665 citations
16
h-index
PACMPL · 18 publications · 557 citations
15
h-index
TSE · 18 publications · 2.5K citations
14
h-index
ENTCS · 15 publications · 335 citations
12
h-index
1–5