Recursive Program Verification
Recursive Program Verification is a formal method within program verification that employs Hoare Logic to reason about the correctness of recursive programs by establishing preconditions and postconditions for recursive procedures, distinguishing itself through the use of inductive assertions to ensure termination and partial or total correctness.
48
Publications
2.3K
Citations
80
Authors
57
Institutions
Publications per year
2017–2026
2
Parents
48
Synthesis modulo recursive functions
Etienne Kneuss, Ivan Kuraj, Viktor Kunčak et al. · 2013 · 110 citations · Full text
Verifying higher-order programs with the dijkstra monad
Nikhil Swamy, Joel Weinberger, Cole Schlesinger et al. · 2013 · 105 citations
1–5 of 48
80
9
h-index
4
h-index
3
h-index
3
h-index
3
h-index
1–5 of 80
57

Tohoku University
Sendai, Japan
8 h-index
17 publications
1.3K citations
École Polytechnique Fédérale de Lausanne
Lausanne, Switzerland
3 h-index
12 publications
772 citations
IMDEA Software Institute
Pozuelo de Alarcón, Spain
3 h-index
3 publications
59 citations
Technical University of Munich
Munich, Germany
3 h-index
3 publications
59 citations

University of Freiburg
Freiburg im Breisgau, Germany
2 h-index
6 publications
390 citations
Technion – Israel Institute of Technology
Haifa, Israel
2 h-index
4 publications
284 citations
Madrid Institute for Advanced Studies
Madrid, Spain
2 h-index
2 publications
42 citations
Microsoft (United States)
Redmond, United States
2 h-index
6 publications
375 citations
1–8 of 57
8 publications · 333 citations
8
h-index
TSE · 4 publications · 63 citations
4
h-index
2 publications · 32 citations
2
h-index
PACMPL · 2 publications · 22 citations
2
h-index
2 publications · 20 citations
2
h-index
1–5