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.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

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

2011
Region-based parallelization of irregular reductions on explicitly managed memory hierarchies.
J. Supercomput., 2011

Cycle elimination for invocation graph-based context-sensitive pointer analysis.
Inf. Softw. Technol., 2011

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

2010
Composition-based Cache simulation for structure reorganization.
J. Syst. Archit., 2010

Filtering false alarms of buffer overflow analysis using SMT solvers.
Inf. Softw. Technol., 2010

Over-Approximated Control Flow Graph Construction on Pure Esterel.
IEICE Trans. Inf. Syst., 2010

2009
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

2006
LR Formalisms as Abstract Interpretations of Grammar Semantics.
IEICE Trans. Inf. Syst., 2006

2005
A Powerful LL(<i>k</i>) Covering Transformation.
SIAM J. Comput., 2005

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

2004
An uncaught exception analysis for Java.
J. Syst. Softw., 2004

2001
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

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

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

1994
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( <i> k </i> )-conflictable Grammars.
Acta Informatica, 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

1993
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

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

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

1991
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

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

1986
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

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


  Loading...