| 2009 |
| 29 | EE | Dongseok Jang,
Kwang-Moo Choe:
Points-to analysis for JavaScript.
SAC 2009: 1930-1937 |
| 2006 |
| 28 | EE | Seunghwan O,
Kwang-Moo Choe:
LR Formalisms as Abstract Interpretations of Grammar Semantics.
IEICE Transactions 89-D(12): 2924-2932 (2006) |
| 2005 |
| 27 | EE | Hyunjun Eo,
Kwangkeun Yi,
Kwang-Moo Choe:
Static Extensivity Analysis for ?-Definable Functions over Lattices.
New Generation Comput. 24(1): (2005) |
| 26 | EE | Gyung-Ok Lee,
Kwang-Moo Choe:
A Powerful LL(k) Covering Transformation.
SIAM J. Comput. 35(2): 359-377 (2005) |
| 2004 |
| 25 | EE | Jang-Wu Jo,
Byeong-Mo Chang,
Kwangkeun Yi,
Kwang-Moo Choe:
An uncaught exception analysis for Java.
Journal of Systems and Software 72(1): 59-69 (2004) |
| 2001 |
| 24 | EE | Byeong-Mo Chang,
Jang-Wu Jo,
Kwangkeun Yi,
Kwang-Moo Choe:
Interprocedural exception analysis for Java.
SAC 2001: 620-625 |
| 23 | EE | Ik-Soon Kim,
Kwang-Moo Choe:
Error repair with validation in LR-based parsing.
ACM Trans. Program. Lang. Syst. 23(4): 451-471 (2001) |
| 1999 |
| 22 | EE | Gyung-Ok Lee,
Kwang-Moo Choe:
An LR Parser with Pre-Determined Reduction Goals.
Inf. Process. Lett. 72(5-6): 189-196 (1999) |
| 1997 |
| 21 | EE | Kyung-Woo Kang,
Kwang-Moo Choe,
Min-Soo Jung,
Heung-Chul Shin:
An efficient bottom-up tree pattern matching that performs dynamic programming for code generation.
J. Prog. Lang. 5(1): 189-199 (1997) |
| 1994 |
| 20 | EE | Byeong-Mo Chang,
Kwang-Moo Choe,
Roberto Giacobazzi:
Abstract filters: improving bottom-up execution of logic programs by two-phase abstract interpretation.
SAC 1994: 388-393 |
| 19 | | Myung-Joon Lee,
Kwang-Moo Choe:
Boundedly LR( k )-conflictable Grammars.
Acta Inf. 31(3): 261-283 (1994) |
| 18 | | Min-Soo Jung,
Kwang-Moo Choe,
Taisook Han:
An Efficient Computation of Right Context for LR-Based Error Repair.
Inf. Process. Lett. 49(2): 63-71 (1994) |
| 17 | | Eun-Jung Lee,
Kwang-Moo Choe:
Grammar Coverings of a Deterministic Parser with Action Conflicts.
Inf. Process. Lett. 51(2): 85-92 (1994) |
| 16 | | Su-Hyun Lee,
Do-Hyung Kim,
Kwang-Moo Choe:
Path for AND-Parallel Execution of Logic Programs.
Inf. Process. Lett. 52(4): 191-199 (1994) |
| 1993 |
| 15 | | Heung-Chul Shin,
Kwang-Moo Choe:
An Improved LALR(k) Parser Generation for Regular Right Part Grammars.
Inf. Process. Lett. 47(3): 123-129 (1993) |
| 14 | | Byeong-Mo Chang,
Kwang-Moo Choe,
Taisook Han:
Efficient Bottom-Up Execution of Logic Programs Using Abstract Interpretation.
Inf. Process. Lett. 47(3): 149-157 (1993) |
| 13 | | In-Sig Yun,
Kwang-Moo Choe,
Taisook Han:
Syntactic Error Repair Using Repair Patterns.
Inf. Process. Lett. 47(4): 189-196 (1993) |
| 12 | | Byeong-Mo Chang,
Kwang-Moo Choe,
Taisook Han:
Static Filtering on Stratified Programs.
Inf. Process. Lett. 47(5): 237-244 (1993) |
| 11 | | Woo-Jun Park,
Myung-Joon Lee,
Kwang-Moo Choe:
On the Reduction of LR(k) Parsers.
Inf. Process. Lett. 47(5): 245-251 (1993) |
| 10 | | DongGill Lee,
Kwang-Moo Choe,
Taisook Han:
A Description of Dynamic Behavior for Compilers Based on Object Oriented Modeling.
Inf. Process. Lett. 48(4): 163-170 (1993) |
| 1992 |
| 9 | | Do-Hyung Kim,
Kwang-Moo Choe:
Corrigenda: Yet Another Efficient Backward Execution Algorithm in the AND/OR Process Model.
Inf. Process. Lett. 43(3): 165 (1992) |
| 8 | | Do-Hyung Kim,
Kwang-Moo Choe,
Taisook Han:
Refined Mark(s)-Set-Based Backtrack Literal Selection for and Parallelism in Logic Programs.
Parallel Processing Letters 2: 71-79 (1992) |
| 1991 |
| 7 | | Myung-Joon Lee,
Kwang-Moo Choe:
SLR(k) Covering for LR(k) Grammars.
Inf. Process. Lett. 37(6): 337-347 (1991) |
| 6 | | Myung-Joon Lee,
Kwang-Moo Choe:
Corrigenda: SLR(k) Covering for LR(k) Grammars.
Inf. Process. Lett. 38(5): 281 (1991) |
| 5 | | Do-Hyung Kim,
Kwang-Moo Choe:
Yet Another Efficient Backward Execution Algorithm in the AND/OR Process Model.
Inf. Process. Lett. 40(4): 201-211 (1991) |
| 1987 |
| 4 | | Joseph C. H. Park,
Kwang-Moo Choe:
Remarks on Recent Algorithms for LALR Lookahead Sets.
SIGPLAN Notices 22(4): 30-32 (1987) |
| 1986 |
| 3 | | Nam Sung Woo,
Kwang-Moo Choe:
Selecting the Backtrack Literal in the AND/OR Model.
SLP 1986: 200-210 |
| 2 | | Kwang-Moo Choe,
C. H. Chang:
Efficient Computation of the Locally Least-Cost Insertion String for the LR Error Repair.
Inf. Process. Lett. 23(6): 311-316 (1986) |
| 1985 |
| 1 | EE | Joseph C. H. Park,
Kwang-Moo Choe,
C. H. Chang:
A New Analysis of LALR Formalisms.
ACM Trans. Program. Lang. Syst. 7(1): 159-175 (1985) |