Janggun Lee

Orcid: 0009-0002-0047-7717

According to our database1, Janggun Lee authored at least 8 papers between 2023 and 2025.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
Verifying Lock-Free Traversals in Relaxed Memory Separation Logic.
Proc. ACM Program. Lang., 2025

Lilo: A Higher-Order, Relational Concurrent Separation Logic for Liveness.
Proc. ACM Program. Lang., 2025

Leveraging Immutability to Validate Hazard Pointers for Optimistic Traversals.
Proc. ACM Program. Lang., 2025

Verifying General-Purpose RCU for Reclamation in Relaxed Memory Separation Logic.
Proc. ACM Program. Lang., 2025

2024
A Proof Recipe for Linearizability in Relaxed Memory Separation Logic.
Proc. ACM Program. Lang., 2024

Quantum Probabilistic Model Checking for Time-Bounded Properties.
Proc. ACM Program. Lang., 2024

2023
Modular Verification of Safe Memory Reclamation in Concurrent Separation Logic.
Proc. ACM Program. Lang., October, 2023

Applying Hazard Pointers to More Concurrent Data Structures.
Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures, 2023


  Loading...