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
Demo Data from EDBT 2026 / reviewers in the wild / expert

Shachindra N. Maheswari

dblp:93/697 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1976
—ORCID · none

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

Software engineering, systems software and programming languages · 1

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 · 100%
Theoretical computer science
1 paper
Graph algorithms and graph theory · 100%

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

TopicWeightPapersLastEvidence papers
Software testing › test generation › white-box test generation
test path generation		 0.011976
On Two Problems in the Generation of Program Test Paths · IEEE Trans. Software Eng. 1976
Graph algorithms and graph theory
graph traversal		 0.011976
On Two Problems in the Generation of Program Test Paths · IEEE Trans. Software Eng. 1976

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

graph reduction · 0.0complexity analysis · 0.0
YearPublicationVenuePosition
1976 On Two Problems in the Generation of Program Test Paths
abstract
In this paper we analyze the complexity of algorithms for two problems that arise in automatic test path generation for programs: the problem of building a path through a specified set of program statements and the problem of building a path which satisfies impossible-pairs restrictions on statement pairs. These problems are both reduced to graph traversal problems. We give an efficient algorithm for the first, and show that the second is NP-complete.
Harold N. Gabow, Shachindra N. Maheswari, Leon J. Osterweil
 IEEE Trans. Software Eng.2