Kwangkeun Yi

According to our database1, Kwangkeun Yi
  • authored at least 68 papers between 1990 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2017
Machine-learning-guided selectively unsound static analysis.
Proceedings of the 39th International Conference on Software Engineering, 2017

2016
Selective X-Sensitive Analysis Guided by Impact Pre-Analysis.
ACM Trans. Program. Lang. Syst., 2016

Widening with thresholds via binary search.
Softw., Pract. Exper., 2016

2015
Automatically inferring loop invariants via algorithmic learning.
Mathematical Structures in Computer Science, 2015

Static Analysis with Set-Closure in Secrecy.
Proceedings of the Static Analysis - 22nd International Symposium, 2015

Learning a strategy for adapting a program analysis via bayesian optimisation.
Proceedings of the 2015 ACM SIGPLAN International Conference on Object-Oriented Programming, 2015

2014
Global Sparse Analysis Framework.
ACM Trans. Program. Lang. Syst., 2014

A Progress Bar for Static Analyzers.
Proceedings of the Static Analysis - 21st International Symposium, 2014

Selective context-sensitivity guided by impact pre-analysis.
Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, 2014

2013
Access-based abstract memory localization in static analysis.
Sci. Comput. Program., 2013

2012
Extended Report: The Implicit Calculus
CoRR, 2012

Sound Non-statistical Clustering of Static Analysis Alarms.
Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2012

The implicit calculus: a new foundation for generic programming.
Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, 2012

Design and implementation of sparse global analyses for C-like languages.
Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, 2012

GMeta: A Generic Formal Metatheory Framework for First-Order Representations.
Proceedings of the Programming Languages and Systems, 2012

Termination Analysis with Algorithmic Learning.
Proceedings of the Computer Aided Verification - 24th International Conference, 2012

2011
Access Analysis-Based Tight Localization of Abstract Memories.
Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2011

Predicate Generation for Learning-Based Quantifier-Free Loop Invariant Inference.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2011

Static analysis of multi-staged programs via unstaging translation.
Proceedings of the 38th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2011

MeCC: memory comparison-based clone detector.
Proceedings of the 33rd International Conference on Software Engineering, 2011

Access-Based Localization with Bypassing.
Proceedings of the Programming Languages and Systems - 9th Asian Symposium, 2011

2010
An algorithmic mitigation of large spurious interprocedural cycles in static analysis.
Softw., Pract. Exper., 2010

LR error repair using the A* algorithm.
Acta Inf., 2010

Deriving Invariants by Algorithmic Learning, Decision Procedures, and Predicate Abstraction.
Proceedings of the Verification, 2010

Automatically Inferring Quantified Loop Invariants by Algorithmic Learning from Simple Templates.
Proceedings of the Programming Languages and Systems - 8th Asian Symposium, 2010

2009
Abstract parsing for two-staged languages with concatenation.
Proceedings of the Generative Programming and Component Engineering, 2009

Identifying static analysis techniques for finding non-fix hunks in fix revisions.
Proceedings of the Proceeding of the ACM First International Workshop on Data-Intensive Software Management and Mining, 2009

Test Coverage Metric for Two-Staged Language with Abstract Interpretation.
Proceedings of the 16th Asia-Pacific Software Engineering Conference, 2009

2008
Practical memory leak detector based on parameterized procedural summaries.
Proceedings of the 7th International Symposium on Memory Management, 2008

2007
Goal-directed weakening of abstract interpretation results.
ACM Trans. Program. Lang. Syst., 2007

An empirical study on classification methods for alarms from a bug-finding static C analyzer.
Inf. Process. Lett., 2007

2006
Educational Pearl: 'Proof-directed debugging' revisited for a first-order version.
J. Funct. Program., 2006

A polymorphic modal type system for lisp-like multi-staged languages.
Proceedings of the 33rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2006

Type and Effect System for Multi-staged Exceptions.
Proceedings of the Programming Languages and Systems, 4th Asian Symposium, 2006

2005
Static insertion of safe and effective memory reuse commands into ML-like programs.
Sci. Comput. Program., 2005

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

Taming False Alarms from a Domain-Unaware C Analyzer by a Bayesian Statistical Post Analysis.
Proceedings of the Static Analysis, 12th International Symposium, 2005

Automatic Verification of Pointer Programs Using Grammar-Based Shape Analysis.
Proceedings of the Programming Languages and Systems, 2005

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

A Static Reference Flow Analysis to Understand Design Pattern Behavior.
Proceedings of the 11th Working Conference on Reverse Engineering, 2004

Experiments on the effectiveness of an automatic insertion of memory reuses into ML-like programs.
Proceedings of the 4th International Symposium on Memory Management, 2004

2003
Proofs of a Set of Hybrid Let-Polymorphic Type Inference Algorithms.
New Generation Comput., 2003

Inserting Safe Memory Reuse Commands into ML-Like Programs.
Proceedings of the Static Analysis, 10th International Symposium, 2003

Automatic Construction of Hoare Proofs from Abstract Interpretation Results.
Proceedings of the Programming Languages and Systems, First Asian Symposium, 2003

2002
A cost-effective estimation of uncaught exceptions in Standard ML programs.
Theor. Comput. Sci., 2002

A proof method for the correctness of modularized 0CFA.
Inf. Process. Lett., 2002

Engaging students with theory through ACM collegiate programming contest.
Commun. ACM, 2002

Static Monotonicity Analysis for lambda-definable Functions over Lattices.
Proceedings of the Verification, 2002

Static Extensionality Checking for Lambda-Definable Functions Over Lattices.
Proceedings of the Third Asian Workshop on Programming Languages and Systems, 2002

Inserting Safe Memory Re-use Commands into ML-like Programs.
Proceedings of the Third Asian Workshop on Programming Languages and Systems, 2002

An Improved Differential Fixpoint Iteration Method for Program Analysis.
Proceedings of the Third Asian Workshop on Programming Languages and Systems, 2002

Data Flow Analysis of Secure Information-Flow.
Proceedings of the Third Asian Workshop on Programming Languages and Systems, 2002

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

Proving Syntactic Properties of Exceptions in an Ordered Logical Framework.
Proceedings of the Functional and Logic Programming, 5th International Symposium, 2001

Static Monotonicity Analysis for lambda-Definable Functions. over Lattices.
Proceedings of the Second Asian Workshop on Programming Languages and Systems, 2001

2000
A Note on Model Checkers Reuse and Validation.
Proceedings of the First Asian Workshop on Programming Languages and Systems, 2000

Proving Syntactic Properties of Exceptions in an Ordered Logical Framework.
Proceedings of the First Asian Workshop on Programming Languages and Systems, 2000

A Generalization of Hybrid Let-Polymorphic Type Inference Algorithms.
Proceedings of the First Asian Workshop on Programming Languages and Systems, 2000

Partial CPS Transformation Using Static Annotation.
Proceedings of the First Asian Workshop on Programming Languages and Systems, 2000

1999
Exception Analysis for Java.
Proceedings of the Object-Oriented Technology, ECOOP'99 Workshop Reader, 1999

1998
Proofs about a Folklore Let-Polymorphic Type Inference Algorithm.
ACM Trans. Program. Lang. Syst., 1998

An Abstract Interpretation for Estimating Uncaught Exceptions in Standard ML Programs.
Sci. Comput. Program., 1998

1997
Towards a Cost-Effective Estimation of Uncaught Exceptions in SML Programs.
Proceedings of the Static Analysis, 4th International Symposium, 1997

1996
Estimating Uncaught Exceptions in Standard ML Programs from Type-Based Equations.
Proceedings of the COMPSAC '96, 1996

1995
Efficient computation of fixpoints that arise in complex program analysis.
J. Prog. Lang., 1995

1994
Compile-time Detection of Uncaught Exceptions in Standard ML Programs.
SAS, 1994

1993
Automatic Generation and Management of Interprocedural Program Analyses.
Proceedings of the Conference Record of the Twentieth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 1993

1990
On-the-fly circuit to measure the average working set size.
Proceedings of the 1990 IEEE International Conference on Computer Design: VLSI in Computers and Processors, 1990


  Loading...