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

P. V. R. Murthy

dblp:23/2711 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
0since 2021 · last 2011
—ORCID · none

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

Software engineering, systems software and programming languages · 2 · 2 first-authorSystems, architecture and hardware · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 1 · 1 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
Compilers and program optimization · 50% Programming languages and type systems · 50%

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

TopicWeightPapersLastEvidence papers
Compilers and program optimization
compiler analysis
0.011994
Implementation of Speculative Parallelism in Functional Languages · IEEE Trans. Parallel Distributed Syst. 1994
Programming languages and type systems
functional language
0.011994
Implementation of Speculative Parallelism in Functional Languages · IEEE Trans. Parallel Distributed Syst. 1994
Programming languages and type systems
lazy evaluation
0.011994
Implementation of Speculative Parallelism in Functional Languages · IEEE Trans. Parallel Distributed Syst. 1994
Compilers and program optimization › parallelization
speculative parallelization
0.011994
Implementation of Speculative Parallelism in Functional Languages · IEEE Trans. Parallel Distributed Syst. 1994

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

supercombinator analysis · 0.0strictness analysis · 0.0
YearPublicationVenuePosition
2011 Quality Model Driven Dynamic Analysis
abstract
Release managers often face a dilemma about the quality of software under delivery before a release. The presence of run-time errors such as memory leaks, buffer overflows, and deadlocks affects quality attributes such as efficiency, security, and reliability. Such errors are detected using dynamic analysis methods in practice. However, the dynamic analysis methods employed in practice are by and large ad hoc. It is essential to use dynamic analysis focusing on finding the right set of run-time errors in a software component that have the maximum impact on quality. There exists a need to identify quality attributes such as reliability, efficiency, and security that are important for a software component, or, a system. In this paper, a quality model driven dynamic analysis methodology is proposed. Various run-time errors that can arise during the execution of programs written in a language such as C++ are mapped to the respective quality attributes, thereby forming a basis for run-time error classification. Our experiences in the application of dynamic analysis on real projects are reported. The methodology reports the error findings mapped to the quality attributes along with their distributions. The reported findings help management understand quality problems and take appropriate corrective action.
P. V. R. Murthy, Saravana Kumar V., Tushar Sharma 0001, Kiron Rao
COMPSAC1
2007 Refactoring Methods
abstract
This tutorial provides an introduction to the problems faced in software evolution, and why we need to be concerned about refactoring design and code on a continuous basis. Such refactoring helps ensure that software is more easily changeable, and the costs of development and maintenance are reduced. This tutorial addresses (a) refactoring techniques that a developer can employ during design and coding and (b) static analysis techniques that detect opportunities for refactoring.
P. V. R. Murthy, T. Rajaram, S. Hemanth
WICSA1
1994 Implementation of Speculative Parallelism in Functional Languages
abstract
A compile-time analysis technique is developed to derive the probability with which a user-defined function or a supercombinator requires each one of its arguments. This provides a basis for identifying useful speculative parallelism in a program. The performance of speculative evaluation is compared with that of lazy evaluation, and the necessary conditions under which speculative evaluation performs better are identified.>
P. V. R. Murthy
IEEE Trans. Parallel Distributed Syst.1