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

Beth Harkness Connell

dblp:85/1935 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2005
—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 · 75% Software maintenance and evolution · 25%

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

TopicWeightPapersLastEvidence papers
Program analysis
data flow analysis
0.112005
Object naming analysis for reverse-engineered sequence diagrams · ICSE 2005
Program analysis › static analysis
interprocedural analysis
0.112005
Object naming analysis for reverse-engineered sequence diagrams · ICSE 2005
Software maintenance and evolution
reverse engineering
0.112005
Object naming analysis for reverse-engineered sequence diagrams · ICSE 2005
Program analysis
static analysis
0.112005
Object naming analysis for reverse-engineered sequence diagrams · ICSE 2005
YearPublicationVenuePosition
2005 Object naming analysis for reverse-engineered sequence diagrams
abstract
UML sequence diagrams are commonly used to represent object interactions in software systems. This work considers the problem of extracting UML sequence diagrams from existing code for the purposes of software understanding and testing. A static analysis for such reverse engineering needs to map the interacting objects from the code to sequence diagram objects. We propose an interprocedural dataflow analysis algorithm that determines precisely which objects are the receivers of certain messages, and assigns the appropriate diagram objects to represent them. Our experiments indicate that the majority of message receivers can be determined exactly, resulting in highly-precise object naming for reverse-engineered sequence diagrams.
Atanas Rountev, Beth Harkness Connell
ICSE2