Chung-Kil Hur

Orcid: 0000-0002-1656-0913

According to our database1, Chung-Kil Hur authored at least 43 papers between 2007 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Unifying Model Execution and Deductive Verification with Interaction Trees in Isabelle/HOL.
CoRR, 2024

2023
Conditional Contextual Refinement.
Proc. ACM Program. Lang., January, 2023

Fair Operational Semantics.
Proc. ACM Program. Lang., 2023

Putting Weak Memory in Order via a Promising Intermediate Representation.
Proc. ACM Program. Lang., 2023

2022
Conditional Contextual Refinement (CCR).
CoRR, 2022

Sequential reasoning for optimizing compilers under weak memory concurrency.
Proceedings of the PLDI '22: 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation, San Diego, CA, USA, June 13, 2022

2021
Abstraction Logic: The Marriage of Contextual Refinement and Separation Logic.
CoRR, 2021

Alive2: bounded translation validation for LLVM.
Proceedings of the PLDI '21: 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, 2021

Modular data-race-freedom guarantees in the promising semantics.
Proceedings of the PLDI '21: 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, 2021

Formally Verified Simulations of State-Rich Processes Using Interaction Trees in Isabelle/HOL.
Proceedings of the 32nd International Conference on Concurrency Theory, 2021

An SMT Encoding of LLVM's Memory Model for Bounded Translation Validation.
Proceedings of the Computer Aided Verification - 33rd International Conference, 2021

2020
Interaction trees: representing recursive and impure programs in Coq.
Proc. ACM Program. Lang., 2020

CompCertM: CompCert with C-assembly linking and lightweight modular verification.
Proc. ACM Program. Lang., 2020

Promising 2.0: global optimizations in relaxed memory concurrency.
Proceedings of the 41st ACM SIGPLAN International Conference on Programming Language Design and Implementation, 2020

An equational theory for weak bisimulation via generalized parameterized coinduction.
Proceedings of the 9th ACM SIGPLAN International Conference on Certified Programs and Proofs, 2020

2019
Interaction Trees: Representing Recursive and Impure Programs in Coq (Work In Progress).
CoRR, 2019

Promising-ARM/RISC-V: a simpler and faster operational concurrency model.
Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation, 2019

AliveInLean: A Verified LLVM Peephole Optimization Verifier.
Proceedings of the Computer Aided Verification - 31st International Conference, 2019

2018
Reconciling high-level optimizations and low-level code in LLVM.
Proc. ACM Program. Lang., 2018

Crellvm: verified credible compilation for LLVM.
Proceedings of the 39th ACM SIGPLAN Conference on Programming Language Design and Implementation, 2018

2017
A promising semantics for relaxed-memory concurrency.
Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, 2017

Taming undefined behavior in LLVM.
Proceedings of the 38th ACM SIGPLAN Conference on Programming Language Design and Implementation, 2017

Repairing sequential consistency in C/C++11.
Proceedings of the 38th ACM SIGPLAN Conference on Programming Language Design and Implementation, 2017

2016
Lightweight verification of separate compilation.
Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2016

2015
A formal C memory model supporting integer-pointer casts.
Proceedings of the 36th ACM SIGPLAN Conference on Programming Language Design and Implementation, 2015

Pilsner: a compositionally verified compiler for a higher-order imperative language.
Proceedings of the 20th ACM SIGPLAN International Conference on Functional Programming, 2015

A Provably Correct Sampler for Probabilistic Programs.
Proceedings of the 35th IARCS Annual Conference on Foundation of Software Technology and Theoretical Computer Science, 2015

2014
Slicing probabilistic programs.
Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, 2014

R2: An Efficient MCMC Sampler for Probabilistic Programs.
Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

2013
The power of parameterization in coinductive proof.
Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2013

2012
Strongly Typed Term Representations in Coq.
J. Autom. Reason., 2012

The marriage of bisimulations and Kripke logical relations.
Proceedings of the 39th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2012

2011
On the mathematical synthesis of equational logics
Log. Methods Comput. Sci., 2011

A kripke logical relation between ML and assembly.
Proceedings of the 38th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2011

Separation Logic in the Presence of Garbage Collection.
Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science, 2011

2010
Categorical equational systems : algebraic models and equational reasoning.
PhD thesis, 2010

Step-Indexing: The Good, the Bad and the Ugly.
Proceedings of the Modelling, Controlling and Reasoning About State, 29.08. - 03.09.2010, 2010

Second-Order Equational Logic (Extended Abstract).
Proceedings of the Computer Science Logic, 24th International Workshop, 2010

2009
On the construction of free algebras for equational systems.
Theor. Comput. Sci., 2009

Mathematical Synthesis of Equational Deduction Systems.
Proceedings of the Typed Lambda Calculi and Applications, 9th International Conference, 2009

Biorthogonality, step-indexing and compiler correctness.
Proceedings of the Proceeding of the 14th ACM SIGPLAN international conference on Functional programming, 2009

2008
Term Equational Systems and Logics: (Extended Abstract).
Proceedings of the 24th Conference on the Mathematical Foundations of Programming Semantics, 2008

2007
Equational Systems and Free Constructions (Extended Abstract).
Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007


  Loading...