2008 |
13 | EE | Hongseok Yang,
Oukseh Lee,
Josh Berdine,
Cristiano Calcagno,
Byron Cook,
Dino Distefano,
Peter W. O'Hearn:
Scalable Shape Analysis for Systems Code.
CAV 2008: 385-398 |
2007 |
12 | EE | Jin-Woo Jeong,
Kyung-Wook Park,
Oukseh Lee,
Dong-Ho Lee:
Automatic Extraction of Semantic Relationships from Images Using Ontologies and SVM Classifiers.
MCAM 2007: 184-194 |
2006 |
11 | EE | Tae-Hyoung Choi,
Oukseh Lee,
Hyunha Kim,
Kyung-Goo Doh:
A Practical String Analyzer by the Widening Approach.
APLAS 2006: 374-388 |
2005 |
10 | EE | Oukseh Lee,
Hongseok Yang,
Kwangkeun Yi:
Automatic Verification of Pointer Programs Using Grammar-Based Shape Analysis.
ESOP 2005: 124-140 |
9 | EE | Oukseh Lee,
Hongseok Yang,
Kwangkeun Yi:
Static insertion of safe and effective memory reuse commands into ML-like programs.
Sci. Comput. Program. 58(1-2): 141-178 (2005) |
2004 |
8 | EE | Oukseh Lee,
Kwangkeun Yi:
Experiments on the effectiveness of an automatic insertion of memory reuses into ML-like programs.
ISMM 2004: 97-107 |
2003 |
7 | EE | Oukseh Lee,
Hongseok Yang,
Kwangkeun Yi:
Inserting Safe Memory Reuse Commands into ML-Like Programs.
SAS 2003: 171-188 |
6 | EE | Hyunjun Eo,
Oukseh Lee,
Kwangkeun Yi:
Proofs of a Set of Hybrid Let-Polymorphic Type Inference Algorithms.
New Generation Comput. 22(1): (2003) |
2002 |
5 | | Oukseh Lee,
Hongseok Yang,
Kwangkeun Yi:
Inserting Safe Memory Re-use Commands into ML-like Programs.
APLAS 2002: 317-333 |
4 | EE | Oukseh Lee,
Kwangkeun Yi,
Yunheung Paek:
A proof method for the correctness of modularized 0CFA.
Inf. Process. Lett. 81(4): 179-185 (2002) |
2001 |
3 | | Oukseh Lee:
An Effect System Combining Alias and Liveness for Explicit Memory Reuse.
APLAS 2001: 133-145 |
2000 |
2 | | Oukseh Lee,
Kwangkeun Yi:
A Generalization of Hybrid Let-Polymorphic Type Inference Algorithms.
APLAS 2000: 79-88 |
1998 |
1 | EE | Oukseh Lee,
Kwangkeun Yi:
Proofs about a Folklore Let-Polymorphic Type Inference Algorithm.
ACM Trans. Program. Lang. Syst. 20(4): 707-723 (1998) |