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.

Yifei Huang 0007

dblp:71/8763-7 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2025
0009-0006-5675-4065ORCID · verified

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

Software engineering, systems software and programming languages · 2 · 1 first-author · 2 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
Program synthesis and code generation · 33% Requirements engineering and software design · 33% Debugging and program repair · 33%
Theoretical computer science
1 paper
Automata and formal languages · 50% Computational complexity · 50%
Artificial intelligence
1 paper
Image recognition and object detection · 100%

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

TopicWeightPapersLastEvidence papers
Computational complexity › decision problems
membership problem
0.912025
Membership Testing for Semantic Regular Expressions · Proc. ACM Program. Lang. 2025
Automata and formal languages › regular languages
regular expressions
0.912025
Membership Testing for Semantic Regular Expressions · Proc. ACM Program. Lang. 2025
Requirements engineering and software design › specification
specification comprehension
0.712023
Explainable Program Synthesis by Localizing Specifications · Proc. ACM Program. Lang. 2023
Computer vision › Image recognition and object detection › visual concept learning
semantic concept detection
0.312025
Membership Testing for Semantic Regular Expressions · Proc. ACM Program. Lang. 2025

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

large language model · 1.7external oracles · 1.7user study · 0.7
YearPublicationVenuePosition
2025 Membership Testing for Semantic Regular Expressions
abstract
This paper is about semantic regular expressions (SemREs). This is a concept that was recently proposed by Chen et al. [ 9 ] in which classical regular expressions are extended with a primitive to query external oracles such as databases and large language models (LLMs). SemREs can be used to identify lines of text containing references to semantic concepts such as cities, celebrities, political entities, etc. The focus in their paper was on automatically synthesizing semantic regular expressions from positive and negative examples. In this paper, we study the membership testing problem :
Yifei Huang 0007, Matin Amini, Alexis Le Glaunec, Konstantinos Mamouras, Mukund Raghothaman
Proc. ACM Program. Lang.1
2023 Explainable Program Synthesis by Localizing Specifications
abstract
The traditional formulation of the program synthesis problem is to find a program that meets a logical correctness specification. When synthesis is successful, there is a guarantee that the implementation satisfies the specification. Unfortunately, synthesis engines are typically monolithic algorithms, and obscure the correspondence between the specification, implementation and user intent. In contrast, humans often include comments in their code to guide future developers towards the purpose and design of different parts of the codebase. In this paper, we introduce subspecifications as a mechanism to augment the synthesized implementation with explanatory notes of this form. In this model, the user may ask for explanations of different parts of the implementation; the subspecification generated in response is a logical formula that describes the constraints induced on that subexpression by the global specification and surrounding implementation. We develop algorithms to construct and verify subspecifications and investigate their theoretical properties. We perform an experimental evaluation of the subspecification generation procedure, and measure its effectiveness and running time. Finally, we conduct a user study to determine whether subspecifications are useful: we find that subspecifications greatly aid in understanding the global specification, in identifying alternative implementations, and in debugging faulty implementations.
Amirmohammad Nazari, Yifei Huang 0007, Roopsha Samanta, Arjun Radhakrishna, Mukund Raghothaman
Proc. ACM Program. Lang.2