Fixed-point Computation
Fixed-Point Computation is a formal method in model checking that determines the least or greatest fixed point of a recursive function over a lattice to precisely characterize the set of states satisfying a temporal logic property.
608
Publications
31.3K
Citations
1.3K
Authors
594
Institutions
Publications per year
2017–2026
103
Parents
608
Deep Learning with Limited Numerical Precision
Suyog Gupta, Ankur Agrawal, Kailash Gopalakrishnan et al. · arXiv (Cornell University) · 2015 · 1.1K citations · Full text
Symbolic Model Checking for Real-Time Systems
Thomas A. Henzinger, Xavier Nicollin, Joseph Sifakis et al. · Information and Computation · 1994 · 830 citations · Full text
Deep Learning with Limited Numerical Precision
Suyog Gupta, Ankur Agrawal, Kailash Gopalakrishnan et al. · 2015 · 774 citations
1–5 of 608
1.3K
5
h-index
5
h-index
5
h-index
4
h-index
4
h-index
1–5 of 1.3K
594
Stanford University
Stanford, United States
13 h-index
24 publications
1.9K citations

Centre National de la Recherche Scientifique
Paris, France
12 h-index
26 publications
983 citations
University of California, Berkeley
Berkeley, United States
11 h-index
20 publications
899 citations
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
9 h-index
12 publications
567 citations

Imperial College London
London, United Kingdom
8 h-index
17 publications
601 citations
Seoul National University
Seoul, South Korea
7 h-index
15 publications
830 citations
The University of Texas at Austin
Austin, United States
7 h-index
9 publications
217 citations
Massachusetts Institute of Technology
Cambridge, United States
7 h-index
11 publications
532 citations
1–8 of 594
Repository · 11 publications · 1.3K citations
11
h-index
8 publications · 306 citations
8
h-index
7 publications · 828 citations
7
h-index
7 publications · 586 citations
7
h-index
7 publications · 854 citations
7
h-index
1–5