Fixpoint Computation
Fixpoint Computation is a method in abstract interpretation that determines the least fixpoint of a monotonic function over an abstract domain to capture the invariant properties of program semantics.
347
Publications
18.5K
Citations
585
Authors
306
Institutions
Publications per year
2017–2026
27
Parents
347
The Semantics of Predicate Logic as a Programming Language
M. H. van Emden, Robert Kowalski · Journal of the ACM · 1976 · 1.5K citations · Full text
Humanities, Computer Science, Logic +16
C. A. R. Hoare, Ian J. Hayes, He Jifeng et al. · Communications of the ACM · 1987 · 389 citations · Full text
1–5 of 347
585
6
h-index
5
h-index
5
h-index
5
h-index
5
h-index
1–5 of 585
306
Stanford University
Stanford, United States
12 h-index
23 publications
5K citations
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
11 h-index
20 publications
1.3K citations
University of Oxford
Oxford, United Kingdom
10 h-index
32 publications
3.7K citations
University of Maryland, College Park
College Park, United States
10 h-index
16 publications
909 citations

University of Edinburgh
Edinburgh, United Kingdom
8 h-index
10 publications
263 citations

University of Calabria
Rende, Italy
8 h-index
18 publications
1.1K citations

University of Pisa
Pisa, Italy
8 h-index
15 publications
492 citations

Imperial College London
London, United Kingdom
7 h-index
9 publications
1.7K citations
1–8 of 306
14 publications · 392 citations
12
h-index
11 publications · 315 citations
10
h-index
ENTCS · 11 publications · 236 citations
10
h-index
9 publications · 798 citations
9
h-index
8 publications · 283 citations
8
h-index
1–5