default search action
Jeehoon Kang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j13]Seungmin Jeon, Kyeongmin Cho, Chan Gu Kang, Janggun Lee, Hakjoo Oh, Jeehoon Kang:
Quantum Probabilistic Model Checking for Time-Bounded Properties. Proc. ACM Program. Lang. 8(OOPSLA2): 557-587 (2024) - [j12]Minseong Jang
, Jungin Rhee
Modular Hardware Design of Pipelined Circuits with Hazards. Proc. ACM Program. Lang. 8(PLDI): 28-51 (2024) - [j11]Jaehwang Jung
Concurrent Immediate Reference Counting. Proc. ACM Program. Lang. 8(PLDI): 151-174 (2024) - [j10]Sunho Park
A Proof Recipe for Linearizability in Relaxed Memory Separation Logic. Proc. ACM Program. Lang. 8(PLDI): 175-198 (2024) - [c14]Jaehwang Jung
Concurrent Immediate Reference Counting (Abstract). HOPC@SPAA 2024 - [c13]Jeonghyeon Kim
Expediting Hazard Pointers with Bounded RCU Critical Sections. SPAA 2024: 1-13 - 2023
- [j9]Jaehwang Jung
Modular Verification of Safe Memory Reclamation in Concurrent Separation Logic. Proc. ACM Program. Lang. 7(OOPSLA2): 828-856 (2023) - [j8]Kyeongmin Cho
Memento: A Framework for Detectable Recoverability in Persistent Memory. Proc. ACM Program. Lang. 7(PLDI): 292-317 (2023) - [c12]Sungsoo Han, Minseong Jang, Jeehoon Kang
ShakeFlow: Functional Hardware Description with Latency-Insensitive Interface Combinators. ASPLOS (2) 2023: 702-717 - [c11]Jaehwang Jung
Applying Hazard Pointers to More Concurrent Data Structures. SPAA 2023: 213-226 - 2022
- [j7]Jiyoung Song
Continuous verification of system of systems with collaborative MAPE-K pattern and probability model slicing. Inf. Softw. Technol. 147: 106904 (2022) - [j6]Lennard Gäher
Simuliris: a separation logic framework for verifying concurrent program optimizations. Proc. ACM Program. Lang. 6(POPL): 1-31 (2022) - [j5]Kyoung-Sook Moon
Forecasting Obsolescence of Components by Using a Clustering-Based Hybrid Machine-Learning Algorithm. Sensors 22(9): 3244 (2022) - [c10]Hoang-Hai Dang
Compass: strong and compositional library specifications in relaxed memory separation logic. PLDI 2022: 792-808 - [i1]Kyeongmin Cho, Seungmin Jeon, Jeehoon Kang:
Practical Detectability for Persistent Lock-Free Data Structures. CoRR abs/2203.07621 (2022) - 2021
- [c9]Kyeongmin Cho
Revamping hardware persistency models: view-based and axiomatic persistency models for Intel-x86 and Armv8. PLDI 2021: 16-31 - 2020
- [j4]Youngju Song
CompCertM: CompCert with C-assembly linking and lightweight modular verification. Proc. ACM Program. Lang. 4(POPL): 23:1-23:31 (2020) - [j3]Ralf Jung
Stacked borrows: an aliasing model for Rust. Proc. ACM Program. Lang. 4(POPL): 41:1-41:32 (2020) - [c8]Jeehoon Kang
A marriage of pointer- and epoch-based reclamation. PLDI 2020: 314-328
2010 – 2019
- 2019
- [c7]Christopher Pulte
Promising-ARM/RISC-V: a simpler and faster operational concurrency model. PLDI 2019: 1-15 - [c6]Keunhong Lee, Jeehoon Kang
Enveloping Implicit Assumptions of Intrusive Data Structures within Ownership Type System. PLOS@SOSP 2019: 16-22 - 2018
- [c5]Jeehoon Kang
Crellvm: verified credible compilation for LLVM. PLDI 2018: 631-645 - 2017
- [c4]Ori Lahav
Repairing sequential consistency in C/C++11. PLDI 2017: 618-632 - [c3]Jeehoon Kang
A promising semantics for relaxed-memory concurrency. POPL 2017: 175-189 - 2016
- [c2]Jeehoon Kang
Lightweight verification of separate compilation. POPL 2016: 178-190 - 2015
- [c1]Jeehoon Kang
A formal C memory model supporting integer-pointer casts. PLDI 2015: 326-335 - 2014
- [j2]Hakjoo Oh, Kihong Heo, Wonchan Lee, Woosuk Lee, Daejun Park, Jeehoon Kang
Global Sparse Analysis Framework. ACM Trans. Program. Lang. Syst. 36(3): 8:1-8:44 (2014) - 2012
- [j1]Jeehoon Kang
A Dice Rolling Game on a Set of Tori. Electron. J. Comb. 19(1): 54 (2012)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-22 19:46 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: