Joonwon Choi

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
We present a semantic-preserving unstaging translation of crossstage persistent multi-staged programs into context calculus. Unlike Lisp-like multi-staged programs, cross-stage persistent multistaged programs allow variables of any stage to be used in all future stages (cross-stage persistence) and do not allow intentional variable-capturing substitution.(More)
It has become fairly standard in the programming-languages research world to verify functional programs in proof assistants using induction, algebraic simplification, and rewriting. In this paper, we introduce Kami, a Coq library that enables similar expressive and modular reasoning for hardware designs expressed in the style of the Bluespec language. We(More)
Recent advances in theorem proving technology have made it possible to write a completely bug-free compiler such as CompCert. However, this technology have not been fully applied to mainstream compilers such as GCC and LLVM due to the huge amount of work required. Nevertheless, we believe that the verified validation technique will reduce verification(More)
Static analyzers, which have been successfully deployed in real world to statically find software errors, are complex pieces of software whose reliability is very hard to establish by testing. Testing is not so effective because analysis results are hard to validate manually for the following reasons: (i) even valid outputs can contain false alarms (or even(More)
Graph rewriting has numerous applications, such as software engineering and biology techniques. This technique is theoretically based on pushouts and pullbacks, which are involved with given categories. This paper deals with the definition of pushout and pullback, and their properties.
  • 1