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

Ning Ci

dblp:59/1901 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1998
—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
Program analysis · 87% Software maintenance and evolution · 13%

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

TopicWeightPapersLastEvidence papers
Program analysis › static analysis › program slicing
interprocedural slicing
0.011998
Reuse-Driven Interprocedural Slicing · ICSE 1998
Program analysis › static analysis
program slicing
0.011998
Reuse-Driven Interprocedural Slicing · ICSE 1998
Software maintenance and evolution
program comprehension
0.011998
Reuse-Driven Interprocedural Slicing · ICSE 1998

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

control flow analysis · 0.0
YearPublicationVenuePosition
1998 Reuse-Driven Interprocedural Slicing
abstract
To manage the evolution of software systems effectively, software developers must understand software systems, identify and evaluate alternative modification strategies, implement appropriate modifications, and validate the correctness of the modifications. One analysis technique that assists in many of these activities is program slicing. To facilitate the application of slicing to large software systems, we adapted a control flow-based interprocedural slicing algorithm so that it accounts for interprocedural control dependencies not recognized by other slicing algorithms, and reuses slicing information for improved efficiency. Our initial studies suggest that additional slice accuracy and slicing efficiency may be achieved with our algorithm.
Mary Jean Harrold, Ning Ci
ICSE2