C
Chung-Kil Hur
Researcher at Seoul National University
Publications - 52
Citations - 1604
Chung-Kil Hur is an academic researcher from Seoul National University. The author has contributed to research in topics: Compiler & Operational semantics. The author has an hindex of 20, co-authored 47 publications receiving 1229 citations. Previous affiliations of Chung-Kil Hur include University of Cambridge & Microsoft.
Papers
More filters
Proceedings ArticleDOI
Repairing sequential consistency in C/C++11
TL;DR: This paper proposes a model, called RC11 (for Repaired C11), with a better semantics for SC accesses that restores the soundness of the compilation schemes to Power, maintains the DRF-SC guarantee, and provides stronger, more useful, guarantees to SC fences.
Proceedings ArticleDOI
A promising semantics for relaxed-memory concurrency
TL;DR: The first relaxed memory model that accounts for a broad spectrum of features from the C++11 concurrency model, is implementable, and defines the semantics of racy programs without relying on undefined behaviors, which is a prerequisite for applicability to type-safe languages like Java is proposed.
Proceedings ArticleDOI
Biorthogonality, step-indexing and compiler correctness
Nick Benton,Chung-Kil Hur +1 more
TL;DR: In this paper, logical relations between the denotational semantics of a simply typed functional language with recursion and the operational behaviour of low-level programs in a variant SECD machine are defined using biorthogonality and stepindexing.
Proceedings Article
R2: an efficient MCMC sampler for probabilistic programs
TL;DR: It is shown that R2 is able to produce results of similar quality as the CHURCH and STAN probabilistic programming tools with much shorter execution time and rigorously prove the correctness of R2.
Proceedings ArticleDOI
The power of parameterization in coinductive proof
TL;DR: This paper shows how to support coinductive proofs that are both compositional and incremental, using a dead simple construction the authors call the parameterized greatest fixed point, and presents the lattice-theoretic foundations of parameterized coinduction, and explores its mechanization in proof assistants like Coq and Isabelle.