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

Authors

1.3K

  1. ZM
    Zohar Manna

    Stanford University, United States

    5 publications · 258 citations

    5

    h-index

  2. OS
    Olivier Sentieys

    Université de Rennes, France

    5 publications · 240 citations

    5

    h-index

  3. RS
    Romesh Saigal

    University of Michigan, United States

    5 publications · 153 citations

    5

    h-index

  4. WS
    Wonyong Sung

    Seoul National University, South Korea

    4 publications · 251 citations

    4

    h-index

  5. HM
    H. Meyr

    RWTH Aachen University, Germany

    4 publications · 152 citations

    4

    h-index

1–5 of 1.3K

Venues

  1. arXiv (Cornell University)

    Repository · 11 publications · 1.3K citations

    11

    h-index

  2. Theoretical Computer Science

    8 publications · 306 citations

    8

    h-index

  3. Mathematical Programming

    7 publications · 828 citations

    7

    h-index

  4. SIAM Journal on Numerical Analysis

    7 publications · 586 citations

    7

    h-index

  5. SIAM Journal on Computing

    7 publications · 854 citations

    7

    h-index

1–5