Lennart Beringer

Lennart Beringer

Princeton University

H-index: 22

North America-United States

About Lennart Beringer

Lennart Beringer, With an exceptional h-index of 22 and a recent h-index of 14 (since 2020), a distinguished researcher at Princeton University, specializes in the field of Program verification, Interactive theorem proving, relational reasoning.

His recent articles reflect a diverse array of research interests and contributions to the field:

Verified software units for simple DFA modules and objects in C

Functional Representations of SSA

Verifying an HTTP key-value server with Interaction Trees and VST

Compiler Correctness for Concurrency: from concurrent separation logic to shared-memory assembly language

Lennart Beringer Information

University

Position

___

Citations(all)

1665

Citations(since 2020)

770

Cited By

1218

hIndex(all)

22

hIndex(since 2020)

14

i10Index(all)

28

i10Index(since 2020)

15

Email

University Profile Page

Google Scholar

Lennart Beringer Skills & Research Interests

Program verification

Interactive theorem proving

relational reasoning

Top articles of Lennart Beringer

Verified software units for simple DFA modules and objects in C

2022

Lennart Beringer
Lennart Beringer

H-Index: 15

Functional Representations of SSA

2022

Lennart Beringer
Lennart Beringer

H-Index: 15

Verifying an HTTP key-value server with Interaction Trees and VST

12th International Conference on Interactive Theorem Proving (ITP 2021)

2021/6/21

Compiler Correctness for Concurrency: from concurrent separation logic to shared-memory assembly language

Department of Computer Science, Princeton University

2020/3/20

See List of Professors in Lennart Beringer University(Princeton University)

Co-Authors

academic-engine