Snigdha Athaiya

dblp:202/8445 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
1since 2021 · last 2021
0009-0003-2657-3333ORCID · reported

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

Software engineering, systems software and programming languages · 3 · 3 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
2 papers
Program analysis · 78% Debugging and program repair · 17% Program verification · 5%

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

TopicWeightPapersLastEvidence papers
Program analysis
static analysis
0.622017
Testing and analysis of web applications using page models · ISSTA 2017
Testing and analysis of web applications using page models · ISSTA 2017
Program analysis › static analysis
web application analysis
0.622017
Testing and analysis of web applications using page models · ISSTA 2017
Testing and analysis of web applications using page models · ISSTA 2017
Debugging and program repair
fault localization
0.312017
Testing and analysis of web applications using page models · ISSTA 2017
Program analysis
data flow analysis
0.112017
Testing and analysis of web applications using page models · ISSTA 2017
Program analysis › symbolic execution
dynamic symbolic execution
0.112017
Testing and analysis of web applications using page models · ISSTA 2017
Program verification
model checking
0.112017
Testing and analysis of web applications using page models · ISSTA 2017

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

static slicing · 0.3static analysis · 0.3page model construction · 0.3dynamic fault localization · 0.3concolic execution · 0.3
YearPublicationVenuePosition
2021 Data Flow Analysis of Asynchronous Systems using Infinite Abstract Domains
abstract
Abstract Asynchronous message-passing systems are employed frequently to implement distributed mechanisms, protocols, and processes. This paper addresses the problem of precise data flow analysis for such systems. To obtain good precision, data flow analysis needs to somehow skip execution paths that read more messages than the number of messages sent so far in the path, as such paths are infeasible at run time. Existing data flow analysis techniques do elide a subset of such infeasible paths, but have the restriction that they admit only finite abstract analysis domains. In this paper we propose a generalization of these approaches to admit infinite abstract analysis domains, as such domains are commonly used in practice to obtain high precision. We have implemented our approach, and have analyzed its performance on a set of 14 benchmarks. On these benchmarks our tool obtains significantly higher precision compared to a baseline approach that does not elide any infeasible paths and to another baseline that elides infeasible paths but admits only finite abstract domains.
Snigdha Athaiya, Raghavan Komondoor, K. Narayan Kumar
ESOP1
2017 Testing and analysis of web applications using page models
abstract
Web applications are difficult to analyze using code-based tools because data-flow and control-flow through the application occurs via both server-side code and client-side pages. Client-side pages are typically specified in a scripting language that is different from the main server-side language; moreover, the pages are generated dynamically from the scripts. To address these issues we propose a static-analysis approach that automatically constructs a "model" of each page in a given application. A page model is a code fragment in the same language as the server-side code, which faithfully over-approximates the possible elements of the page as well as the control-flows and data-flows due to these elements. The server-side code in conjunction with the page models then becomes a standard (non-web) program, thus amenable to analysis using standard code-based tools.
Snigdha Athaiya
ISSTA1
2017 Testing and analysis of web applications using page models
abstract
Web applications are difficult to analyze using code-based tools because data-flow and control-flow through the application occurs via both server-side code and client-side pages. Client-side pages are typically specified in a scripting language that is different from the main server-side language; moreover, the pages are generated dynamically from the scripts. To address these issues we propose a static-analysis approach that automatically constructs a ``model'' of each page in a given application. A page model is a code fragment in the same language as the server-side code, which faithfully over-approximates the possible elements of the page as well as the control-flows and data-flows due to these elements. The server-side code in conjunction with the page models then becomes a standard (non-web) program, thus amenable to analysis using standard code-based tools. We have implemented our approach in the context of J2EE applications. We demonstrate the versatility and usefulness of our approach by applying three standard analysis tools on the resultant programs from our approach: a concolic-execution based model checker (JPF), a dynamic fault localization tool (Zoltar), and a static slicer (Wala).
Snigdha Athaiya, Raghavan Komondoor
ISSTA1