Anna Fariha

Anna Fariha

Auto-generated profile, based on publicly available information

Anna Fariha

University of Utah, Salt Lake City, UT, USA

Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
31 October 2022 in Proceedings of the ACM on Programming Languages
Verified
Journal Article
Open access
RBRohan Bavishi
Rohan Bavishi
HJHarshit Joshi
Harshit Joshi
JCJosé Cambronero
José Cambronero
AFAnna Fariha
Anna Fariha
SGSumit Gulwani
Sumit Gulwani
ATAshish Tiwari
Ashish Tiwari
Most users of low-code platforms, such as Excel and PowerApps, write programs in domain-specific formula languages to carry out nontrivial tasks. Often users can write most of the program they want, but introduce small mistakes that yield broken formulas. These mistakes, which can be both syntactic and semantic, are hard for low-code users to identify and fix, even though they can be resolved with just a few edits. We formalize the problem of producing such edits as the last-mile repair problem. To address this problem, we developed LaMirage, a LAst-MIle RepAir-engine GEnerator that combines symbolic and neural techniques to perform last-mile repair in low-code formula languages. LaMirage takes a grammar and a set of domain-specific constraints/rules, which jointly approximate the target language, and uses these to generate a repair engine that can fix formulas in that language. To tackle the challenges of localizing errors and ranking candidate repairs, LaMirage leverages neural techniques, whereas it relies on symbolic methods to generate candidate edits. This combination allows LaMirage to find repairs that satisfy the provided grammar and constraints, and then pick the most natural repair. We compare LaMirage to state-of-the-art neural and symbolic approaches on 400 real Excel and Power Fx formulas, where LaMirage outperforms all baselines. We release these benchmarks to encourage subsequent work in low-code domains.

1 December 2015
Verified
Conference Paper
Closed access
QRQuazi Marufur Rahman
Quazi Marufur Rahman
AFAnna Fariha
Anna Fariha
AMAmit Mandal
Amit Mandal
CAChowdhury Farhan Ahmed
Chowdhury Farhan Ahmed
Carson LeungCarson Leung
Carson Leung
Influential users or leaders in a social network play important roles in viral marketing by spreading news quickly to a large number of people. Hence, various organizations aim to discover these leaders as campaign targets for advertisement so as to maximize customer reachability. Existing approaches detect leaders from a static social network. However, as social networks are evolving, detecting leaders from dynamic streams of social network data is in demand. In this paper, we propose a sliding window-based leader detection (SWLD) algorithm for discovering leaders from streams of user actions in social networks. Experimental results show that SWLD is accurate, requires short runtime and a small amount of memory space.

4 June 2023
Verified
Conference Paper
Open access
BCBhavya Chopra
Bhavya Chopra
AFAnna Fariha
Anna Fariha
SGSumit Gulwani
Sumit Gulwani
AHAustin Z. Henley
Austin Z. Henley
DPDaniel Perelman
Daniel Perelman
ATAshish Tiwari
Ashish Tiwari

7 March 2024
Verified
Conference Paper
Open access
ASAnjali Singh
Anjali Singh
AFAnna Fariha
Anna Fariha
CBChristopher Brooks
Christopher Brooks
GSGustavo Soares
Gustavo Soares
AHAustin Z. Henley
Austin Z. Henley
SGSumit Gulwani
Sumit Gulwani
Data Science (DS) has emerged as a new academic discipline where students are introduced to data-centric thinking and generating data-driven insights through programming. Unlike traditional introductory Computer Science (CS) education, which focuses on program syntax and core CS topics (e.g., algorithms and data structures), introductory DS education emphasizes skills such as analyzing data to gain insights by making effective use of programming libraries (e.g., re, NumPy, pandas, scikit-learn). To better understand learners' needs and pain points when they are introduced to DS programming, we investigated a large online course on data manipulation designed for graduate students who do not have a CS or Statistics undergraduate degree. We qualitatively analyzed students' incorrect code submissions for computational notebook-based assignments in Python. We identified common mistakes and grouped them into the following themes: (1) programming language and environment misconceptions, (2) logical mistakes due to data or problem-statement misunderstanding or incorrectly dealing with missing values, (3) semantic mistakes due to incorrect use of DS libraries, and (4) suboptimal coding. Our work provides instructors insights to understand student needs in introductory DS courses and improve course pedagogy, and recommendations for developing assessment and feedback tools to support students in large courses.

22 June 2025
Verified
Conference Paper
Open access
BCBhavya Chopra
Bhavya Chopra
ASAnanya Singha
Ananya Singha
AFAnna Fariha
Anna Fariha
SGSumit Gulwani
Sumit Gulwani
CPChris Parnin
Chris Parnin
AHAustin Z. Henley
Austin Z. Henley

2 April 2026 in Proceedings of the ACM on Management of Data
Verified
Journal Article
Open access
WCWhanhee Cho
Whanhee Cho
AFAnna Fariha
Anna Fariha
Data summarization is essential to discover insights from large datasets. In spreadsheets, pivot tables offer a convenient way to summarize tabular data by computing aggregates over some attributes, grouped by others. However, identifying attribute combinations that will result in useful pivot tables remains a challenge, especially for high-dimensional datasets. We formalize the problem of automatically recommending insightful and interpretable pivot tables, eliminating the tedious manual process. A crucial aspect of recommending a set of pivot tables is to diversify them. Traditional work inadequately address the table-diversification problem, which leads us to the problem of pivot table diversification . We present SAGE, a data- s emantics- a ware system for recommendin g k-budgeted diverse pivot tables, overcoming the shortcomings of prior work for top-k recommendations that cause redundancy. SAGE ensures that each pivot table is insightful , interpretable , and adaptive to the user's actions and preferences, while also guaranteeing that the set of pivot tables are different from each other, offering a diverse recommendation. We make two key technical contributions: (1) a data-semantics-aware model to measure the utility of a single pivot table and the diversity of a set of pivot tables, and (2) a scalable greedy algorithm that can efficiently select a set of diverse pivot tables of high utility, by leveraging data semantics to significantly reduce the combinatorial search space. Our extensive experiments on four real-world datasets show that SAGE outperforms alternative approaches, and efficiently scales to accommodate high-dimensional datasets. Additionally, through multiple case studies, we demonstrate SAGE's qualitative superiority over existing tools, and through a user study, we validate its practical usefulness and alignment with user preferences.