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

Ashish Gujarathi

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

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

Software engineering, systems software and programming languages · 2

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
Software testing · 87% Programming languages and type systems · 13%

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

TopicWeightPapersLastEvidence papers
Software testing
regression testing
0.012001
Regression Test Selection for Java Software · OOPSLA 2001
Software testing › regression testing
regression test selection
0.012001
Regression Test Selection for Java Software · OOPSLA 2001
Programming languages and type systems › object-oriented programming
java
0.012001
Regression Test Selection for Java Software · OOPSLA 2001

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

program analysis · 0.0
YearPublicationVenuePosition
2001 Regression Test Selection for Java Software
abstract
Regression testing is applied to modified software to provide confidence that the changed parts behave as intended and that the unchanged parts have not been adversely affected by the modifications. To reduce the cost of regression testing, test cases are selected from the test suite that was used to test the original version of the software---this process is called regression test selection. A safe regressiontest -selection algorithm selects every test case in the test suite that may reveal a fault in the modified software. Safe regression-test-selection techniques can help to reduce the time required to perform regression testing because they select only a portion of the test suite for use in the testing but guarantee that the faults revealed by this subset will be the same as those revealed by running the entire test suite. This paper presents the first safe regression-test-selection technique that, based on the use of a suitable representation, handles the features of the Java language. Unlike other safe regression test selection techniques, the presented technique also handles incomplete programs. The technique can thus be safely applied in the (very common) case of Java software that uses external libraries or components
Mary Jean Harrold, James A. Jones, Tongyu Li, Donglin Liang, Alessandro Orso, Maikel Pennings, Saurabh Sinha 0003, Steven Alexander Spoon, Ashish Gujarathi
OOPSLA9
1999 Mining for Program Structure
abstract
We present a new mining algorithm for discovering program structure built on a warehouse of program-analysis data. We make use of statement definition-use data along with variable typing information to learn about the structure of legacy code. Using concept analysis, we develop an interactive knowledge discovery framework into which different types of analysis data can be integrated. This work is the first in a series of data warehousing experiments that is designed to tap the wealth of information hidden in existing program-analysis data.
Renée J. Miller, Ashish Gujarathi
Int. J. Softw. Eng. Knowl. Eng.2