Lennard Gäher

Orcid: 0000-0003-2917-375X

According to our database¹, Lennard Gäher authored at least 9 papers between 2021 and 2025.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of four.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Links

On csauthors.net:

Bibliography

2025

ACE: Confidential Computing for Embedded RISC-V Systems.

[BibT_eX]

[DOI]

CoRR, May, 2025

RefinedProsa: Connecting Response-Time Analysis with C Verification for Interrupt-Free Schedulers.

[BibT_eX]

[DOI]

Proc. ACM Program. Lang., 2025

2024

Quiver: Guided Abductive Inference of Separation Logic Specifications in Coq.

[BibT_eX]

[DOI]

Proc. ACM Program. Lang., 2024

RefinedRust: A Type System for High-Assurance Verification of Rust Programs.

[BibT_eX]

[DOI]

Proc. ACM Program. Lang., 2024

2023

Stuttering for Free.

[BibT_eX]

[DOI]

Proc. ACM Program. Lang., October, 2023

2022

Later credits: resourceful reasoning for the later modality.

[BibT_eX]

[DOI]

Proc. ACM Program. Lang., 2022

Simuliris: a separation logic framework for verifying concurrent program optimizations.

[BibT_eX]

[DOI]

Proc. ACM Program. Lang., 2022

2021

Transfinite Iris: resolving an existential dilemma of step-indexed separation logic.

[BibT_eX]

[DOI]

Proceedings of the PLDI '21: 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, 2021

Mechanising Complexity Theory: The Cook-Levin Theorem in Coq.

[BibT_eX]

[DOI]

Lennard Gäher

Fabian Kunze

Proceedings of the 12th International Conference on Interactive Theorem Proving, 2021

Lennard Gäher

Timeline

Legend:

Links

On csauthors.net:

Bibliography

Loading...