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

Mariana Sharp

dblp:67/4611 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
0since 2021 · last 2008
—ORCID · none

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

Software engineering, systems software and programming languages · 3 · 2 first-author

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 · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 100%

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

TopicWeightPapersLastEvidence papers
Program analysis › static analysis
call graph construction
0.112006
Static Analysis of Object References in RMI-Based Java Software · IEEE Trans. Software Eng. 2006
Program analysis › static analysis
pointer analysis
0.112006
Static Analysis of Object References in RMI-Based Java Software · IEEE Trans. Software Eng. 2006
Program analysis
static analysis
0.112006
Static Analysis of Object References in RMI-Based Java Software · IEEE Trans. Software Eng. 2006
Distributed systems
remote procedure call
0.012006
Static Analysis of Object References in RMI-Based Java Software · IEEE Trans. Software Eng. 2006

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

flow-insensitive analysis · 0.1context-insensitive analysis · 0.1
YearPublicationVenuePosition
2008 IDE Dataflow Analysis in the Presence of Large Object-Oriented Libraries
Atanas Rountev, Mariana Sharp, Guoqing Harry Xu
CC2
2006 Static Analysis of Object References in RMI-Based Java Software
abstract
Distributed applications provide numerous advantages related to software performance, reliability, interoperability, and extensibility. This paper focuses on distributed Java programs built with the help of the remote method invocation (RMI) mechanism. We consider points-to analysis for such applications. Points-to analysis determines the objects pointed to by a reference variable or a reference object field. Such information plays a fundamental role as a prerequisite for many other static analyses. We present the first theoretical definition of points-to analysis for RMI-based Java applications, and we present an algorithm for implementing a flow- and context-insensitive points-to analysis for such applications. We also discuss the use of points-to information for corrupting call graph information, for understanding data dependencies due to remote memory locations, and for identifying opportunities for improving the performance of object serialization at remote calls. The work described in this paper solves one key problem for static analysis of RMI programs and provides a starting point for future work on improving the understanding, testing, verification, and performance of RMI-based software
Mariana Sharp, Atanas Rountev
IEEE Trans. Software Eng.1
2005 Static Analysis of Object References in RMI-Based Java Software
abstract
Distributed applications provide numerous advantages related to software performance, reliability, interoperability, and extensibility. This paper focuses on distributed Java programs built with the help of the remote method invocation (RMI) mechanism. We consider points-to analysis for such applications. Points-to analysis determines the objects pointed to by a reference variable or a reference object field. Such information plays a fundamental role as a prerequisite for many other static analyses. We present the first theoretical definition of points-to analysis for RMI-based Java applications, and an algorithm for implementing a flow- and context-insensitive points-to analysis for such applications. We also discuss the use of points-to information for computing call graph information, for understanding data dependencies due to remote memory locations, and for identifying opportunities for improving the performance of object serialization at remote calls. The work described in this paper solves one key problem for static analysis of RMI programs, and provides a starting point for future work on improving the understanding, testing, verification, and performance of RMI-based software.
Mariana Sharp, Atanas Rountev
ICSM1