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. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Kyeling Ong

dblp:325/9145 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2025
—ORCID · none

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

Software engineering, systems software and programming languages · 1 · 1 since 2021Human-computer interaction and ubiquitous computing · 1 · 1 since 2021

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
1 paper
Programming languages and type systems · 33% Program verification · 33% Program synthesis and code generation · 33%
Artificial intelligence
1 paper
Language models and text generation · 100%

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

TopicWeightPapersLastEvidence papers
Program synthesis and code generation
code generation with language models
0.912025
Neurosymbolic Modular Refinement Type Inference · ICSE 2025
Programming languages and type systems › type systems
refinement types
0.912025
Neurosymbolic Modular Refinement Type Inference · ICSE 2025
Program verification › type-based verification
refinement type inference
0.912025
Neurosymbolic Modular Refinement Type Inference · ICSE 2025
Natural language and speech › Language models and text generation
large language model
0.312025
Neurosymbolic Modular Refinement Type Inference · ICSE 2025

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

neuro-symbolic reasoning · 1.7large language model · 1.7fine-tuning · 1.7
YearPublicationVenuePosition
2025 Neurosymbolic Modular Refinement Type Inference
abstract
Refinement types, a type-based generalization of Floyd-Hoare logics, are an expressive and modular means of statically ensuring a wide variety of correctness, safety, and security properties of software. However, their expressiveness and modularity means that to use them, a developer must laboriously annotate all the functions in their code with potentially complex type specifications that specify the contract for that function. We present LHC, a neurosymbolic agent that uses LLMs to automatically generate refinement type annotations for all the functions in an entire package or module, using the refinement type checker LiquidHaskell as an oracle to verify the correctness of the generated specifications. We curate a dataset of three Haskell packages where refinement types are used to enforce a variety of correctness properties from data structure invariants to low-level memory safety and use this dataset to evaluate LHC. Previously these packages required expert users several days to weeks to annotate with refinement types. Our evaluation shows that even when using relatively smaller models like the 3 billion parameter StarCoder LLM, by using fine-tuning and carefully chosen contexts, our neurosymbolic agent generates refinement types for up to 94% of the functions across entire libraries automatically in just a few hours, thereby showing that LLMs can drastically shrink the human effort needed to use formal verification.
Georgios Sakkas, Pratyush Sahu, Kyeling Ong, Ranjit Jhala
ICSE3
2022 Exploring Group Dynamics in a Group-Structured Computing Undergraduate Research Experience
abstract
While the computer science community has explored the importance of Undergraduate Research Experiences (UREs) and, separately, collaboration in computing (e.g. pair programming), little research has studied collaboration in the context of a URE. We performed a qualitative thematic analysis of how students collaborate within a group-structured, academic-year, inclusive computing URE catered towards second-year students at two large public research universities in the United States. We analyzed free-response and Likert-scale survey data collected early and late in the program from a total of 106 students who comprised three program cohorts. We studied their overall group function, what aspects of group work led to positive or negative group experiences, how their group affected their feelings of being supported, and how their group affected their sense of belonging in computing. We found that group experiences were overwhelmingly positive. Further, we found that students’ experiences in groups centered around three themes: group fit and belonging, emotional and academic support, and logistics. Within each theme, their experiences were rich and nuanced, and we observed variations by gender, and to a lesser degree by race. Our work suggests that group-structured UREs are both feasible and beneficial for students, and we give concrete suggestions for how to make these experiences successful.
Katherine Izhikevich, Kyeling Ong, Christine Alvarado
ICER (1)2