Invariant Synthesis

Invariant Synthesis is the systematic derivation of loop invariants—logical predicates that remain true throughout the execution of a loop—as a foundational technique in program verification within automated reasoning, specifically distinguished by its focus on generating such invariants algorithmically to enable formal correctness proofs in Hoare Logic.

58

Publications

3.2K

Citations

115

Authors

71

Institutions

Publications per year

2017–2026

15

Authors

115

  1. DK
    Deepak Kapur

    University of New Mexico, United States

    4 publications · 314 citations

    4

    h-index

  2. ER
    Enric Rodríguez-Carbonell

    Universitat Politècnica de Catalunya, Spain

    4 publications · 299 citations

    4

    h-index

  3. LK
    Laura Kovács

    TU Wien, Austria

    3 publications · 81 citations

    3

    h-index

  4. ZK
    Zachary Kincaid

    University of Toronto, Canada

    3 publications · 166 citations

    3

    h-index

  5. DL
    Daniel Larraz

    University of Iowa, United States

    3 publications · 68 citations

    3

    h-index

1–5 of 115

Venues

  1. Proceedings of the ACM on Programming Languages

    PACMPL · 5 publications · 323 citations

    5

    h-index

  2. ACM SIGPLAN Notices

    5 publications · 207 citations

    5

    h-index

  3. Journal of Symbolic Computation

    2 publications · 144 citations

    2

    h-index

  4. The Journal of Immunology

    JI · 2 publications · 121 citations

    2

    h-index

  5. 1

    h-index

1–5