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
58
Non-linear loop invariant generation using Gröbner bases
Sriram Sankaranarayanan, Henny B. Sipma, Zohar Manna · 2004 · 252 citations
Program analysis as constraint solving
Sumit Gulwani, Saurabh Srivastava, Ramarathnam Venkatesan · 2008 · 202 citations
Learning invariants using decision trees and implication counterexamples
Pranav Garg, Daniel Neider, P. Madhusudan et al. · 2016 · 165 citations · Full text
1–5 of 58
115
4
h-index
4
h-index
3
h-index
3
h-index
3
h-index
1–5 of 115
71
University of Illinois Urbana-Champaign
Urbana, United States
4 h-index
11 publications
958 citations
Universitat Politècnica de Catalunya
Barcelona, Spain
4 h-index
10 publications
470 citations
Microsoft (United States)
Redmond, United States
4 h-index
8 publications
838 citations
University of New Mexico
Albuquerque, United States
4 h-index
8 publications
431 citations

University of Toronto
Toronto, Canada
3 h-index
6 publications
569 citations
Stanford University
Stanford, United States
3 h-index
7 publications
1K citations
Princeton University
Princeton, United States
3 h-index
3 publications
504 citations

Centre National de la Recherche Scientifique
Paris, France
3 h-index
6 publications
94 citations
1–8 of 71
PACMPL · 5 publications · 323 citations
5
h-index
5 publications · 207 citations
5
h-index
2 publications · 144 citations
2
h-index
JI · 2 publications · 121 citations
2
h-index
1 publications · 17 citations
1
h-index
1–5