Kwang-Moo Choe

According to our database1, Kwang-Moo Choe authored at least 37 papers between 1985 and 2013.

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



In proceedings 
PhD thesis 





Detection of harmful schizophrenic statements in esterel.
ACM Trans. Embedded Comput. Syst., 2013

Region-based parallelization of irregular reductions on explicitly managed memory hierarchies.
The Journal of Supercomputing, 2011

Cycle elimination for invocation graph-based context-sensitive pointer analysis.
Information & Software Technology, 2011

String Analysis as an Abstract Interpretation.
Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2011

Composition-based Cache simulation for structure reorganization.
Journal of Systems Architecture - Embedded Systems Design, 2010

Filtering false alarms of buffer overflow analysis using SMT solvers.
Information & Software Technology, 2010

Over-Approximated Control Flow Graph Construction on Pure Esterel.
IEICE Transactions, 2010

Points-to analysis for JavaScript.
Proceedings of the 2009 ACM Symposium on Applied Computing (SAC), 2009

Refining schizophrenia via graph reachability in Esterel.
Proceedings of the 7th ACM/IEEE International Conference on Formal Methods and Models for Codesign (MEMOCODE 2009), 2009

LR Formalisms as Abstract Interpretations of Grammar Semantics.
IEICE Transactions, 2006

A Powerful LL(k) Covering Transformation.
SIAM J. Comput., 2005

Static Extensivity Analysis for ?-Definable Functions over Lattices.
New Generation Comput., 2005

An uncaught exception analysis for Java.
Journal of Systems and Software, 2004

Error repair with validation in LR-based parsing.
ACM Trans. Program. Lang. Syst., 2001

Interprocedural exception analysis for Java.
Proceedings of the 2001 ACM Symposium on Applied Computing (SAC), 2001

An LR Parser with Pre-Determined Reduction Goals.
Inf. Process. Lett., 1999

An efficient bottom-up tree pattern matching that performs dynamic programming for code generation.
J. Prog. Lang., 1997

Path for AND-Parallel Execution of Logic Programs.
Inf. Process. Lett., 1994

Grammar Coverings of a Deterministic Parser with Action Conflicts.
Inf. Process. Lett., 1994

An Efficient Computation of Right Context for LR-Based Error Repair.
Inf. Process. Lett., 1994

Boundedly LR( k )-conflictable Grammars.
Acta Inf., 1994

Abstract filters: improving bottom-up execution of logic programs by two-phase abstract interpretation.
Proceedings of the 1994 ACM Symposium on Applied Computing, 1994

Syntactic Error Repair Using Repair Patterns.
Inf. Process. Lett., 1993

An Improved LALR(k) Parser Generation for Regular Right Part Grammars.
Inf. Process. Lett., 1993

On the Reduction of LR(k) Parsers.
Inf. Process. Lett., 1993

A Description of Dynamic Behavior for Compilers Based on Object Oriented Modeling.
Inf. Process. Lett., 1993

Static Filtering on Stratified Programs.
Inf. Process. Lett., 1993

Efficient Bottom-Up Execution of Logic Programs Using Abstract Interpretation.
Inf. Process. Lett., 1993

Refined Mark(s)-Set-Based Backtrack Literal Selection for and Parallelism in Logic Programs.
Parallel Processing Letters, 1992

Corrigenda: Yet Another Efficient Backward Execution Algorithm in the AND/OR Process Model.
Inf. Process. Lett., 1992

Corrigenda: SLR(k) Covering for LR(k) Grammars.
Inf. Process. Lett., 1991

SLR(k) Covering for LR(k) Grammars.
Inf. Process. Lett., 1991

Yet Another Efficient Backward Execution Algorithm in the AND/OR Process Model.
Inf. Process. Lett., 1991

Remarks on Recent Algorithms for LALR Lookahead Sets.
SIGPLAN Notices, 1987

Efficient Computation of the Locally Least-Cost Insertion String for the LR Error Repair.
Inf. Process. Lett., 1986

Selecting the Backtrack Literal in the AND/OR Model.
Proceedings of the 1986 Symposium on Logic Programming, 1986

A New Analysis of LALR Formalisms.
ACM Trans. Program. Lang. Syst., 1985