default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKwang-Moo Choe
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2013
[j31]Jeong-Han Yun, Chul-Joo Kim, Seonggun Kim, Kwang-Moo Choe, Taisook Han:
Detection of harmful schizophrenic statements in esterel. ACM Trans. Embed. Comput. Syst. 12(3): 80:1-80:23 (2013)- 2011
- [j30]Woongsik Choi, Kwang-Moo Choe:
Cycle elimination for invocation graph-based context-sensitive pointer analysis. Inf. Softw. Technol. 53(8): 818-833 (2011) - [j29]Seonggun Kim, Hwansoo Han, Kwang-Moo Choe:
Region-based parallelization of irregular reductions on explicitly managed memory hierarchies. J. Supercomput. 56(1): 25-55 (2011) - 2010
- [j28]Chul-Joo Kim, Jeong-Han Yun, Seonggun Kim, Kwang-Moo Choe, Taisook Han:
Over-Approximated Control Flow Graph Construction on Pure Esterel. IEICE Trans. Inf. Syst. 93-D(5): 985-993 (2010) - [j27]Youil Kim, Jooyong Lee, Hwansoo Han, Kwang-Moo Choe:
Filtering false alarms of buffer overflow analysis using SMT solvers. Inf. Softw. Technol. 52(2): 210-219 (2010) - [j26]Keoncheol Shin, Hwansoo Han, Kwang-Moo Choe:
Composition-based Cache simulation for structure reorganization. J. Syst. Archit. 56(2-3): 136-149 (2010) - 2006
- [j25]Seunghwan O, Kwang-Moo Choe:
LR Formalisms as Abstract Interpretations of Grammar Semantics. IEICE Trans. Inf. Syst. 89-D(12): 2924-2932 (2006) - 2005
- [j24]Hyunjun Eo, Kwangkeun Yi, Kwang-Moo Choe:
Static Extensivity Analysis for ?-Definable Functions over Lattices. New Gener. Comput. 24(1): 53-78 (2005) - [j23]Gyung-Ok Lee, Kwang-Moo Choe:
A Powerful LL(k) Covering Transformation. SIAM J. Comput. 35(2): 359-377 (2005) - 2004
- [j22]Jang-Wu Jo, Byeong-Mo Chang, Kwangkeun Yi, Kwang-Moo Choe:
An uncaught exception analysis for Java. J. Syst. Softw. 72(1): 59-69 (2004) - 2001
- [j21]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
- [j20]Gyung-Ok Lee, Kwang-Moo Choe:
An LR Parser with Pre-Determined Reduction Goals. Inf. Process. Lett. 72(5-6): 189-196 (1999) - 1997
- [j19]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. Program. Lang. 5(1): 189-199 (1997) - 1994
- [j18]Myung-Joon Lee, Kwang-Moo Choe:
Boundedly LR( k )-conflictable Grammars. Acta Informatica 31(3): 261-283 (1994) - [j17]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) - [j16]Eun-Jung Lee, Kwang-Moo Choe:
Grammar Coverings of a Deterministic Parser with Action Conflicts. Inf. Process. Lett. 51(2): 85-92 (1994) - [j15]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
- [j14]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) - [j13]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) - [j12]In-Sig Yun, Kwang-Moo Choe, Taisook Han:
Syntactic Error Repair Using Repair Patterns. Inf. Process. Lett. 47(4): 189-196 (1993) - [j11]Byeong-Mo Chang, Kwang-Moo Choe, Taisook Han:
Static Filtering on Stratified Programs. Inf. Process. Lett. 47(5): 237-244 (1993) - [j10]Woo-Jun Park, Myung-Joon Lee, Kwang-Moo Choe:
On the Reduction of LR(k) Parsers. Inf. Process. Lett. 47(5): 245-251 (1993) - [j9]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
- [j8]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) - [j7]Do-Hyung Kim, Kwang-Moo Choe, Taisook Han:
Refined Mark(s)-Set-Based Backtrack Literal Selection for and Parallelism in Logic Programs. Parallel Process. Lett. 2: 71-79 (1992) - 1991
- [j6]Myung-Joon Lee, Kwang-Moo Choe:
SLR(k) Covering for LR(k) Grammars. Inf. Process. Lett. 37(6): 337-347 (1991) - [j5]Myung-Joon Lee, Kwang-Moo Choe:
Corrigenda: SLR(k) Covering for LR(k) Grammars. Inf. Process. Lett. 38(5): 281 (1991) - [j4]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
- [j3]Joseph C. H. Park, Kwang-Moo Choe:
Remarks on Recent Algorithms for LALR Lookahead Sets. ACM SIGPLAN Notices 22(4): 30-32 (1987) - 1986
- [j2]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
- [j1]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)
Conference and Workshop Papers
- 2011
- [c6]Se-Won Kim, Kwang-Moo Choe:
String Analysis as an Abstract Interpretation. VMCAI 2011: 294-308 - 2009
- [c5]Jeong-Han Yun, Chul-Joo Kim, Sunae Seo, Taisook Han, Kwang-Moo Choe:
Refining schizophrenia via graph reachability in Esterel. MEMOCODE 2009: 18-27 - [c4]Dongseok Jang, Kwang-Moo Choe:
Points-to analysis for JavaScript. SAC 2009: 1930-1937 - 2001
- [c3]Byeong-Mo Chang, Jang-Wu Jo, Kwangkeun Yi, Kwang-Moo Choe:
Interprocedural exception analysis for Java. SAC 2001: 620-625 - 1994
- [c2]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 - 1986
- [c1]Nam Sung Woo, Kwang-Moo Choe:
Selecting the Backtrack Literal in the AND/OR Model. SLP 1986: 200-210
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
