Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Kin-Keung Ma

dblp:92/4060 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
0since 2021 · last 2011
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Software engineering, systems software and programming languages · 3 · 2 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Software engineering, system software, and programming languages
2 papers
Program analysis · 73% Software testing · 18% Empirical software engineering · 6%

Topics — the 8 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Program analysis
configuration analysis
0.112010
Using symbolic evaluation to understand behavior in configurable software systems · ICSE (1) 2010
Software testing › test coverage
coverage analysis
0.112010
Using symbolic evaluation to understand behavior in configurable software systems · ICSE (1) 2010
Program analysis
symbolic execution
0.112010
Using symbolic evaluation to understand behavior in configurable software systems · ICSE (1) 2010
Program analysis › static analysis › pointer analysis
ownership inference
0.112007
Inferring aliasing and encapsulation properties for java · OOPSLA 2007
Program analysis › static analysis
pointer analysis
0.112007
Inferring aliasing and encapsulation properties for java · OOPSLA 2007
Program analysis
static analysis
0.112007
Inferring aliasing and encapsulation properties for java · OOPSLA 2007
Empirical software engineering › software engineering research methodology
empirical study
0.012010
Using symbolic evaluation to understand behavior in configurable software systems · ICSE (1) 2010
Programming languages and type systems
object-oriented programming
0.012007
Inferring aliasing and encapsulation properties for java · OOPSLA 2007

Methods — techniques the papers use, named apart from their topics

symbolic evaluation · 0.1coverage analysis · 0.1intraprocedural points-to analysis · 0.1interprocedural demand-driven predicate resolution · 0.1
YearPublicationVenuePosition
2011 Directed Symbolic Execution
Kin-Keung Ma, Yit Phang Khoo, Jeffrey S. Foster, Michael Hicks 0001
SAS1
2010 Using symbolic evaluation to understand behavior in configurable software systems
abstract
Many modern software systems are designed to be highly configurable, which increases flexibility but can make programs hard to test, analyze, and understand. We present an initial empirical study of how configuration options affect program behavior. We conjecture that, at certain levels of abstraction, configuration spaces are far smaller than the worst case, in which every configuration is distinct. We evaluated our conjecture by studying three configurable software systems: vsftpd, ngIRCd, and grep. We used symbolic evaluation to discover how the settings of run-time configuration options affect line, basic block, edge, and condition coverage for our subjects under a given test suite. Our results strongly suggest that for these subject programs, test suites, and configuration options, when abstracted in terms of the four coverage criteria above, configuration spaces are in fact much smaller than combinatorics would suggest and are effectively the composition of many small, self-contained groupings of options.
Elnatan Reisner, Charles Song, Kin-Keung Ma, Jeffrey S. Foster, Adam A. Porter
ICSE (1)3
2007 Inferring aliasing and encapsulation properties for java
abstract
There are many proposals for language techniques to control aliasing and encapsulation in object oriented programs, typically based on notions of object ownership and pointer uniqueness. Most of these systems require extensive manual annotations, and thus there is little experience with these properties in large, existing Java code bases. To remedy this situation, we present Uno, a novel static analysis for automatically inferring ownership, uniqueness, and other aliasing and encapsulation properties in Java. Our analysis requires no annotations, and combines an intraprocedural points-to analysis with an interprocedural, demand-driven predicate resolution algorithm. We have applied Uno to a variety of Java applications and found that some aliasing properties, such as temporarily lending a reference to a method, are common, while others, in particular field and argument ownership, are relatively uncommon. As a result, we believe that Uno can be a valuable tool for discovering and understanding aliasing and encapsulation in Java programs.
Kin-Keung Ma, Jeffrey S. Foster
OOPSLA1