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

Eshgin Hasanov

dblp:435/7986 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2026
—ORCID · none

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

Artificial intelligence and machine learning · 1 · 1 first-author · 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
Program analysis · 77% Software testing · 23%
Artificial intelligence
1 paper
Language models and text generation · 100%

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

TopicWeightPapersLastEvidence papers
Natural language and speech › Language models and text generation › large language model reasoning
code reasoning
1.012026
The Path Not Taken: Duality in Reasoning about Program Execution · ACL (1) 2026
Program analysis
dynamic analysis
1.012026
The Path Not Taken: Duality in Reasoning about Program Execution · ACL (1) 2026
Software testing
test input generation
0.312026
The Path Not Taken: Duality in Reasoning about Program Execution · ACL (1) 2026

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

large language model evaluation · 2.0benchmark construction · 2.0
YearPublicationVenuePosition
2026 The Path Not Taken: Duality in Reasoning about Program Execution
abstract
Large language models (LLMs) have shown remarkable capabilities across diverse coding tasks.However, their adoption requires a true understanding of program execution rather than relying on surface-level patterns.Existing benchmarks primarily focus on predicting program properties tied to specific inputs (e.g., code coverage, program outputs).As a result, they provide a narrow view of dynamic code reasoning and are prone to data contamination.We argue that understanding program execution requires evaluating its inherent duality through two complementary reasoning tasks: (i) predicting a program's observed behavior for a given input, and (ii) inferring how the input must be mutated toward a specific behavioral objective.Both tasks jointly probe a model's causal understanding of execution flow.We instantiate this duality in DEXBENCH, a benchmark comprising 445 paired instances, and evaluate 13 LLMs.Our results demonstrate that dual-path reasoning provides a robust and discriminative proxy for dynamic code understanding.
Eshgin Hasanov, Md. Mahadi Hassan, Shubhra Kanti Karmaker Santu, Aashish Yadavally
ACL (1)1